Mathematics catalogue
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
16,859 records · Search and filter
- Math-11451 The Kusner conjecture
- Math-11452 Opaque forest problem on finding opaque sets for various planar shapes
- Math-11453 Tripod packing
- Math-11454 The Atiyah conjecture on configurations on the invertibility of a certain $n$-by-$n$ matrix depending on $n$ points in $\mathbb{R}^{3}$
- Math-11455 The values of the Hermite constants for dimensions other than 1–8 and 24
- Math-11456 Lebesgue's universal covering problem on the minimum-area convex shape in the plane that can cover any shape of diameter one
- Math-11457 Moser's worm problem
- Math-11458 Is the upper bound of a closed knot's minimum ropelength linear to its crossing number
- Math-11459 Babai's problem
- Math-11460 Increasing Polarized Ramsey Theorem
- Math-11461 Reverse-Mathematical Strength of Hindman's Theorem
- Math-11462 Strength of the Dual Ramsey Theorem
- Math-11463 Strength of the Carlson–Simpson Lemma
- Math-11464 Cancellation and Schröder–Bernstein for Torsion Abelian Groups
- Math-11465 Metrization of Proper MF Spaces
- Math-11466 Lebesgue Differentiation and Weak Weak König's Lemma
- Math-11467 Strength of the Auslander–Ellis Theorem
- Math-11468 Well-Ordered Linearizations
- Math-11469 Reverse Mathematics of Fraïssé's Conjecture
- Math-11470 Lengths of Bounded-Rank Linear-Order WQOs
- Math-11471 Strengths of Laver and Nash–Williams BQO Theorems
- Math-11472 Three-Element Better-Quasi-Order
- Math-11473 Weak Infinitary Comprehension versus Weak Choice
- Math-11474 Open Mapping Theorem for Separable Banach Spaces
- Math-11475 Strength of the Krein–Šmulian Theorem
- Math-11476 Strength of Szemerédi's Theorem
- Math-11477 Strength of Kříž's Labeled-Tree Theorem
- Math-11478 Ramsey's Theorem for Triples over a Weak Base
- Math-11479 Does every simple first-order theory have stable forking
- Math-11480 The universality problem for C-free graphs
- Math-11481 Separatrix Splitting under Quasiperiodic Forcing
- Math-11482 Optimal Flux for the Quarter-Filled Band
- Math-11483 Multivariate analysis
- Math-11484 $\beta$-ensembles
- Math-11485 The Toda lattice with random initial data
- Math-11486 O9 — Counting distinct prime factors
- Math-11487 O18b — Recognizing primitive roots randomly
- Math-11488 O22a — Discrete logarithms modulo a composite
- Math-11489 O24 — Finding a point on an elliptic curve
- Math-11490 O35 — Greatest common divisors in NC
- Math-11491 Absolute bounds for rational Diophantine tuples
- Math-11492 Exceptional parameters without D(n)-quadruples
- Math-11493 Finiteness of parameters admitting at most two D(n)-quadruples
- Math-11494 Finiteness of D(n)-quadruples for nonsquare n
- Math-11495 Extremal parameters for D(n)-quintuples
- Math-11496 Triples having property D(n) for several parameters
- Math-11497 Existence of a rational Diophantine septuple
- Math-11498 Parameters admitting infinitely many rational D(q)-quintuples
- Math-11499 Existence of a strong rational Diophantine quadruple
- Math-11500 Degree-only bounds for polynomial D(n)-tuples