Top Open Problems
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.
5,373 records · Search and filter
- Math-2601 Lifting an adjoint section from its reduced support
- Math-2602 Tate classes on finite-field abelian varieties
- Math-2603 Terminal numerical-dimension-one abundance in positive characteristic
- Math-2604 Uniform Cartier-section thresholds for Fano-type contractions
- Math-2605 Uniform effective log-Iitaka systems for fourfolds
- Math-2606 Uniform log-Iitaka systems with fixed coefficients
- Math-2607 A uniform pluricanonical Iitaka degree
- Math-2608 Unramified de Rham quantum Langlands at irrational level
- Math-2609 Virasoro propagation through projective bundles
- Math-2610 Deterministic polynomial construction of strong thin spanning trees
- Math-2611 Barker-sequence length conjecture
- Math-2612 Borsuk covering assertion in dimension nine
- Math-2613 Bounded-degree coboundary expanders in each dimension at least three
- Math-2614 Circulant Hadamard conjecture
- Math-2615 Logarithmic correspondence-coloring bound for fixed forbidden cliques
- Math-2616 Colin de Verdière chromatic-number conjecture
- Math-2617 Deterministic nonbipartite Ramanujan graphs in every fixed degree
- Math-2618 Fractional chromatic number versus ordinary Hadwiger number
- Math-2619 Gopalan–Servedio square-root-degree Fourier bound
- Math-2620 Shareshian–Wachs elementary positivity for chromatic quasisymmetric functions
- Math-2621 Graph decomposition at the integral expectation threshold
- Math-2622 Log-squared sharp threshold for monotone graph properties
- Math-2623 Power improvement for planar halving lines
- Math-2624 Power improvement over exponent two in Heilbronn triangle constructions
- Math-2625 Optimal-order distinct distances in every dimension at least three
- Math-2626 Uniform variance-influence bound for hypergraph properties
- Math-2627 Integral and fractional expectation thresholds within a constant factor
- Math-2628 Degree-uniform power saving for intersective polynomial differences
- Math-2629 Polynomial induced removal for ordered binary matrices
- Math-2630 Periodic tilings by bounded measurable sets in three dimensions
- Math-2631 Periodic translational tiling in dimension three
- Math-2632 Five-colorability of the unit-distance plane
- Math-2633 Power saving for prime-intersective polynomial differences
- Math-2634 Quasipolynomial density decay for progression-free sets
- Math-2635 Sharp logarithmic exponents for fixed off-diagonal Ramsey numbers
- Math-2636 Maker winning strategy for Snaky on the infinite square lattice
- Math-2637 Talagrand discrete convexity conjecture
- Math-2638 Sharp terminal edge count in random triangle removal
- Math-2639 Power improvement over the planar unit-distance exponent four thirds
- Math-2640 Weak pinned planar distance assertion
- Math-2641 Triangular-cylinder approximation of aligned radial sweeps
- Math-2642 Half-minimum-area bound for cylinder covers
- Math-2643 Linear coefficient of minimum spherical logarithmic energy
- Math-2644 Binary edit distance has exponential-scale L1 distortion
- Math-2645 Uniform L1 distortion for bounded treewidth
- Math-2646 Simplex maximum for projection-body volume
- Math-2647 Directionwise normalized cylinder-covering bound
- Math-2648 Sharp exponential scale of edit-distance distortion
- Math-2649 One signing for all Euclidean prefixes
- Math-2650 Euclidean Steinitz–Bergström bound