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-11801 Exact output-sensitive scaling for decomposable discrete models
- Math-11802 Arbitrary logistic cell gaps with positive margins and ordinary-margin obstructions
- Math-11803 Exact chain gluing and a sharp cyclic incompatibility certificate
- Math-11804 Explicit Gaussian MLE for monotone block missingness
- Math-11805 Nondefectivity and low-degree obstructions for the two-component S4 Birkhoff model
- Math-11806 An exact MLE fiber for the smallest binary hidden-variable model
- Math-11807 Saturation-aware exceptional likelihood fibers and the 2x2 independence locus
- Math-11808 Covariance-whitened polynomial invariants for model goodness of fit
- Math-11809 Removing term order without hiding the extrapolation choice
- Math-11810 Finite-field least squares as statistical decoding
- Math-11811 Cyclic-binomial structure in an early Agrawal conjecture
- Math-11812 A norm obstruction for Agrawal's conjecture
- Math-11813 Perfect-number recognition and simultaneous polynomial divisors
- Math-11814 Adjacent nonisogenous fibers in the Legendre family
- Math-11815 Irreducible line sections: exact convention-sensitive counts and monodromy status
- Math-11816 Binomial windows for prescribed-degree factors
- Math-11817 Information and conditioning audit for zeta-zero primality and factoring proposals
- Math-11818 A local-to-global screen for number-field ECM torsion
- Math-11819 Geometry, residues, and scale thresholds for prescribed-prefix prime products
- Math-11820 A nonresidue-to-witness reduction and exact witness count
- Math-11821 Finite certificate interfaces for finite-field zeta functions
- Math-11822 Deformation, specialization, and plane-curve genus
- Math-11823 Deterministic roots of X^3-2: a density-one-eighteenth residual envelope
- Math-11824 Regular-orbit equivalence and affine orbit-size certificates for SDLP
- Math-11825 A stabilizer-aware query barrier for vectorization lower bounds
- Math-11826 The inverse-state twist interface, extraction boundary, and exact storage limit
- Math-11827 A one-round action barrier and leave-one-out multiparty key routing
- Math-11828 Exact rank-one decoding and a factorized no-QRAM quantum baseline
- Math-11829 Hidden Goppa presentations versus public-code decoding
- Math-11830 Certificates for hidden Goppa structure and bounded decoding
- Math-11831 Grover optimality and a tail-profile bound for average-value search
- Math-11832 Multiple marked inputs: exclusion bounds and tight query regimes
- Math-11833 Finite-window reduction and binary-cost accounting for hidden shift on the integers
- Math-11834 A batch-fidelity obstruction in hidden-shift attacks on unique-SVP
- Math-11835 Exact period-quotient reduction and unary lift cost for hidden shift on Z^d
- Math-11836 Spectral laws for Gaussian multiple-shift states
- Math-11837 The cyclic core of Heisenberg hidden shift
- Math-11838 The real cost of the CSIDH hidden-shift attack
- Math-11839 Exact DDH leakage and sampler criteria for the CSIDH torsor
- Math-11840 Finite resource bounds for random spherical covering
- Math-11841 HHL, Macaulay conditioning, and presentation instability
- Math-11842 Offline Simon, explicit HSP instances, and a classical-transcript obstruction
- Math-11843 A localization-safe action of Weyl operators
- Math-11844 Degree-windowed Cech computation and the role of one b-function
- Math-11845 Fixed-ambient extraction of roots of finite Frobenius modules
- Math-11846 Random-access slices of free resolutions
- Math-11847 A fixed-basis semibasis certificate for DG-module interoperability
- Math-11848 Degree-local Hom computation and certified corner reuse
- Math-11849 Expected-Optimum Approximation for Random MAX $R$-3SAT
- Math-11850 Approximability and Parameterized Complexity of Steiner Forest