Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (229 pages, 1064 entries) |
Automatic refresh from the published result pages (239 pages, 1157 entries) |
||
| (18 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 23 October 2026. The table can be re-sorted by any column. | ||
== Summary == | == Summary == | ||
* | * 239 result pages; 238 of them list at least one public follow-up. | ||
* | * 1157 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 410 | ||
** Formalizations: 30 | ** Formalizations: 30 | ||
** Reviews and verifications: | ** Reviews and verifications: 553 | ||
** Critiques and corrections: | ** Critiques and corrections: 16 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 148 | ||
== 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 || 45 || 33 || 3 || 7 || 0 || 2 || 2026-10-21 | ||
|- | |- | ||
| [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || | | [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 17 || 11 || 0 || 2 || 0 || 4 || 2026-10-21 | ||
|- | |||
| [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 16 || 9 || 0 || 5 || 0 || 2 || 2026-10-22 | |||
|- | |- | ||
| [[The Euclidean plane is not five-colorable]] || Discrete geometry || 14 || 9 || 0 || 0 || 1 || 4 || 2026-10-17 | | [[The Euclidean plane is not five-colorable]] || Discrete geometry || 14 || 9 || 0 || 0 || 1 || 4 || 2026-10-17 | ||
|- | |||
| [[The rational Hodge conjecture for CM abelian varieties]] || Algebraic geometry || 10 || 5 || 0 || 1 || 4 || 0 || 2026-10-22 | |||
|- | |||
| [[The Unique Games Conjecture]] || Computational complexity || 10 || 5 || 1 || 2 || 0 || 2 || 2026-10-21 | |||
|- | |- | ||
| [[The irrationality exponent of π is 2]] || Number theory || 10 || 8 || 0 || 2 || 0 || 0 || 2026-10-21 | | [[The irrationality exponent of π is 2]] || Number theory || 10 || 8 || 0 || 2 || 0 || 0 || 2026-10-21 | ||
|- | |||
| [[Derandomization of logarithmic space]] || Computational complexity || 10 || 1 || 0 || 3 || 1 || 5 || 2026-10-20 | |||
|- | |||
| [[Rapid mixing of the switch chain for every degree sequence]] || Algorithms || 10 || 5 || 0 || 5 || 0 || 0 || 2026-10-19 | |||
|- | |||
| [[The Snaky achievement game]] || Combinatorics || 10 || 6 || 0 || 4 || 0 || 0 || 2026-10-19 | |||
|- | |- | ||
| [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 10 || 7 || 0 || 1 || 0 || 2 || 2026-10-17 | | [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 10 || 7 || 0 || 1 || 0 || 2 || 2026-10-17 | ||
|- | |- | ||
| [[ | | [[Exact Fourier transforms below n log n]] || Algorithms || 10 || 8 || 0 || 2 || 0 || 0 || 2026-10-17 | ||
|- | |||
| [[Integer multiplication below n log n]] || Algorithms || 10 || 8 || 0 || 1 || 0 || 1 || 2026-10-16 | |||
|- | |||
| [[Permanence of weakly reversible mass-action systems]] || Dynamical systems || 9 || 6 || 0 || 3 || 0 || 0 || 2026-10-22 | |||
|- | |- | ||
| [[Pure-point spectrum of the two-dimensional Anderson model]] || Mathematical physics || 9 || 1 || 1 || 5 || 0 || 2 || 2026-10-20 | | [[Pure-point spectrum of the two-dimensional Anderson model]] || Mathematical physics || 9 || 1 || 1 || 5 || 0 || 2 || 2026-10-20 | ||
|- | |- | ||
| [[Primitive roots for every admissible integer base]] || Number theory || 9 || 7 || 1 || 1 || 0 || 0 || 2026-10-19 | | [[Primitive roots for every admissible integer base]] || Number theory || 9 || 7 || 1 || 1 || 0 || 0 || 2026-10-19 | ||
| Line 36: | Line 50: | ||
| [[Kaplansky's direct-finiteness conjecture]] || Group theory || 9 || 4 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[Kaplansky's direct-finiteness conjecture]] || Group theory || 9 || 4 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[ | | [[The Erdős unit distance and pinned distance problems]] || Discrete geometry || 9 || 2 || 0 || 3 || 0 || 4 || 2026-10-18 | ||
|- | |- | ||
| [[Prime-factor statistics of p − 1]] || Number theory || 9 || 5 || 2 || 1 || 0 || 1 || 2026-10-17 | | [[Prime-factor statistics of p − 1]] || Number theory || 9 || 5 || 2 || 1 || 0 || 1 || 2026-10-17 | ||
|- | |- | ||
| [[Hadwiger's conjecture]] || Combinatorics || 9 || 5 || 1 || 2 || 0 || 1 || 2026-10-16 | | [[Hadwiger's conjecture]] || Combinatorics || 9 || 5 || 1 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[The Falconer distance conjecture]] || Harmonic analysis || 8 || 5 || 0 || 3 || 0 || 0 || 2026-10-22 | |||
|- | |- | ||
| [[Irrationality of Catalan's constant]] || Number theory || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-21 | | [[Irrationality of Catalan's constant]] || Number theory || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-21 | ||
|- | |- | ||
| [[Sidorenko's conjecture]] || Combinatorics || 8 || 4 || 0 || 3 || 0 || 1 || 2026-10-20 | | [[Sidorenko's conjecture]] || Combinatorics || 8 || 4 || 0 || 3 || 0 || 1 || 2026-10-20 | ||
|- | |- | ||
| [[The Lane–Emden conjecture]] || Partial differential equations || 8 || 5 || 0 || 3 || 0 || 0 || 2026-10-20 | | [[The Lane–Emden conjecture]] || Partial differential equations || 8 || 5 || 0 || 3 || 0 || 0 || 2026-10-20 | ||
|- | |- | ||
| [[Saxl's conjecture and the tensor square conjecture]] || Combinatorics || 8 || 1 || 1 || 5 || 1 || 0 || 2026-10-17 | | [[Saxl's conjecture and the tensor square conjecture]] || Combinatorics || 8 || 1 || 1 || 5 || 1 || 0 || 2026-10-17 | ||
|- | |- | ||
| [[Largest prime factors of consecutive integers]] || Number theory || 8 || 2 || 0 || 4 || 0 || 2 || 2026-10-16 | | [[Largest prime factors of consecutive integers]] || Number theory || 8 || 2 || 0 || 4 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[Superexponential growth of van der Waerden numbers]] || Combinatorics || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-16 | | [[Superexponential growth of van der Waerden numbers]] || Combinatorics || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-16 | ||
| Line 67: | Line 73: | ||
|- | |- | ||
| [[A quadratic bound for Jacobsthal's function]] || Number theory || 8 || 3 || 0 || 2 || 0 || 3 || 2026-10-14 | | [[A quadratic bound for Jacobsthal's function]] || Number theory || 8 || 3 || 0 || 2 || 0 || 3 || 2026-10-14 | ||
|- | |||
| [[Nagata's conjecture on plane curves]] || Algebraic geometry || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-21 | |||
|- | |- | ||
| [[The generator problem for von Neumann algebras]] || Operator algebras || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-21 | | [[The generator problem for von Neumann algebras]] || Operator algebras || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-21 | ||
|- | |||
| [[Uniform bounds for limit cycles in Hilbert's sixteenth problem]] || Dynamical systems || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-21 | |||
|- | |- | ||
| [[Approximate counting and entropy of perfect matchings]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-19 | | [[Approximate counting and entropy of perfect matchings]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-19 | ||
|- | |||
| [[Heilbronn's triangle problem]] || Discrete geometry || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-19 | |||
|- | |- | ||
| [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-18 | | [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-18 | ||
| Line 94: | Line 106: | ||
| [[The logarithmic exponent of off-diagonal Ramsey numbers]] || Combinatorics || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[The logarithmic exponent of off-diagonal Ramsey numbers]] || Combinatorics || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[ | | [[Erdős's conjecture on short Egyptian fractions]] || Number theory || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-10 | ||
|- | |||
| [[Depth-three circuit lower bounds beyond the square-root exponent]] || Computational complexity || 6 || 3 || 0 || 3 || 0 || 0 || 2026-10-22 | |||
|- | |||
| [[The Auslander–Reiten conjecture]] || Representation theory of algebras || 6 || 3 || 0 || 2 || 0 || 1 || 2026-10-22 | |||
|- | |- | ||
| [[The | | [[The Birch and Swinnerton-Dyer formula in low Selmer corank]] || Number theory || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-22 | ||
|- | |- | ||
| [[ | | [[The circulant Hadamard conjecture]] || Combinatorics || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-21 | ||
|- | |- | ||
| [[Universal computation in forced Navier–Stokes flows]] || Partial differential equations || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-20 | | [[Universal computation in forced Navier–Stokes flows]] || Partial differential equations || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-20 | ||
|- | |- | ||
| [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-20 | | [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-20 | ||
|- | |||
| [[One-sample matroid prophet inequalities]] || Algorithms || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-19 | |||
|- | |||
| [[The Gotsman–Linial conjecture]] || Computational complexity || 6 || 3 || 0 || 3 || 0 || 0 || 2026-10-19 | |||
|- | |||
| [[The Laughlin spectral gap]] || Mathematical physics || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-19 | |||
|- | |- | ||
| [[The triangular Hilbert transform at the symmetric point]] || Harmonic analysis || 6 || 3 || 0 || 3 || 0 || 0 || 2026-10-19 | | [[The triangular Hilbert transform at the symmetric point]] || Harmonic analysis || 6 || 3 || 0 || 3 || 0 || 0 || 2026-10-19 | ||
|- | |||
| [[A factor-two approximation for shortest common superstring]] || Algorithms || 6 || 2 || 4 || 0 || 0 || 0 || 2026-10-17 | |||
|- | |- | ||
| [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | | [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Lech's multiplicity conjecture]] || Algebra || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Lech's multiplicity conjecture]] || Algebra || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Positive lower density of large prime gaps]] || Number theory || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-16 | | [[Positive lower density of large prime gaps]] || Number theory || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-16 | ||
| Line 134: | Line 154: | ||
| [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 6 || 3 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 6 || 3 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[ | | [[The Gaussian moat problem]] || Number theory || 6 || 3 || 0 || 1 || 0 || 2 || 2026-10-12 | ||
|- | |||
| [[Petty's projection-volume conjecture]] || Convex geometry || 6 || 3 || 0 || 3 || 0 || 0 || 2026-10-10 | |||
|- | |- | ||
| [[ | | [[Barnette's conjecture]] || Combinatorics || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-21 | ||
|- | |- | ||
| [[Equality of microstates and nonmicrostates free entropy]] || Operator algebras || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-21 | | [[Equality of microstates and nonmicrostates free entropy]] || Operator algebras || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-21 | ||
|- | |- | ||
| [[Kaplansky's quasitrace conjecture]] || Operator algebras || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-21 | | [[Kaplansky's quasitrace conjecture]] || Operator algebras || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-21 | ||
|- | |||
| [[The Benjamini–Schramm percolation conjectures]] || Probability || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-21 | |||
|- | |- | ||
| [[The Kollár–Pardon conjecture on semialgebraic universal covers]] || Algebraic geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-21 | | [[The Kollár–Pardon conjecture on semialgebraic universal covers]] || Algebraic geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-21 | ||
| Line 149: | Line 173: | ||
|- | |- | ||
| [[Thompson's group F is nonamenable]] || Group theory || 5 || 3 || 0 || 1 || 0 || 1 || 2026-10-20 | | [[Thompson's group F is nonamenable]] || Group theory || 5 || 3 || 0 || 1 || 0 || 1 || 2026-10-20 | ||
|- | |||
| [[Yau's nodal conjecture for smooth metrics]] || Differential geometry || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-20 | |||
|- | |||
| [[Sensitivity versus block sensitivity]] || Computational complexity || 5 || 4 || 0 || 0 || 0 || 1 || 2026-10-19 | |||
|- | |- | ||
| [[The Barendregt–Geuvers–Klop conjecture]] || Mathematical logic || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-19 | | [[The Barendregt–Geuvers–Klop conjecture]] || Mathematical logic || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-19 | ||
| Line 173: | Line 201: | ||
|- | |- | ||
| [[Naimark's problem]] || Operator algebras || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | | [[Naimark's problem]] || Operator algebras || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Rokhlin's multiple-mixing problem]] || Dynamical systems || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | | [[Rokhlin's multiple-mixing problem]] || Dynamical systems || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | ||
| Line 181: | Line 207: | ||
|- | |- | ||
| [[Scheduling unit jobs with precedence constraints on three machines]] || Algorithms || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[Scheduling unit jobs with precedence constraints on three machines]] || Algorithms || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The Boone–Higman conjecture]] || Group theory || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The Boone–Higman conjecture]] || Group theory || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 189: | Line 213: | ||
|- | |- | ||
| [[The Erdős similarity conjecture]] || Real analysis || 5 || 3 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[The Erdős similarity conjecture]] || Real analysis || 5 || 3 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The combinatorial invariance conjecture for Kazhdan–Lusztig polynomials]] || Algebra || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The combinatorial invariance conjecture for Kazhdan–Lusztig polynomials]] || Algebra || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 213: | Line 233: | ||
|- | |- | ||
| [[The little finitistic dimension conjecture]] || Representation theory of algebras || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-14 | | [[The little finitistic dimension conjecture]] || Representation theory of algebras || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-14 | ||
|- | |- | ||
| [[Polynomial removal for ordered binary matrices]] || Combinatorics || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-11 | | [[Polynomial removal for ordered binary matrices]] || Combinatorics || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-11 | ||
|- | |- | ||
| [[Hardness of coloring three-colorable graphs]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[Hardness of coloring three-colorable graphs]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
|- | |- | ||
| [[The 2-to-1 Games Conjecture]] || Computational complexity || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[The 2-to-1 Games Conjecture]] || Computational complexity || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
| Line 230: | Line 242: | ||
| [[The Zariski cancellation problem over the complex numbers]] || Algebraic geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-10 | | [[The Zariski cancellation problem over the complex numbers]] || Algebraic geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-10 | ||
|- | |- | ||
| [[ | | [[Generalized star height at most three]] || Computational complexity || 4 || 2 || 0 || 2 || 0 || 0 || 2026-10-22 | ||
|- | |||
| [[De Giorgi's conjecture]] || Partial differential equations || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-21 | |||
|- | |- | ||
| [[Borsuk's conjecture]] || Discrete geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[Borsuk's conjecture]] || Discrete geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
| Line 236: | Line 250: | ||
| [[Absolutely continuous spectrum of the Anderson model in dimension at least three]] || Mathematical physics || 4 || 0 || 1 || 1 || 0 || 2 || 2026-10-16 | | [[Absolutely continuous spectrum of the Anderson model in dimension at least three]] || Mathematical physics || 4 || 0 || 1 || 1 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[ | | [[Classical capacity of generalized amplitude damping]] || Quantum information || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[Connes' bicentralizer problem]] || Operator algebras || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-16 | | [[Connes' bicentralizer problem]] || Operator algebras || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Deterministic polynomial factorization over prime fields]] || Algorithms || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-16 | | [[Deterministic polynomial factorization over prime fields]] || Algorithms || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-16 | ||
|- | |||
| [[Hilbert's tenth problem over the rational numbers]] || Number theory || 4 || 1 || 1 || 1 || 0 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[Mass generation in two-dimensional O(n) models]] || Mathematical physics || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-16 | | [[Mass generation in two-dimensional O(n) models]] || Mathematical physics || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-16 | ||
| Line 247: | Line 263: | ||
|- | |- | ||
| [[Regularity of infinity-harmonic functions]] || Partial differential equations || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[Regularity of infinity-harmonic functions]] || Partial differential equations || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[Ryser's covering conjecture]] || Combinatorics || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-16 | |||
|- | |||
| [[Spacetime Penrose inequalities]] || Differential geometry || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[Strong forms of the Arnold conjecture]] || Differential geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Strong forms of the Arnold conjecture]] || Differential geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 254: | Line 274: | ||
| [[Talagrand's expectation-threshold and discrete-convexity conjectures]] || Combinatorics || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Talagrand's expectation-threshold and discrete-convexity conjectures]] || Combinatorics || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[The | | [[The Deligne–Drinfeld conjecture]] || Algebra || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The Kervaire conjecture]] || Group theory || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The Kervaire conjecture]] || Group theory || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 265: | Line 285: | ||
|- | |- | ||
| [[Wall's D(2) problem]] || Homotopy theory || 4 || 2 || 1 || 1 || 0 || 0 || 2026-10-16 | | [[Wall's D(2) problem]] || Homotopy theory || 4 || 2 || 1 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Threshold parallel repetition for entangled games]] || Quantum information || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-15 | | [[Threshold parallel repetition for entangled games]] || Quantum information || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-15 | ||
|- | |- | ||
| [[Kaplansky's zero-divisor conjecture]] || Group theory || 4 || 3 || 0 || 1 || 0 || 0 || 2026-10-14 | | [[Kaplansky's zero-divisor conjecture]] || Group theory || 4 || 3 || 0 || 1 || 0 || 0 || 2026-10-14 | ||
|- | |||
| [[Dixmier's unitarizability problem]] || Group theory || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-13 | |||
|- | |- | ||
| [[Residual finiteness of hyperbolic groups]] || Group theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-13 | | [[Residual finiteness of hyperbolic groups]] || Group theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-13 | ||
| Line 291: | Line 311: | ||
|- | |- | ||
| [[The Sakoda–Sipser problem]] || Computational complexity || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[The Sakoda–Sipser problem]] || Computational complexity || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
|- | |||
| [[The entropy-rate dimension formula for self-similar measures]] || Dynamical systems || 4 || 2 || 0 || 2 || 0 || 0 || 2026-10-10 | |||
|- | |- | ||
| [[The infinite matroid intersection and packing/covering conjectures]] || Combinatorics || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-10 | | [[The infinite matroid intersection and packing/covering conjectures]] || Combinatorics || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-10 | ||
|- | |- | ||
| [[The stable coordinate and Abhyankar–Sathaye conjectures]] || Algebraic geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-10 | | [[The stable coordinate and Abhyankar–Sathaye conjectures]] || Algebraic geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-10 | ||
|- | |||
| [[Zariski's multiplicity conjecture]] || Algebraic geometry || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-23 | |||
|- | |||
| [[Goldfeld's conjecture for quadratic twists]] || Number theory || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-22 | |||
|- | |||
| [[Rigidity of the Turing degrees]] || Mathematical logic || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-22 | |||
|- | |||
| [[The computational complexity of Weisfeiler–Leman refinement]] || Computational complexity || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-22 | |||
|- | |||
| [[The hyperkähler SYZ conjecture]] || Algebraic geometry || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-22 | |||
|- | |||
| [[The unitary synthesis problem]] || Quantum information || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-22 | |||
|- | |- | ||
| [[The generalized Mukai conjecture]] || Algebraic geometry || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-21 | | [[The generalized Mukai conjecture]] || Algebraic geometry || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-21 | ||
| Line 307: | Line 341: | ||
|- | |- | ||
| [[Brennan's conjecture]] || Complex analysis || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[Brennan's conjecture]] || Complex analysis || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[Fourier extension for positively curved surfaces in three dimensions]] || Harmonic analysis || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-16 | | [[Fourier extension for positively curved surfaces in three dimensions]] || Harmonic analysis || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-16 | ||
| Line 317: | Line 349: | ||
|- | |- | ||
| [[Gepner and large-volume stability conditions on threefolds]] || Algebraic geometry || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | | [[Gepner and large-volume stability conditions on threefolds]] || Algebraic geometry || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Isomorphism of the free group factors]] || Operator algebras || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | | [[Isomorphism of the free group factors]] || Operator algebras || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | ||
| Line 337: | Line 367: | ||
|- | |- | ||
| [[Sogge's local smoothing conjecture in three dimensions]] || Harmonic analysis || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[Sogge's local smoothing conjecture in three dimensions]] || Harmonic analysis || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The Benson–Etingof–Ostrik conjecture for finite tensor categories]] || Algebra || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[The Benson–Etingof–Ostrik conjecture for finite tensor categories]] || Algebra || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The Courtade–Kumar conjecture]] || Information theory || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[The Courtade–Kumar conjecture]] || Information theory || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The abelian Zilber–Pink conjecture]] || Algebraic geometry || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The abelian Zilber–Pink conjecture]] || Algebraic geometry || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 353: | Line 379: | ||
|- | |- | ||
| [[The higher-dimensional Erdős distinct-distances conjecture]] || Discrete geometry || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | | [[The higher-dimensional Erdős distinct-distances conjecture]] || Discrete geometry || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[The isoperimetric conjecture for the cubic flat three-torus]] || Differential geometry || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[The ordinary double point volume gap]] || Algebraic geometry || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[The ordinary double point volume gap]] || Algebraic geometry || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
| Line 362: | Line 390: | ||
| [[The Euclidean Steinitz–Bergström conjecture]] || Discrete geometry || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-12 | | [[The Euclidean Steinitz–Bergström conjecture]] || Discrete geometry || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-12 | ||
|- | |- | ||
| [[ | | [[Memory–sample lower bounds for noiseless Gaussian regression]] || Information theory || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-10 | ||
|- | |- | ||
| [[The Lang–Plaut problem]] || Functional analysis || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[The Lang–Plaut problem]] || Functional analysis || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
| Line 389: | Line 417: | ||
|- | |- | ||
| [[Geometric Langlands and the generalized Ramanujan conjecture over function fields]] || Number theory || 2 || 0 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[Geometric Langlands and the generalized Ramanujan conjecture over function fields]] || Number theory || 2 || 0 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[Infinitely many closed geodesics on Riemannian spheres]] || Differential geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Infinitely many closed geodesics on Riemannian spheres]] || Differential geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 429: | Line 455: | ||
|- | |- | ||
| [[The existential theory of the reals in the counting hierarchy]] || Computational complexity || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The existential theory of the reals in the counting hierarchy]] || Computational complexity || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[The ionization and generalized ionization conjectures]] || Mathematical physics || 2 || 0 || 1 || 1 || 0 || 0 || 2026-10-16 | | [[The ionization and generalized ionization conjectures]] || Mathematical physics || 2 || 0 || 1 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 437: | Line 461: | ||
|- | |- | ||
| [[The random k-SAT satisfiability threshold]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The random k-SAT satisfiability threshold]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Conformal invariance of square-lattice random-cluster interfaces]] || Probability || 2 || 1 || 0 || 0 || 1 || 0 || 2026-10-15 | | [[Conformal invariance of square-lattice random-cluster interfaces]] || Probability || 2 || 1 || 0 || 0 || 1 || 0 || 2026-10-15 | ||
|- | |- | ||
| [[ | | [[Long gaps between primes]] || Number theory || 2 || 1 || 1 || 0 || 0 || 0 || 2026-10-08 | ||
|- | |- | ||
| [[ | | [[Hochster's small Cohen–Macaulay module conjecture]] || Algebra || 1 || 0 || 0 || 0 || 0 || 1 || 2026-10-21 | ||
|- | |- | ||
| [[Anticanonical nonvanishing under smooth semipositivity]] || Algebraic geometry || 1 || 0 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Anticanonical nonvanishing under smooth semipositivity]] || Algebraic geometry || 1 || 0 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 476: | Line 496: | ||
* 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. | * 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. | * 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 ( | * 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 (16 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. | * 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. | * 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. | ||
Latest revision as of 21:30, 22 October 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 23 October 2026. The table can be re-sorted by any column.
Summary
- 239 result pages; 238 of them list at least one public follow-up.
- 1157 follow-up entries in total:
- Research follow-ups: 410
- Formalizations: 30
- Reviews and verifications: 553
- Critiques and corrections: 16
- Catalogue entries, citations and exposition: 148
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 (16 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.
