Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (376 pages, 2893 entries) |
Automatic refresh from the published result pages (376 pages, 2947 entries) |
||
| (9 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
This page lists every result page of this wiki with the number of public follow-up works recorded on it, from the most to the fewest. It is generated from the follow-up tables of the result pages as they stood on | This page lists every result page of this wiki with the number of public follow-up works recorded on it, from the most to the fewest. It is generated from the follow-up tables of the result pages as they stood on 5 November 2026. The table can be re-sorted by any column. | ||
== Summary == | == Summary == | ||
* 376 result pages; 376 of them list at least one public follow-up. | * 376 result pages; 376 of them list at least one public follow-up. | ||
* | * 2947 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 670 | ||
** Formalizations: | ** Formalizations: 35 | ||
** Reviews and verifications: | ** Reviews and verifications: 926 | ||
** Critiques and corrections: 21 | ** Critiques and corrections: 21 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 1295 | ||
== Results == | == Results == | ||
| Line 14: | Line 14: | ||
! Result !! Area !! Follow-ups !! Research !! Formalizations !! Reviews and verifications !! Critiques and corrections !! Catalogue, citations and exposition !! Latest entry | ! Result !! Area !! Follow-ups !! Research !! Formalizations !! Reviews and verifications !! Critiques and corrections !! Catalogue, citations and exposition !! Latest entry | ||
|- | |- | ||
| [[The quasi-Riemann hypothesis]] || Number theory || | | [[The quasi-Riemann hypothesis]] || Number theory || 83 || 58 || 5 || 9 || 0 || 11 || 2026-11-03 | ||
|- | |- | ||
| [[The Exponential Time Hypothesis]] || Computational complexity || | | [[The Exponential Time Hypothesis]] || Computational complexity || 49 || 18 || 0 || 17 || 0 || 14 || 2026-11-03 | ||
|- | |- | ||
| [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || | | [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 34 || 18 || 0 || 7 || 0 || 9 || 2026-11-03 | ||
|- | |- | ||
| [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 27 || 15 || 0 || 2 || 0 || 10 || 2026-10-27 | | [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 27 || 15 || 0 || 2 || 0 || 10 || 2026-10-27 | ||
| Line 29: | Line 29: | ||
|- | |- | ||
| [[The irrationality exponent of π is 2]] || Number theory || 19 || 12 || 0 || 2 || 0 || 5 || 2026-10-23 | | [[The irrationality exponent of π is 2]] || Number theory || 19 || 12 || 0 || 2 || 0 || 5 || 2026-10-23 | ||
|- | |||
| [[Exact Fourier transforms below n log n]] || Algorithms || 18 || 10 || 0 || 4 || 0 || 4 || 2026-11-03 | |||
|- | |- | ||
| [[Primitive roots for every admissible integer base]] || Number theory || 18 || 10 || 1 || 2 || 0 || 5 || 2026-10-31 | | [[Primitive roots for every admissible integer base]] || Number theory || 18 || 10 || 1 || 2 || 0 || 5 || 2026-10-31 | ||
| Line 34: | Line 36: | ||
| [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 18 || 8 || 0 || 3 || 0 || 7 || 2026-10-29 | | [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 18 || 8 || 0 || 3 || 0 || 7 || 2026-10-29 | ||
|- | |- | ||
| [[ | | [[The Snaky achievement game]] || Combinatorics || 17 || 6 || 1 || 6 || 0 || 4 || 2026-11-02 | ||
|- | |- | ||
| [[The rational Hodge conjecture for CM abelian varieties]] || Algebraic geometry || 17 || 6 || 0 || 3 || 5 || 3 || 2026-11-01 | | [[The rational Hodge conjecture for CM abelian varieties]] || Algebraic geometry || 17 || 6 || 0 || 3 || 5 || 3 || 2026-11-01 | ||
| Line 44: | Line 46: | ||
| [[The Erdős unit distance and pinned distance problems]] || Discrete geometry || 17 || 2 || 0 || 6 || 0 || 9 || 2026-10-18 | | [[The Erdős unit distance and pinned distance problems]] || Discrete geometry || 17 || 2 || 0 || 6 || 0 || 9 || 2026-10-18 | ||
|- | |- | ||
| [[ | | [[Hadwiger's conjecture]] || Combinatorics || 16 || 5 || 1 || 2 || 0 || 8 || 2026-10-18 | ||
|- | |- | ||
| [[ | | [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 15 || 3 || 0 || 3 || 0 || 9 || 2026-11-03 | ||
|- | |- | ||
| [[Irrationality of Catalan's constant]] || Number theory || 15 || 7 || 0 || 3 || 0 || 5 || 2026-10-29 | | [[Irrationality of Catalan's constant]] || Number theory || 15 || 7 || 0 || 3 || 0 || 5 || 2026-10-29 | ||
| Line 53: | Line 55: | ||
|- | |- | ||
| [[Derandomization of logarithmic space]] || Computational complexity || 15 || 1 || 0 || 4 || 1 || 9 || 2026-10-20 | | [[Derandomization of logarithmic space]] || Computational complexity || 15 || 1 || 0 || 4 || 1 || 9 || 2026-10-20 | ||
|- | |||
| [[The Erdős similarity conjecture]] || Real analysis || 14 || 5 || 0 || 3 || 0 || 6 || 2026-11-03 | |||
|- | |- | ||
| [[Sharp Hölder stability of Brenier maps]] || Partial differential equations || 14 || 6 || 0 || 4 || 1 || 3 || 2026-10-30 | | [[Sharp Hölder stability of Brenier maps]] || Partial differential equations || 14 || 6 || 0 || 4 || 1 || 3 || 2026-10-30 | ||
|- | |- | ||
| [[ | | [[Mutually unbiased bases in dimension six]] || Quantum information || 14 || 5 || 0 || 4 || 1 || 4 || 2026-10-29 | ||
|- | |||
| [[Kaplansky's direct-finiteness conjecture]] || Group theory || 14 || 5 || 0 || 3 || 0 || 6 || 2026-10-27 | |||
|- | |- | ||
| [[Rapid mixing of the switch chain for every degree sequence]] || Algorithms || 14 || 5 || 0 || 5 || 0 || 4 || 2026-10-19 | | [[Rapid mixing of the switch chain for every degree sequence]] || Algorithms || 14 || 5 || 0 || 5 || 0 || 4 || 2026-10-19 | ||
|- | |- | ||
| [[The Ajtai–Erdős–Komlós–Szemerédi independence conjecture]] || Combinatorics || 13 || 3 || 0 || 5 || 0 || 5 || 2026-11-02 | | [[The Ajtai–Erdős–Komlós–Szemerédi independence conjecture]] || Combinatorics || 13 || 3 || 0 || 5 || 0 || 5 || 2026-11-02 | ||
|- | |- | ||
| [[Borsuk's conjecture]] || Discrete geometry || 13 || 3 || 0 || 2 || 0 || 8 || 2026-10-29 | | [[Borsuk's conjecture]] || Discrete geometry || 13 || 3 || 0 || 2 || 0 || 8 || 2026-10-29 | ||
|- | |- | ||
| [[The two-point Chowla conjecture]] || Number theory || 13 || 4 || 0 || 4 || 0 || 5 || 2026-10-27 | | [[The two-point Chowla conjecture]] || Number theory || 13 || 4 || 0 || 4 || 0 || 5 || 2026-10-27 | ||
| Line 85: | Line 85: | ||
|- | |- | ||
| [[Erdős's conjecture on arithmetic progressions]] || Combinatorics || 13 || 1 || 0 || 5 || 0 || 7 || 2026-10-16 | | [[Erdős's conjecture on arithmetic progressions]] || Combinatorics || 13 || 1 || 0 || 5 || 0 || 7 || 2026-10-16 | ||
|- | |||
| [[Nagata's conjecture on plane curves]] || Algebraic geometry || 12 || 3 || 0 || 4 || 0 || 5 || 2026-11-03 | |||
|- | |||
| [[Pure-point spectrum of the two-dimensional Anderson model]] || Mathematical physics || 12 || 2 || 1 || 5 || 0 || 4 || 2026-11-03 | |||
|- | |- | ||
| [[The generalized Lax conjecture]] || Convex geometry || 12 || 1 || 0 || 5 || 0 || 6 || 2026-10-27 | | [[The generalized Lax conjecture]] || Convex geometry || 12 || 1 || 0 || 5 || 0 || 6 || 2026-10-27 | ||
| Line 95: | Line 99: | ||
|- | |- | ||
| [[A quadratic bound for Jacobsthal's function]] || Number theory || 12 || 3 || 0 || 3 || 0 || 6 || 2026-10-23 | | [[A quadratic bound for Jacobsthal's function]] || Number theory || 12 || 3 || 0 || 3 || 0 || 6 || 2026-10-23 | ||
|- | |||
| [[The Auslander–Reiten conjecture]] || Representation theory of algebras || 12 || 5 || 0 || 4 || 0 || 3 || 2026-10-23 | |||
|- | |- | ||
| [[Heilbronn's triangle problem]] || Discrete geometry || 12 || 2 || 0 || 5 || 0 || 5 || 2026-10-22 | | [[Heilbronn's triangle problem]] || Discrete geometry || 12 || 2 || 0 || 5 || 0 || 5 || 2026-10-22 | ||
| Line 103: | Line 109: | ||
|- | |- | ||
| [[The Birch and Swinnerton-Dyer formula in low Selmer corank]] || Number theory || 12 || 6 || 0 || 2 || 0 || 4 || 2026-10-22 | | [[The Birch and Swinnerton-Dyer formula in low Selmer corank]] || Number theory || 12 || 6 || 0 || 2 || 0 || 4 || 2026-10-22 | ||
|- | |||
| [[Sogge's local smoothing conjecture]] || Harmonic analysis || 11 || 2 || 0 || 3 || 0 || 6 || 2026-11-03 | |||
|- | |||
| [[The Deligne–Drinfeld conjecture]] || Algebra || 11 || 5 || 0 || 2 || 0 || 4 || 2026-11-03 | |||
|- | |||
| [[The spin-one Haldane gap]] || Mathematical physics || 11 || 6 || 0 || 2 || 0 || 3 || 2026-11-03 | |||
|- | |- | ||
| [[Glauber dynamics of the Sherrington–Kirkpatrick model]] || Probability || 11 || 3 || 0 || 4 || 0 || 4 || 2026-11-02 | | [[Glauber dynamics of the Sherrington–Kirkpatrick model]] || Probability || 11 || 3 || 0 || 4 || 0 || 4 || 2026-11-02 | ||
|- | |- | ||
| [[Cylinder coverings below the half-area bound]] || Discrete geometry || 11 || 4 || 0 || 4 || 0 || 3 || 2026-10-30 | | [[Cylinder coverings below the half-area bound]] || Discrete geometry || 11 || 4 || 0 || 4 || 0 || 3 || 2026-10-30 | ||
|- | |- | ||
| [[One-sample matroid prophet inequalities]] || Algorithms || 11 || 2 || 0 || 5 || 0 || 4 || 2026-10-29 | | [[One-sample matroid prophet inequalities]] || Algorithms || 11 || 2 || 0 || 5 || 0 || 4 || 2026-10-29 | ||
|- | |||
| [[The little finitistic dimension conjecture]] || Representation theory of algebras || 11 || 7 || 0 || 1 || 0 || 3 || 2026-10-28 | |||
|- | |- | ||
| [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 11 || 5 || 0 || 2 || 0 || 4 || 2026-10-28 | | [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 11 || 5 || 0 || 2 || 0 || 4 || 2026-10-28 | ||
| Line 116: | Line 128: | ||
| [[The Gotsman–Linial conjecture]] || Computational complexity || 11 || 4 || 0 || 3 || 0 || 4 || 2026-10-26 | | [[The Gotsman–Linial conjecture]] || Computational complexity || 11 || 4 || 0 || 3 || 0 || 4 || 2026-10-26 | ||
|- | |- | ||
| [[The | | [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 11 || 5 || 0 || 1 || 0 || 5 || 2026-10-26 | ||
|- | |- | ||
| [[Depth-three circuit lower bounds beyond the square-root exponent]] || Computational complexity || 11 || 3 || 0 || 3 || 0 || 5 || 2026-10-22 | | [[Depth-three circuit lower bounds beyond the square-root exponent]] || Computational complexity || 11 || 3 || 0 || 3 || 0 || 5 || 2026-10-22 | ||
| Line 127: | Line 139: | ||
|- | |- | ||
| [[Positive lower density of large prime gaps]] || Number theory || 11 || 1 || 0 || 4 || 0 || 6 || 2026-10-21 | | [[Positive lower density of large prime gaps]] || Number theory || 11 || 1 || 0 || 4 || 0 || 6 || 2026-10-21 | ||
|- | |- | ||
| [[Petty's projection-volume conjecture]] || Convex geometry || 11 || 3 || 0 || 4 || 0 || 4 || 2026-10-18 | | [[Petty's projection-volume conjecture]] || Convex geometry || 11 || 3 || 0 || 4 || 0 || 4 || 2026-10-18 | ||
| Line 138: | Line 148: | ||
| [[A factor-two approximation for shortest common superstring]] || Algorithms || 11 || 2 || 5 || 0 || 0 || 4 || 2026-10-17 | | [[A factor-two approximation for shortest common superstring]] || Algorithms || 11 || 2 || 5 || 0 || 0 || 4 || 2026-10-17 | ||
|- | |- | ||
| [[The | | [[A cubic lower bound for the permanent versus the determinant]] || Algebraic complexity || 10 || 4 || 0 || 3 || 0 || 3 || 2026-11-03 | ||
|- | |||
| [[Sensitivity versus block sensitivity]] || Computational complexity || 10 || 5 || 0 || 0 || 0 || 5 || 2026-11-03 | |||
|- | |||
| [[The Toms–Winter conjecture]] || Operator algebras || 10 || 3 || 0 || 4 || 0 || 3 || 2026-11-03 | |||
|- | |||
| [[The complete Crouzeix conjecture]] || Functional analysis || 10 || 2 || 0 || 3 || 0 || 5 || 2026-11-03 | |||
|- | |- | ||
| [[Hilbert's tenth problem over the rational numbers]] || Number theory || 10 || 3 || 1 || 2 || 0 || 4 || 2026-10-30 | | [[Hilbert's tenth problem over the rational numbers]] || Number theory || 10 || 3 || 1 || 2 || 0 || 4 || 2026-10-30 | ||
| Line 151: | Line 167: | ||
|- | |- | ||
| [[Polynomial removal for ordered binary matrices]] || Combinatorics || 10 || 4 || 0 || 2 || 0 || 4 || 2026-10-28 | | [[Polynomial removal for ordered binary matrices]] || Combinatorics || 10 || 4 || 0 || 2 || 0 || 4 || 2026-10-28 | ||
|- | |- | ||
| [[Squarefree values of quartics and power-free values of polynomials]] || Number theory || 10 || 1 || 0 || 5 || 0 || 4 || 2026-10-27 | | [[Squarefree values of quartics and power-free values of polynomials]] || Number theory || 10 || 1 || 0 || 5 || 0 || 4 || 2026-10-27 | ||
| Line 159: | Line 173: | ||
|- | |- | ||
| [[The combinatorial invariance conjecture for Kazhdan–Lusztig polynomials]] || Algebra || 10 || 2 || 0 || 4 || 0 || 4 || 2026-10-27 | | [[The combinatorial invariance conjecture for Kazhdan–Lusztig polynomials]] || Algebra || 10 || 2 || 0 || 4 || 0 || 4 || 2026-10-27 | ||
|- | |- | ||
| [[The Gaussian propeller conjecture]] || Probability || 10 || 3 || 0 || 2 || 0 || 5 || 2026-10-26 | | [[The Gaussian propeller conjecture]] || Probability || 10 || 3 || 0 || 2 || 0 || 5 || 2026-10-26 | ||
|- | |- | ||
| [[Donaldson's tamed-to-compatible conjecture]] || Differential geometry || 10 || 0 || 0 || 7 || 0 || 3 || 2026-10-24 | | [[Donaldson's tamed-to-compatible conjecture]] || Differential geometry || 10 || 0 || 0 || 7 || 0 || 3 || 2026-10-24 | ||
| Line 193: | Line 203: | ||
|- | |- | ||
| [[The Bass trace conjecture]] || Group theory || 10 || 4 || 0 || 4 || 0 || 2 || 2026-10-17 | | [[The Bass trace conjecture]] || Group theory || 10 || 4 || 0 || 4 || 0 || 2 || 2026-10-17 | ||
|- | |||
| [[The Cartan–Hadamard isoperimetric conjecture]] || Differential geometry || 9 || 2 || 0 || 4 || 0 || 3 || 2026-11-03 | |||
|- | |- | ||
| [[Bose–Einstein condensation in the dilute Bose gas]] || Mathematical physics || 9 || 2 || 0 || 4 || 0 || 3 || 2026-11-01 | | [[Bose–Einstein condensation in the dilute Bose gas]] || Mathematical physics || 9 || 2 || 0 || 4 || 0 || 3 || 2026-11-01 | ||
| Line 199: | Line 211: | ||
|- | |- | ||
| [[The hypercube Ramsey number has linear order]] || Combinatorics || 9 || 0 || 1 || 3 || 0 || 5 || 2026-10-30 | | [[The hypercube Ramsey number has linear order]] || Combinatorics || 9 || 0 || 1 || 3 || 0 || 5 || 2026-10-30 | ||
|- | |- | ||
| [[Scheduling unit jobs with precedence constraints on three machines]] || Algorithms || 9 || 0 || 0 || 4 || 1 || 4 || 2026-10-27 | | [[Scheduling unit jobs with precedence constraints on three machines]] || Algorithms || 9 || 0 || 0 || 4 || 1 || 4 || 2026-10-27 | ||
| Line 206: | Line 216: | ||
| [[The Erdős–Gallai cycle-decomposition conjecture]] || Combinatorics || 9 || 2 || 0 || 2 || 0 || 5 || 2026-10-20 | | [[The Erdős–Gallai cycle-decomposition conjecture]] || Combinatorics || 9 || 2 || 0 || 2 || 0 || 5 || 2026-10-20 | ||
|- | |- | ||
| [[ | | [[The affine Bernstein problem]] || Differential geometry || 9 || 1 || 0 || 4 || 0 || 4 || 2026-10-19 | ||
|- | |- | ||
| [[The | | [[The anisotropic Calderón problem]] || Partial differential equations || 9 || 1 || 0 || 4 || 0 || 4 || 2026-10-19 | ||
|- | |- | ||
| [[Bounded-degree coboundary expanders]] || Combinatorics || 9 || 0 || 0 || 4 || 0 || 5 || 2026-10-18 | | [[Bounded-degree coboundary expanders]] || Combinatorics || 9 || 0 || 0 || 4 || 0 || 5 || 2026-10-18 | ||
| Line 225: | Line 235: | ||
|- | |- | ||
| [[The Friedgut–Kalai sharp-threshold conjecture]] || Probability || 9 || 0 || 0 || 4 || 0 || 5 || 2026-10-18 | | [[The Friedgut–Kalai sharp-threshold conjecture]] || Probability || 9 || 0 || 0 || 4 || 0 || 5 || 2026-10-18 | ||
|- | |- | ||
| [[The Zariski cancellation problem over the complex numbers]] || Algebraic geometry || 9 || 2 || 0 || 4 || 0 || 3 || 2026-10-18 | | [[The Zariski cancellation problem over the complex numbers]] || Algebraic geometry || 9 || 2 || 0 || 4 || 0 || 3 || 2026-10-18 | ||
|- | |- | ||
| [[The hyperinvariant subspace problem]] || Functional analysis || 9 || 0 || 0 || 4 || 0 || 5 || 2026-10-18 | | [[The hyperinvariant subspace problem]] || Functional analysis || 9 || 0 || 0 || 4 || 0 || 5 || 2026-10-18 | ||
| Line 247: | Line 253: | ||
|- | |- | ||
| [[The optimal order of convex-body covering density]] || Convex geometry || 9 || 1 || 0 || 4 || 0 || 4 || 2026-10-16 | | [[The optimal order of convex-body covering density]] || Convex geometry || 9 || 1 || 0 || 4 || 0 || 4 || 2026-10-16 | ||
|- | |||
| [[Absolutely continuous spectrum of the Anderson model in dimension at least three]] || Mathematical physics || 8 || 1 || 1 || 1 || 0 || 5 || 2026-11-03 | |||
|- | |||
| [[Global classical solutions of the relativistic Vlasov–Maxwell system]] || Partial differential equations || 8 || 1 || 0 || 2 || 0 || 5 || 2026-11-03 | |||
|- | |||
| [[The unitary synthesis problem]] || Quantum information || 8 || 4 || 0 || 1 || 0 || 3 || 2026-11-03 | |||
|- | |- | ||
| [[Zariski's multiplicity conjecture]] || Algebraic geometry || 8 || 1 || 0 || 5 || 0 || 2 || 2026-11-02 | | [[Zariski's multiplicity conjecture]] || Algebraic geometry || 8 || 1 || 0 || 5 || 0 || 2 || 2026-11-02 | ||
|- | |- | ||
| [[ | | [[The trilinear Hilbert transform]] || Harmonic analysis || 8 || 1 || 0 || 3 || 0 || 4 || 2026-11-01 | ||
|- | |- | ||
| [[Classical capacity of generalized amplitude damping]] || Quantum information || 8 || 3 || 0 || 1 || 0 || 4 || 2026-10-29 | | [[Classical capacity of generalized amplitude damping]] || Quantum information || 8 || 3 || 0 || 1 || 0 || 4 || 2026-10-29 | ||
| Line 259: | Line 271: | ||
|- | |- | ||
| [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 8 || 2 || 0 || 2 || 0 || 4 || 2026-10-27 | | [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 8 || 2 || 0 || 2 || 0 || 4 || 2026-10-27 | ||
|- | |- | ||
| [[Deterministic polynomial factorization over prime fields]] || Algorithms || 8 || 3 || 0 || 1 || 0 || 4 || 2026-10-26 | | [[Deterministic polynomial factorization over prime fields]] || Algorithms || 8 || 3 || 0 || 1 || 0 || 4 || 2026-10-26 | ||
| Line 279: | Line 289: | ||
|- | |- | ||
| [[The Kirchberg–Rørdam character criterion for Jiang–Su stability]] || Operator algebras || 8 || 1 || 0 || 4 || 0 || 3 || 2026-10-20 | | [[The Kirchberg–Rørdam character criterion for Jiang–Su stability]] || Operator algebras || 8 || 1 || 0 || 4 || 0 || 3 || 2026-10-20 | ||
|- | |||
| [[Yau's nodal conjecture for smooth metrics]] || Differential geometry || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-20 | |||
|- | |- | ||
| [[Elementary positivity of chromatic quasisymmetric functions]] || Combinatorics || 8 || 1 || 0 || 5 || 0 || 2 || 2026-10-19 | | [[Elementary positivity of chromatic quasisymmetric functions]] || Combinatorics || 8 || 1 || 0 || 5 || 0 || 2 || 2026-10-19 | ||
| Line 287: | Line 299: | ||
|- | |- | ||
| [[The Laughlin spectral gap]] || Mathematical physics || 8 || 5 || 0 || 1 || 0 || 2 || 2026-10-19 | | [[The Laughlin spectral gap]] || Mathematical physics || 8 || 5 || 0 || 1 || 0 || 2 || 2026-10-19 | ||
|- | |- | ||
| [[Exponential semidefinite complexity of perfect matching]] || Computational complexity || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-18 | | [[Exponential semidefinite complexity of perfect matching]] || Computational complexity || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-18 | ||
| Line 323: | Line 333: | ||
|- | |- | ||
| [[The GNRS conjecture for planar and bounded-treewidth graphs]] || Functional analysis || 8 || 1 || 1 || 3 || 0 || 3 || 2026-10-15 | | [[The GNRS conjecture for planar and bounded-treewidth graphs]] || Functional analysis || 8 || 1 || 1 || 3 || 0 || 3 || 2026-10-15 | ||
|- | |||
| [[De Giorgi's conjecture]] || Partial differential equations || 7 || 2 || 0 || 2 || 0 || 3 || 2026-11-03 | |||
|- | |||
| [[Serre's positivity conjecture for intersection multiplicities]] || Algebra || 7 || 1 || 1 || 1 || 0 || 4 || 2026-11-03 | |||
|- | |||
| [[The Courtade–Kumar conjecture]] || Information theory || 7 || 2 || 0 || 1 || 0 || 4 || 2026-11-03 | |||
|- | |||
| [[The log abundance conjecture in characteristic zero]] || Algebraic geometry || 7 || 2 || 0 || 1 || 0 || 4 || 2026-11-03 | |||
|- | |- | ||
| [[The area law for gapped ground states in two dimensions]] || Mathematical physics || 7 || 1 || 2 || 1 || 0 || 3 || 2026-11-01 | | [[The area law for gapped ground states in two dimensions]] || Mathematical physics || 7 || 1 || 2 || 1 || 0 || 3 || 2026-11-01 | ||
| Line 331: | Line 349: | ||
|- | |- | ||
| [[Memory–sample lower bounds for noiseless Gaussian regression]] || Information theory || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-29 | | [[Memory–sample lower bounds for noiseless Gaussian regression]] || Information theory || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-29 | ||
|- | |- | ||
| [[The Barendregt–Geuvers–Klop conjecture]] || Mathematical logic || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-27 | | [[The Barendregt–Geuvers–Klop conjecture]] || Mathematical logic || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-27 | ||
| Line 353: | Line 369: | ||
|- | |- | ||
| [[Goldfeld's conjecture for quadratic twists]] || Number theory || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-22 | | [[Goldfeld's conjecture for quadratic twists]] || Number theory || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-22 | ||
|- | |- | ||
| [[Equality of microstates and nonmicrostates free entropy]] || Operator algebras || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-21 | | [[Equality of microstates and nonmicrostates free entropy]] || Operator algebras || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-21 | ||
| Line 361: | Line 375: | ||
|- | |- | ||
| [[The p-adic section conjecture]] || Number theory || 7 || 1 || 0 || 1 || 0 || 5 || 2026-10-20 | | [[The p-adic section conjecture]] || Number theory || 7 || 1 || 0 || 1 || 0 || 5 || 2026-10-20 | ||
|- | |- | ||
| [[Strong forms of the Arnold conjecture]] || Differential geometry || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-19 | | [[Strong forms of the Arnold conjecture]] || Differential geometry || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-19 | ||
| Line 415: | Line 425: | ||
|- | |- | ||
| [[Seymour's second-neighborhood conjecture]] || Combinatorics || 7 || 1 || 0 || 2 || 0 || 4 || 2026-10-16 | | [[Seymour's second-neighborhood conjecture]] || Combinatorics || 7 || 1 || 0 || 2 || 0 || 4 || 2026-10-16 | ||
|- | |||
| [[Query complexity of log-concave sampling]] || Algorithms || 6 || 1 || 0 || 2 || 0 || 3 || 2026-11-03 | |||
|- | |||
| [[Strong locality of unitary vertex operator algebras]] || Operator algebras || 6 || 1 || 0 || 4 || 0 || 1 || 2026-11-03 | |||
|- | |||
| [[The LeBrun–Salamon conjecture]] || Differential geometry || 6 || 2 || 0 || 1 || 0 || 3 || 2026-11-03 | |||
|- | |||
| [[The inhomogeneous Duffin–Schaeffer conjecture]] || Number theory || 6 || 2 || 0 || 1 || 0 || 3 || 2026-11-03 | |||
|- | |- | ||
| [[Bounded gaps between primes]] || Number theory || 6 || 3 || 0 || 0 || 0 || 3 || 2026-11-02 | | [[Bounded gaps between primes]] || Number theory || 6 || 3 || 0 || 0 || 0 || 3 || 2026-11-02 | ||
| Line 423: | Line 441: | ||
|- | |- | ||
| [[Symplectic ball packing in higher dimensions]] || Differential geometry || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-29 | | [[Symplectic ball packing in higher dimensions]] || Differential geometry || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-29 | ||
|- | |- | ||
| [[Conformal invariance of square-lattice random-cluster interfaces]] || Probability || 6 || 2 || 0 || 0 || 1 || 3 || 2026-10-26 | | [[Conformal invariance of square-lattice random-cluster interfaces]] || Probability || 6 || 2 || 0 || 0 || 1 || 3 || 2026-10-26 | ||
| Line 439: | Line 455: | ||
|- | |- | ||
| [[The computational complexity of Weisfeiler–Leman refinement]] || Computational complexity || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-22 | | [[The computational complexity of Weisfeiler–Leman refinement]] || Computational complexity || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-22 | ||
|- | |- | ||
| [[Gigli's characterization of Alexandrov curvature]] || Differential geometry || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-19 | | [[Gigli's characterization of Alexandrov curvature]] || Differential geometry || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-19 | ||
| Line 457: | Line 471: | ||
|- | |- | ||
| [[Spontaneous magnetization and Bloch's law for the quantum Heisenberg ferromagnet]] || Mathematical physics || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-18 | | [[Spontaneous magnetization and Bloch's law for the quantum Heisenberg ferromagnet]] || Mathematical physics || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[The Euclidean Steinitz–Bergström conjecture]] || Discrete geometry || 6 || 1 || 0 || 1 || 0 || 4 || 2026-10-18 | | [[The Euclidean Steinitz–Bergström conjecture]] || Discrete geometry || 6 || 1 || 0 || 1 || 0 || 4 || 2026-10-18 | ||
| Line 479: | Line 491: | ||
|- | |- | ||
| [[Trace reconstruction from deletion channels]] || Computational complexity || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-18 | | [[Trace reconstruction from deletion channels]] || Computational complexity || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-18 | ||
|- | |- | ||
| [[Pressure of orthogonally invariant Ising spin glasses]] || Probability || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-17 | | [[Pressure of orthogonally invariant Ising spin glasses]] || Probability || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-17 | ||
| Line 491: | Line 501: | ||
|- | |- | ||
| [[Almost-linear-time maximum matching in general graphs]] || Algorithms || 6 || 2 || 0 || 1 || 0 || 3 || 2026-10-16 | | [[Almost-linear-time maximum matching in general graphs]] || Algorithms || 6 || 2 || 0 || 1 || 0 || 3 || 2026-10-16 | ||
|- | |- | ||
| [[Embedding edit distance into L1]] || Functional analysis || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-14 | | [[Embedding edit distance into L1]] || Functional analysis || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-14 | ||
| Line 505: | Line 513: | ||
|- | |- | ||
| [[The duality conjecture for metric entropy]] || Convex geometry || 5 || 0 || 0 || 1 || 0 || 4 || 2026-10-29 | | [[The duality conjecture for metric entropy]] || Convex geometry || 5 || 0 || 0 || 1 || 0 || 4 || 2026-10-29 | ||
|- | |- | ||
| [[Kobayashi's canonical-ampleness conjecture]] || Complex analysis || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-27 | | [[Kobayashi's canonical-ampleness conjecture]] || Complex analysis || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-27 | ||
| Line 557: | Line 563: | ||
|- | |- | ||
| [[Quasi-isometric recognition of virtually polycyclic groups]] || Group theory || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[Quasi-isometric recognition of virtually polycyclic groups]] || Group theory || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[Shub's entropy conjecture]] || Dynamical systems || 5 || 1 || 0 || 0 || 0 || 4 || 2026-10-18 | | [[Shub's entropy conjecture]] || Dynamical systems || 5 || 1 || 0 || 0 || 0 || 4 || 2026-10-18 | ||
|- | |- | ||
| [[The Bochner–Riesz conjecture in three dimensions]] || Harmonic analysis || 5 || 0 || 0 || 1 || 0 || 4 || 2026-10-18 | | [[The Bochner–Riesz conjecture in three dimensions]] || Harmonic analysis || 5 || 0 || 0 || 1 || 0 || 4 || 2026-10-18 | ||
| Line 603: | Line 605: | ||
|- | |- | ||
| [[Approximating edit distance in almost-linear time]] || Algorithms || 5 || 2 || 0 || 0 || 0 || 3 || 2026-10-16 | | [[Approximating edit distance in almost-linear time]] || Algorithms || 5 || 2 || 0 || 0 || 0 || 3 || 2026-10-16 | ||
|- | |- | ||
| [[The Lipschitz isomorphism problem for separable Banach spaces]] || Functional analysis || 4 || 1 || 0 || 0 || 0 || 3 || 2026-10-28 | | [[The Lipschitz isomorphism problem for separable Banach spaces]] || Functional analysis || 4 || 1 || 0 || 0 || 0 || 3 || 2026-10-28 | ||
| Line 613: | Line 613: | ||
|- | |- | ||
| [[Hochster's small Cohen–Macaulay module conjecture]] || Algebra || 4 || 0 || 0 || 0 || 0 || 4 || 2026-10-21 | | [[Hochster's small Cohen–Macaulay module conjecture]] || Algebra || 4 || 0 || 0 || 0 || 0 || 4 || 2026-10-21 | ||
|- | |||
| [[The Kadison–Kastler conjecture]] || Operator algebras || 4 || 0 || 0 || 0 || 0 || 4 || 2026-10-20 | |||
|- | |- | ||
| [[Katok's entropy rigidity conjecture]] || Dynamical systems || 4 || 0 || 0 || 1 || 1 || 2 || 2026-10-19 | | [[Katok's entropy rigidity conjecture]] || Dynamical systems || 4 || 0 || 0 || 1 || 1 || 2 || 2026-10-19 | ||
| Line 629: | Line 631: | ||
|- | |- | ||
| [[Geometric Langlands and the generalized Ramanujan conjecture over function fields]] || Number theory || 4 || 0 || 0 || 1 || 0 || 3 || 2026-10-18 | | [[Geometric Langlands and the generalized Ramanujan conjecture over function fields]] || Number theory || 4 || 0 || 0 || 1 || 0 || 3 || 2026-10-18 | ||
|- | |||
| [[Kadison's similarity problem]] || Operator algebras || 4 || 0 || 0 || 0 || 0 || 4 || 2026-10-18 | |||
|- | |- | ||
| [[Pixton's conjecture on tautological relations]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[Pixton's conjecture on tautological relations]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
| Line 637: | Line 641: | ||
|- | |- | ||
| [[Smith–Toda complexes at every height]] || Homotopy theory || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[Smith–Toda complexes at every height]] || Homotopy theory || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[The Eisenbud–Green–Harris and lex-plus-powers conjectures]] || Algebra || 4 || 0 || 0 || 2 || 0 || 2 || 2026-10-18 | |||
|- | |- | ||
| [[The Hahn–Wilson conjecture]] || Homotopy theory || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[The Hahn–Wilson conjecture]] || Homotopy theory || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
| Line 665: | Line 671: | ||
|- | |- | ||
| [[Termination of flips for fourfolds]] || Algebraic geometry || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-26 | | [[Termination of flips for fourfolds]] || Algebraic geometry || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-26 | ||
|- | |- | ||
| [[Bi-Lipschitz charts at regular points of RCD spaces]] || Differential geometry || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-19 | | [[Bi-Lipschitz charts at regular points of RCD spaces]] || Differential geometry || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-19 | ||
| Line 703: | Line 707: | ||
|- | |- | ||
| [[Griffiths' positivity conjecture]] || Algebraic geometry || 3 || 0 || 0 || 0 || 0 || 3 || 2026-10-18 | | [[Griffiths' positivity conjecture]] || Algebraic geometry || 3 || 0 || 0 || 0 || 0 || 3 || 2026-10-18 | ||
|- | |- | ||
| [[Kirchberg's embedding problem]] || Operator algebras || 3 || 0 || 0 || 0 || 0 || 3 || 2026-10-18 | | [[Kirchberg's embedding problem]] || Operator algebras || 3 || 0 || 0 || 0 || 0 || 3 || 2026-10-18 | ||
| Line 761: | Line 763: | ||
|- | |- | ||
| [[Alperin's weight conjecture]] || Representation theory of algebras || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | | [[Alperin's weight conjecture]] || Representation theory of algebras || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[Gaboriau's fixed price problem]] || Group theory || 2 || 0 || 0 || 1 || 0 || 1 || 2026-10-17 | | [[Gaboriau's fixed price problem]] || Group theory || 2 || 0 || 0 || 1 || 0 || 1 || 2026-10-17 | ||
Latest revision as of 13:27, 4 November 2026
This page lists every result page of this wiki with the number of public follow-up works recorded on it, from the most to the fewest. It is generated from the follow-up tables of the result pages as they stood on 5 November 2026. The table can be re-sorted by any column.
Summary
- 376 result pages; 376 of them list at least one public follow-up.
- 2947 follow-up entries in total:
- Research follow-ups: 670
- Formalizations: 35
- Reviews and verifications: 926
- Critiques and corrections: 21
- Catalogue entries, citations and exposition: 1295
Results
How the counts are made
- Each row of a result page's follow-up table counts as one entry. A work that concerns several results appears on each of their pages and is counted once on each.
- Collection-wide efforts, such as the formal-statement review MathVet and the audit of the manuscripts without Lean, are counted on every page that lists them. They raise many counts by one or two.
- Rows that a page marks as earlier work, or as work cited by the original manuscript, are listed there for context and are not counted (24 rows at present).
- Entries are grouped by the relation stated in the table: extensions, uses and parallel work as research follow-ups; formalizations and implementations; reviews, verifications and replications; critiques and corrections; and catalogue entries, formal statements, citations, remarks and exposition.
- The counts describe what this wiki has recorded from public sources. They are not a measure of the importance or the correctness of a result, and a low count may only mean that follow-ups have not been found yet.
