Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (376 pages, 2958 entries) |
Automatic refresh from the published result pages (376 pages, 2975 entries) |
||
| (12 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 7 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. | ||
* | * 2975 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 664 | ||
** Formalizations: | ** Formalizations: 38 | ||
** Reviews and verifications: | ** Reviews and verifications: 932 | ||
** Critiques and corrections: 21 | ** Critiques and corrections: 21 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 1320 | ||
== 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 || 79 || 52 || 6 || 9 || 0 || 12 || 2026-11-05 | ||
|- | |- | ||
| [[The Exponential Time Hypothesis]] || Computational complexity || | | [[The Exponential Time Hypothesis]] || Computational complexity || 48 || 17 || 0 || 17 || 0 || 14 || 2026-11-03 | ||
|- | |- | ||
| [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 34 || 18 || 0 || 7 || 0 || 9 || 2026-11-03 | | [[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 || | | [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 28 || 16 || 0 || 2 || 0 || 10 || 2026-11-05 | ||
|- | |||
| [[Integer multiplication below n log n]] || Algorithms || 22 || 12 || 0 || 2 || 0 || 8 || 2026-11-05 | |||
|- | |- | ||
| [[The Euclidean plane is not five-colorable]] || Discrete geometry || 22 || 10 || 0 || 2 || 1 || 9 || 2026-10-29 | | [[The Euclidean plane is not five-colorable]] || Discrete geometry || 22 || 10 || 0 || 2 || 1 || 9 || 2026-10-29 | ||
|- | |- | ||
| [[ | | [[The irrationality exponent of π is 2]] || Number theory || 20 || 12 || 0 || 3 || 0 || 5 || 2026-11-06 | ||
|- | |- | ||
| [[The | | [[The Unique Games Conjecture]] || Computational complexity || 20 || 7 || 1 || 3 || 0 || 9 || 2026-10-29 | ||
|- | |- | ||
| [[Exact Fourier transforms below n log n]] || Algorithms || 18 || 10 || 0 || 4 || 0 || 4 || 2026-11-03 | | [[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 | ||
|- | |- | ||
| [[The Snaky achievement game]] || Combinatorics || 17 || 6 || 1 || 6 || 0 || 4 || 2026-11-02 | | [[The Snaky achievement game]] || Combinatorics || 17 || 6 || 1 || 6 || 0 || 4 || 2026-11-02 | ||
| Line 40: | Line 38: | ||
| [[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 | ||
|- | |- | ||
| [[ | | [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 17 || 7 || 0 || 3 || 0 || 7 || 2026-10-29 | ||
|- | |- | ||
| [[The Mahler conjectures]] || Convex geometry || 17 || 4 || 0 || 4 || 0 || 9 || 2026-10-28 | | [[The Mahler conjectures]] || Convex geometry || 17 || 4 || 0 || 4 || 0 || 9 || 2026-10-28 | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Prime-factor statistics of p − 1]] || Number theory || 16 || 6 || 2 || 3 || 0 || 5 || 2026-10-30 | |||
|- | |- | ||
| [[Hadwiger's conjecture]] || Combinatorics || 16 || 5 || 1 || 2 || 0 || 8 || 2026-10-18 | | [[Hadwiger's conjecture]] || Combinatorics || 16 || 5 || 1 || 2 || 0 || 8 || 2026-10-18 | ||
|- | |||
| [[Mutually unbiased bases in dimension six]] || Quantum information || 15 || 6 || 0 || 4 || 1 || 4 || 2026-11-05 | |||
|- | |||
| [[Sharp Hölder stability of Brenier maps]] || Partial differential equations || 15 || 7 || 0 || 4 || 1 || 3 || 2026-11-05 | |||
|- | |- | ||
| [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 15 || 3 || 0 || 3 || 0 || 9 || 2026-11-03 | | [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 15 || 3 || 0 || 3 || 0 || 9 || 2026-11-03 | ||
| Line 58: | Line 62: | ||
| [[The Erdős similarity conjecture]] || Real analysis || 14 || 5 || 0 || 3 || 0 || 6 || 2026-11-03 | | [[The Erdős similarity conjecture]] || Real analysis || 14 || 5 || 0 || 3 || 0 || 6 || 2026-11-03 | ||
|- | |- | ||
| [[ | | [[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 | |||
|- | |- | ||
| [[ | | [[The spin-one Haldane gap]] || Mathematical physics || 13 || 7 || 0 || 2 || 0 || 4 || 2026-11-06 | ||
|- | |- | ||
| [[ | | [[The generalized Lax conjecture]] || Convex geometry || 13 || 2 || 0 || 5 || 0 || 6 || 2026-11-05 | ||
|- | |- | ||
| [[ | | [[Heilbronn's triangle problem]] || Discrete geometry || 13 || 3 || 0 || 5 || 0 || 5 || 2026-11-04 | ||
|- | |- | ||
| [[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 | ||
| Line 75: | Line 81: | ||
|- | |- | ||
| [[Universal optimality of the triangular lattice]] || Discrete geometry || 13 || 3 || 0 || 5 || 0 || 5 || 2026-10-26 | | [[Universal optimality of the triangular lattice]] || Discrete geometry || 13 || 3 || 0 || 5 || 0 || 5 || 2026-10-26 | ||
|- | |||
| [[Permanence of weakly reversible mass-action systems]] || Dynamical systems || 13 || 6 || 0 || 3 || 0 || 4 || 2026-10-22 | |||
|- | |- | ||
| [[The Lane–Emden conjecture]] || Partial differential equations || 13 || 7 || 0 || 3 || 0 || 3 || 2026-10-22 | | [[The Lane–Emden conjecture]] || Partial differential equations || 13 || 7 || 0 || 3 || 0 || 3 || 2026-10-22 | ||
| Line 81: | Line 89: | ||
|- | |- | ||
| [[The logarithmic exponent of off-diagonal Ramsey numbers]] || Combinatorics || 13 || 3 || 0 || 5 || 0 || 5 || 2026-10-20 | | [[The logarithmic exponent of off-diagonal Ramsey numbers]] || Combinatorics || 13 || 3 || 0 || 5 || 0 || 5 || 2026-10-20 | ||
|- | |- | ||
| [[Superexponential growth of van der Waerden numbers]] || Combinatorics || 13 || 1 || 0 || 4 || 0 || 8 || 2026-10-18 | | [[Superexponential growth of van der Waerden numbers]] || Combinatorics || 13 || 1 || 0 || 4 || 0 || 8 || 2026-10-18 | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Sogge's local smoothing conjecture]] || Harmonic analysis || 12 || 3 || 0 || 3 || 0 || 6 || 2026-11-06 | |||
|- | |||
| [[Universal computation in forced Navier–Stokes flows]] || Partial differential equations || 12 || 2 || 1 || 6 || 0 || 3 || 2026-11-05 | |||
|- | |- | ||
| [[Nagata's conjecture on plane curves]] || Algebraic geometry || 12 || 3 || 0 || 4 || 0 || 5 || 2026-11-03 | | [[Nagata's conjecture on plane curves]] || Algebraic geometry || 12 || 3 || 0 || 4 || 0 || 5 || 2026-11-03 | ||
| Line 92: | Line 102: | ||
| [[Pure-point spectrum of the two-dimensional Anderson model]] || Mathematical physics || 12 || 2 || 1 || 5 || 0 || 4 || 2026-11-03 | | [[Pure-point spectrum of the two-dimensional Anderson model]] || Mathematical physics || 12 || 2 || 1 || 5 || 0 || 4 || 2026-11-03 | ||
|- | |- | ||
| [[ | | [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 12 || 5 || 0 || 3 || 0 || 4 || 2026-10-31 | ||
|- | |- | ||
| [[The Benjamini–Schramm percolation conjectures]] || Probability || 12 || 1 || 0 || 3 || 0 || 8 || 2026-10-26 | | [[The Benjamini–Schramm percolation conjectures]] || Probability || 12 || 1 || 0 || 3 || 0 || 8 || 2026-10-26 | ||
| Line 99: | Line 109: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[Largest prime factors of consecutive integers]] || Number theory || 12 || 2 || 0 || 5 || 0 || 5 || 2026-10-22 | | [[Largest prime factors of consecutive integers]] || Number theory || 12 || 2 || 0 || 5 || 0 || 5 || 2026-10-22 | ||
|- | |- | ||
| [[ | | [[The Birch and Swinnerton-Dyer formula in low Selmer corank]] || Number theory || 12 || 6 || 0 || 2 || 0 || 4 || 2026-10-22 | ||
|- | |- | ||
| [[ | | [[Thompson's group F is nonamenable]] || Group theory || 12 || 5 || 0 || 1 || 0 || 6 || 2026-10-20 | ||
|- | |- | ||
| [[ | | [[The circulant Hadamard conjecture]] || Combinatorics || 11 || 1 || 0 || 3 || 0 || 7 || 2026-11-05 | ||
|- | |- | ||
| [[The Deligne–Drinfeld conjecture]] || Algebra || 11 || 5 || 0 || 2 || 0 || 4 || 2026-11-03 | | [[The Deligne–Drinfeld conjecture]] || Algebra || 11 || 5 || 0 || 2 || 0 || 4 || 2026-11-03 | ||
|- | |- | ||
| [[ | | [[Glauber dynamics of the Sherrington–Kirkpatrick model]] || Probability || 11 || 3 || 0 || 4 || 0 || 4 || 2026-11-02 | ||
|- | |- | ||
| [[ | | [[The Baum–Connes and Kadison–Kaplansky conjectures]] || Operator algebras || 11 || 1 || 0 || 4 || 0 || 6 || 2026-10-31 | ||
|- | |- | ||
| [[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 | ||
| Line 123: | Line 129: | ||
|- | |- | ||
| [[The little finitistic dimension conjecture]] || Representation theory of algebras || 11 || 7 || 0 || 1 || 0 || 3 || 2026-10-28 | | [[The little finitistic dimension conjecture]] || Representation theory of algebras || 11 || 7 || 0 || 1 || 0 || 3 || 2026-10-28 | ||
|- | |- | ||
| [[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 Auslander–Reiten conjecture]] || Representation theory of algebras || 11 || 4 || 0 || 4 || 0 || 3 || 2026-10-23 | ||
|- | |- | ||
| [[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 147: | Line 151: | ||
|- | |- | ||
| [[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 anisotropic Calderón problem]] || Partial differential equations || 10 || 2 || 0 || 4 || 0 || 4 || 2026-11-06 | |||
|- | |- | ||
| [[A cubic lower bound for the permanent versus the determinant]] || Algebraic complexity || 10 || 4 || 0 || 3 || 0 || 3 || 2026-11-03 | | [[A cubic lower bound for the permanent versus the determinant]] || Algebraic complexity || 10 || 4 || 0 || 3 || 0 || 3 || 2026-11-03 | ||
| Line 164: | Line 170: | ||
| [[The strong isotropic constant conjecture]] || Convex geometry || 10 || 3 || 0 || 3 || 0 || 4 || 2026-10-30 | | [[The strong isotropic constant conjecture]] || Convex geometry || 10 || 3 || 0 || 3 || 0 || 4 || 2026-10-30 | ||
|- | |- | ||
| [[ | | [[Polynomial removal for ordered binary matrices]] || Combinatorics || 10 || 4 || 0 || 2 || 0 || 4 || 2026-10-28 | ||
|- | |- | ||
| [[ | | [[Scheduling unit jobs with precedence constraints on three machines]] || Algorithms || 10 || 0 || 0 || 4 || 1 || 5 || 2026-10-27 | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 10 || 4 || 0 || 1 || 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 181: | Line 187: | ||
|- | |- | ||
| [[Barnette's conjecture]] || Combinatorics || 10 || 1 || 0 || 2 || 0 || 7 || 2026-10-21 | | [[Barnette's conjecture]] || Combinatorics || 10 || 1 || 0 || 2 || 0 || 7 || 2026-10-21 | ||
|- | |- | ||
| [[The generator problem for von Neumann algebras]] || Operator algebras || 10 || 2 || 0 || 3 || 0 || 5 || 2026-10-21 | | [[The generator problem for von Neumann algebras]] || Operator algebras || 10 || 2 || 0 || 3 || 0 || 5 || 2026-10-21 | ||
| Line 207: | Line 211: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Wall's D(2) problem]] || Homotopy theory || 9 || 2 || 1 || 3 || 0 || 3 || 2026-10-31 | |||
|- | |- | ||
| [[Fujita's freeness conjecture]] || Algebraic geometry || 9 || 4 || 0 || 2 || 0 || 3 || 2026-10-30 | | [[Fujita's freeness conjecture]] || Algebraic geometry || 9 || 4 || 0 || 2 || 0 || 3 || 2026-10-30 | ||
| Line 212: | Line 218: | ||
| [[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 | ||
|- | |- | ||
| [[ | | [[Classical capacity of generalized amplitude damping]] || Quantum information || 9 || 3 || 0 || 1 || 0 || 5 || 2026-10-29 | ||
|- | |- | ||
| [[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 affine Bernstein problem]] || Differential geometry || 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 247: | Line 251: | ||
|- | |- | ||
| [[The stable coordinate and Abhyankar–Sathaye conjectures]] || Algebraic geometry || 9 || 0 || 0 || 4 || 0 || 5 || 2026-10-18 | | [[The stable coordinate and Abhyankar–Sathaye conjectures]] || Algebraic geometry || 9 || 0 || 0 || 4 || 0 || 5 || 2026-10-18 | ||
|- | |||
| [[The strong thin-tree conjecture]] || Combinatorics || 9 || 1 || 0 || 4 || 0 || 4 || 2026-10-18 | |||
|- | |- | ||
| [[Bigeodesics in planar first-passage percolation]] || Probability || 9 || 0 || 0 || 4 || 0 || 5 || 2026-10-17 | | [[Bigeodesics in planar first-passage percolation]] || Probability || 9 || 0 || 0 || 4 || 0 || 5 || 2026-10-17 | ||
|- | |- | ||
| [[Saxl's conjecture and the tensor square conjecture]] || Combinatorics || 9 || 1 || 1 || 5 || 1 || 1 || 2026-10-17 | | [[Saxl's conjecture and the tensor square conjecture]] || Combinatorics || 9 || 1 || 1 || 5 || 1 || 1 || 2026-10-17 | ||
|- | |- | ||
| [[The finitely presented Burnside problem]] || Group theory || 9 || 2 || 0 || 4 || 0 || 3 || 2026-10-17 | | [[The finitely presented Burnside problem]] || Group theory || 9 || 2 || 0 || 4 || 0 || 3 || 2026-10-17 | ||
|- | |||
| [[The modified integer round-up conjecture for bin packing]] || Algorithms || 9 || 1 || 0 || 3 || 0 || 5 || 2026-10-16 | |||
|- | |- | ||
| [[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 | ||
| Line 262: | Line 268: | ||
| [[Global classical solutions of the relativistic Vlasov–Maxwell system]] || Partial differential equations || 8 || 1 || 0 || 2 || 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 | ||
|- | |- | ||
| [[ | | [[Zariski's multiplicity conjecture]] || Algebraic geometry || 8 || 1 || 0 || 5 || 0 || 2 || 2026-11-02 | ||
|- | |- | ||
| [[ | | [[The area law for gapped ground states in two dimensions]] || Mathematical physics || 8 || 1 || 2 || 1 || 0 || 4 || 2026-11-01 | ||
|- | |- | ||
| [[The trilinear Hilbert transform]] || Harmonic analysis || 8 || 1 || 0 || 3 || 0 || 4 || 2026-11-01 | | [[The trilinear Hilbert transform]] || Harmonic analysis || 8 || 1 || 0 || 3 || 0 || 4 || 2026-11-01 | ||
|- | |- | ||
| [[ | | [[Directional zero–one laws and ballisticity for random walks in random environment]] || Probability || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-29 | ||
|- | |- | ||
| [[The Mézard–Parisi formula for diluted spin glasses]] || Probability || 8 || 2 || 0 || 3 || 0 || 3 || 2026-10-29 | | [[The Mézard–Parisi formula for diluted spin glasses]] || Probability || 8 || 2 || 0 || 3 || 0 || 3 || 2026-10-29 | ||
| Line 283: | Line 289: | ||
|- | |- | ||
| [[Ostmann's inverse Goldbach conjecture]] || Number theory || 8 || 1 || 0 || 2 || 0 || 5 || 2026-10-23 | | [[Ostmann's inverse Goldbach conjecture]] || Number theory || 8 || 1 || 0 || 2 || 0 || 5 || 2026-10-23 | ||
|- | |- | ||
| [[The hyperkähler SYZ conjecture]] || Algebraic geometry || 8 || 3 || 0 || 2 || 0 || 3 || 2026-10-22 | | [[The hyperkähler SYZ conjecture]] || Algebraic geometry || 8 || 3 || 0 || 2 || 0 || 3 || 2026-10-22 | ||
| Line 303: | Line 307: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Entanglement without secret key and the PPT-squared conjecture]] || Quantum information || 8 || 0 || 0 || 5 || 0 || 3 || 2026-10-18 | |||
|- | |- | ||
| [[Ergodicity and weak mixing of irrational triangular billiards]] || Dynamical systems || 8 || 0 || 0 || 4 || 0 || 4 || 2026-10-18 | | [[Ergodicity and weak mixing of irrational triangular billiards]] || Dynamical systems || 8 || 0 || 0 || 4 || 0 || 4 || 2026-10-18 | ||
| Line 322: | Line 328: | ||
| [[The second Kahn–Kalai conjecture]] || Probability || 8 || 0 || 0 || 3 || 0 || 5 || 2026-10-18 | | [[The second Kahn–Kalai conjecture]] || Probability || 8 || 0 || 0 || 3 || 0 || 5 || 2026-10-18 | ||
|- | |- | ||
| [[ | | [[Foulkes' conjecture]] || Algebra || 8 || 0 || 0 || 6 || 0 || 2 || 2026-10-17 | ||
|- | |- | ||
| [[ | | [[Reconstruction thresholds for Potts broadcasting on trees]] || Probability || 8 || 1 || 0 || 5 || 0 || 2 || 2026-10-17 | ||
|- | |- | ||
| [[The Boone–Higman conjecture]] || Group theory || 8 || 2 || 0 || 4 || 0 || 2 || 2026-10-17 | | [[The Boone–Higman conjecture]] || Group theory || 8 || 2 || 0 || 4 || 0 || 2 || 2026-10-17 | ||
|- | |- | ||
| [[Kaplansky's zero-divisor conjecture]] || Group theory || 8 || 3 || 0 || 1 || 0 || 4 || 2026-10-16 | | [[Kaplansky's zero-divisor conjecture]] || Group theory || 8 || 3 || 0 || 1 || 0 || 4 || 2026-10-16 | ||
|- | |- | ||
| [[The randomized k-server problem on arbitrary metrics]] || Algorithms || 8 || 0 || 0 || 4 || 1 || 3 || 2026-10-16 | | [[The randomized k-server problem on arbitrary metrics]] || Algorithms || 8 || 0 || 0 || 4 || 1 || 3 || 2026-10-16 | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[The logarithmic Sobolev conjecture for subgaussian log-concave measures]] || Probability || 7 || 2 || 0 || 1 || 0 || 4 || 2026-11-05 | |||
|- | |- | ||
| [[De Giorgi's conjecture]] || Partial differential equations || 7 || 2 || 0 || 2 || 0 || 3 || 2026-11-03 | | [[De Giorgi's conjecture]] || Partial differential equations || 7 || 2 || 0 || 2 || 0 || 3 || 2026-11-03 | ||
| Line 344: | Line 350: | ||
| [[The log abundance conjecture in characteristic zero]] || Algebraic geometry || 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 | | [[The unitary synthesis problem]] || Quantum information || 7 || 3 || 0 || 1 || 0 || 3 || 2026-11-03 | ||
|- | |- | ||
| [[Fourier extension for positively curved surfaces in three dimensions]] || Harmonic analysis || 7 || 0 || 0 || 2 || 0 || 5 || 2026-10-30 | | [[Fourier extension for positively curved surfaces in three dimensions]] || Harmonic analysis || 7 || 0 || 0 || 2 || 0 || 5 || 2026-10-30 | ||
|- | |- | ||
| [[Iitaka's subadditivity conjecture]] || Algebraic geometry || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-29 | | [[Iitaka's subadditivity conjecture]] || Algebraic geometry || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-29 | ||
| Line 369: | Line 373: | ||
|- | |- | ||
| [[Tingley's problem]] || Functional analysis || 7 || 2 || 0 || 0 || 0 || 5 || 2026-10-23 | | [[Tingley's problem]] || Functional analysis || 7 || 2 || 0 || 0 || 0 || 5 || 2026-10-23 | ||
|- | |- | ||
| [[Generalized star height at most three]] || Computational complexity || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-22 | | [[Generalized star height at most three]] || Computational complexity || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-22 | ||
| Line 395: | Line 397: | ||
|- | |- | ||
| [[Black-box identity testing for noncommutative formulas]] || Algebraic complexity || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-18 | | [[Black-box identity testing for noncommutative formulas]] || Algebraic complexity || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[Exact quantum factoring]] || Algorithms || 7 || 0 || 0 || 3 || 0 || 4 || 2026-10-18 | | [[Exact quantum factoring]] || Algorithms || 7 || 0 || 0 || 3 || 0 || 4 || 2026-10-18 | ||
| Line 419: | Line 419: | ||
|- | |- | ||
| [[Threshold parallel repetition for entangled games]] || Quantum information || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-18 | | [[Threshold parallel repetition for entangled games]] || Quantum information || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-18 | ||
|- | |||
| [[Trace reconstruction from deletion channels]] || Computational complexity || 7 || 0 || 0 || 3 || 0 || 4 || 2026-10-18 | |||
|- | |- | ||
| [[Dixmier's unitarizability problem]] || Group theory || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-17 | | [[Dixmier's unitarizability problem]] || Group theory || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-17 | ||
| Line 455: | Line 457: | ||
|- | |- | ||
| [[Uchida's conjecture on open homomorphisms of Galois groups]] || Number theory || 6 || 1 || 0 || 1 || 0 || 4 || 2026-10-25 | | [[Uchida's conjecture on open homomorphisms of Galois groups]] || Number theory || 6 || 1 || 0 || 1 || 0 || 4 || 2026-10-25 | ||
|- | |||
| [[Cannon's conjecture]] || Geometric topology || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-22 | |||
|- | |- | ||
| [[The approximation threshold for metric k-median]] || Algorithms || 6 || 3 || 0 || 0 || 0 || 3 || 2026-10-22 | | [[The approximation threshold for metric k-median]] || Algorithms || 6 || 3 || 0 || 0 || 0 || 3 || 2026-10-22 | ||
| Line 471: | Line 475: | ||
|- | |- | ||
| [[Deterministic Ramanujan graphs in every degree]] || Combinatorics || 6 || 1 || 0 || 1 || 1 || 3 || 2026-10-18 | | [[Deterministic Ramanujan graphs in every degree]] || Combinatorics || 6 || 1 || 0 || 1 || 1 || 3 || 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 | | [[Spontaneous magnetization and Bloch's law for the quantum Heisenberg ferromagnet]] || Mathematical physics || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-18 | ||
| Line 484: | Line 484: | ||
| [[The L log L Fourier-convergence conjecture]] || Harmonic analysis || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-18 | | [[The L log L Fourier-convergence conjecture]] || Harmonic analysis || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-18 | ||
|- | |- | ||
| [[The | | [[The entropy photon-number inequality]] || Quantum information || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-18 | ||
|- | |- | ||
| [[The ordinary double point volume gap]] || Algebraic geometry || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-18 | | [[The ordinary double point volume gap]] || Algebraic geometry || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-18 | ||
| Line 493: | Line 493: | ||
|- | |- | ||
| [[The smooth realization problem]] || Dynamical systems || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-18 | | [[The smooth realization problem]] || Dynamical systems || 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 509: | Line 507: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[The Lipschitz isomorphism problem for separable Banach spaces]] || Functional analysis || 5 || 2 || 0 || 0 || 0 || 3 || 2026-11-05 | |||
|- | |- | ||
| [[Integral counterexamples to Gersten's conjecture]] || Algebra || 5 || 2 || 0 || 1 || 0 || 2 || 2026-11-02 | | [[Integral counterexamples to Gersten's conjecture]] || Algebra || 5 || 2 || 0 || 1 || 0 || 2 || 2026-11-02 | ||
| Line 559: | Line 559: | ||
|- | |- | ||
| [[Choiceless polynomial time with counting]] || Mathematical logic || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[Choiceless polynomial time with counting]] || Mathematical logic || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[Gepner and large-volume stability conditions on threefolds]] || Algebraic geometry || 5 || 0 || 0 || 2 || 0 || 3 || 2026-10-18 | |||
|- | |||
| [[Moore's parity conjecture for constant-depth quantum circuits]] || Computational complexity || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-18 | |||
|- | |- | ||
| [[Potential integral density on curve character varieties]] || Number theory || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[Potential integral density on curve character varieties]] || Number theory || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
| Line 581: | Line 585: | ||
|- | |- | ||
| [[The coarse Novikov conjecture]] || Operator algebras || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[The coarse Novikov conjecture]] || Operator algebras || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[The equivariant cohomological Hikita conjecture]] || Algebraic geometry || 5 || 0 || 0 || 2 || 1 || 2 || 2026-10-18 | | [[The equivariant cohomological Hikita conjecture]] || Algebraic geometry || 5 || 0 || 0 || 2 || 1 || 2 || 2026-10-18 | ||
| Line 605: | Line 607: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[Campana's abelianity conjecture]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-27 | | [[Campana's abelianity conjecture]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-27 | ||
| Line 623: | Line 623: | ||
|- | |- | ||
| [[The Solomon–Yau least-volume conjecture]] || Differential geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-19 | | [[The Solomon–Yau least-volume conjecture]] || Differential geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-19 | ||
|- | |||
| [[Bound states of the BFSS matrix model]] || Mathematical physics || 4 || 0 || 1 || 1 || 0 || 2 || 2026-10-18 | |||
|- | |- | ||
| [[Carleson's pointwise convergence problem for the Schrödinger equation]] || Harmonic analysis || 4 || 0 || 0 || 1 || 0 || 3 || 2026-10-18 | | [[Carleson's pointwise convergence problem for the Schrödinger equation]] || Harmonic analysis || 4 || 0 || 0 || 1 || 0 || 3 || 2026-10-18 | ||
| Line 697: | Line 699: | ||
|- | |- | ||
| [[Anticanonical nonvanishing under smooth semipositivity]] || Algebraic geometry || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[Anticanonical nonvanishing under smooth semipositivity]] || Algebraic geometry || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[Curtis's conjecture]] || Homotopy theory || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[Curtis's conjecture]] || Homotopy theory || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
Latest revision as of 12:40, 6 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 7 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.
- 2975 follow-up entries in total:
- Research follow-ups: 664
- Formalizations: 38
- Reviews and verifications: 932
- Critiques and corrections: 21
- Catalogue entries, citations and exposition: 1320
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.
