Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (201 pages, 829 entries) |
Automatic refresh from the published result pages (218 pages, 925 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 21 October 2026. The table can be re-sorted by any column. | ||
== Summary == | == Summary == | ||
* | * 218 result pages; 216 of them list at least one public follow-up. | ||
* | * 925 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 322 | ||
** Formalizations: 27 | ** Formalizations: 27 | ||
** Reviews and verifications: | ** Reviews and verifications: 471 | ||
** Critiques and corrections: | ** Critiques and corrections: 14 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 91 | ||
== 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 || 36 || 27 || 1 || 7 || 0 || 1 || 2026-10-19 | ||
|- | |- | ||
| [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 10 || 7 || 0 || 2 || 0 || 1 || 2026-10- | | [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 13 || 9 || 0 || 2 || 0 || 2 || 2026-10-15 | ||
|- | |||
| [[The Euclidean plane is not five-colorable]] || Discrete geometry || 10 || 7 || 0 || 0 || 1 || 2 || 2026-10-16 | |||
|- | |||
| [[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 | |||
|- | |- | ||
| [[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 | ||
| Line 22: | Line 28: | ||
| [[Exact Fourier transforms below n log n]] || Algorithms || 9 || 8 || 0 || 1 || 0 || 0 || 2026-10-17 | | [[Exact Fourier transforms below n log n]] || Algorithms || 9 || 8 || 0 || 1 || 0 || 0 || 2026-10-17 | ||
|- | |- | ||
| [[ | | [[Sidorenko's conjecture]] || Combinatorics || 8 || 4 || 0 || 3 || 0 || 1 || 2026-10-20 | ||
|- | |- | ||
| [[ | | [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-17 | ||
|- | |- | ||
| [[ | | [[Prime-factor statistics of p − 1]] || Number theory || 8 || 5 || 2 || 1 || 0 || 0 || 2026-10-17 | ||
|- | |- | ||
| [[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 | ||
| Line 32: | Line 38: | ||
| [[Integer multiplication below n log n]] || Algorithms || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[Integer multiplication below n log n]] || Algorithms || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[ | | [[Rapid mixing of the switch chain for every degree sequence]] || Algorithms || 8 || 3 || 0 || 5 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[ | | [[Hadwiger's conjecture]] || Combinatorics || 8 || 5 || 1 || 1 || 0 || 1 || 2026-10-12 | ||
|- | |- | ||
| [[Derandomization of logarithmic space]] || Computational complexity || 7 || 1 || 0 || 3 || 1 || 2 || 2026-10-20 | | [[Derandomization of logarithmic space]] || Computational complexity || 7 || 1 || 0 || 3 || 1 || 2 || 2026-10-20 | ||
|- | |||
| [[Irrationality of Catalan's constant]] || Number theory || 7 || 6 || 0 || 1 || 0 || 0 || 2026-10-20 | |||
|- | |||
| [[Permanence of weakly reversible mass-action systems]] || Dynamical systems || 7 || 5 || 0 || 2 || 0 || 0 || 2026-10-20 | |||
|- | |- | ||
| [[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 | ||
| Line 43: | Line 53: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[The irrationality exponent of π is 2]] || Number theory || 7 || 7 || 0 || 0 || 0 || 0 || 2026-10-18 | |||
|- | |- | ||
| [[Universal optimality of the triangular lattice]] || Discrete geometry || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[Universal optimality of the triangular lattice]] || Discrete geometry || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-17 | | [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-17 | ||
|- | |- | ||
| [[Approximate counting of common bases of two matroids]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-16 | | [[Approximate counting of common bases of two matroids]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Largest prime factors of consecutive integers]] || Number theory || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[Sampling and counting contingency tables]] || Algorithms || 7 || 2 || 0 || 5 || 0 || 0 || 2026-10-16 | | [[Sampling and counting contingency tables]] || Algorithms || 7 || 2 || 0 || 5 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Superexponential growth of van der Waerden numbers]] || Combinatorics || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-16 | | [[Superexponential growth of van der Waerden numbers]] || Combinatorics || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-16 | ||
| Line 63: | Line 73: | ||
|- | |- | ||
| [[The rational Hodge conjecture for CM abelian varieties]] || Algebraic geometry || 7 || 4 || 0 || 1 || 2 || 0 || 2026-10-16 | | [[The rational Hodge conjecture for CM abelian varieties]] || Algebraic geometry || 7 || 4 || 0 || 1 || 2 || 0 || 2026-10-16 | ||
|- | |||
| [[The Falconer distance conjecture]] || Harmonic analysis || 7 || 4 || 0 || 3 || 0 || 0 || 2026-10-15 | |||
|- | |||
| [[A quadratic bound for Jacobsthal's function]] || Number theory || 7 || 3 || 0 || 2 || 0 || 2 || 2026-10-14 | |||
|- | |||
| [[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 | |||
|- | |- | ||
| [[The Unique Games Conjecture]] || Computational complexity || 6 || 4 || 0 || 2 || 0 || 0 || 2026-10-18 | | [[The Unique Games Conjecture]] || Computational complexity || 6 || 4 || 0 || 2 || 0 || 0 || 2026-10-18 | ||
|- | |- | ||
| [[ | | [[Cylinder coverings below the half-area bound]] || Discrete geometry || 6 || 4 || 0 || 2 || 0 || 0 || 2026-10-17 | ||
|- | |- | ||
| [[ | | [[Erdős's conjecture on arithmetic progressions]] || Combinatorics || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | | [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Nagata's conjecture on plane curves]] || Algebraic geometry || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Nagata's conjecture on plane curves]] || Algebraic geometry || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 81: | Line 97: | ||
|- | |- | ||
| [[Stable blowup for the defocusing nonlinear Schrödinger equation]] || Partial differential equations || 6 || 0 || 0 || 4 || 1 || 1 || 2026-10-16 | | [[Stable blowup for the defocusing nonlinear Schrödinger equation]] || Partial differential equations || 6 || 0 || 0 || 4 || 1 || 1 || 2026-10-16 | ||
|- | |||
| [[The Bass trace conjecture]] || Group theory || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[The Toms–Winter conjecture]] || Operator algebras || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The Toms–Winter conjecture]] || Operator algebras || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 91: | Line 109: | ||
|- | |- | ||
| [[Uniform bounds for limit cycles in Hilbert's sixteenth problem]] || Dynamical systems || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[Uniform bounds for limit cycles in Hilbert's sixteenth problem]] || Dynamical systems || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The generator problem for von Neumann algebras]] || Operator algebras || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-15 | | [[The generator problem for von Neumann algebras]] || Operator algebras || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-15 | ||
|- | |- | ||
| [[ | | [[Reconstruction thresholds for Potts broadcasting on trees]] || Probability || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-11 | ||
|- | |- | ||
| [[ | | [[Glauber dynamics of the Sherrington–Kirkpatrick model]] || Probability || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-20 | ||
|- | |- | ||
| [[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 113: | Line 127: | ||
|- | |- | ||
| [[Bose–Einstein condensation in the dilute Bose gas]] || Mathematical physics || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[Bose–Einstein condensation in the dilute Bose gas]] || Mathematical physics || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[Cannon's conjecture]] || Geometric topology || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | |||
|- | |||
| [[Donaldson's tamed-to-compatible conjecture]] || Differential geometry || 5 || 0 || 0 || 5 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Elementary positivity of chromatic quasisymmetric functions]] || Combinatorics || 5 || 0 || 0 || 5 || 0 || 0 || 2026-10-16 | | [[Elementary positivity of chromatic quasisymmetric functions]] || Combinatorics || 5 || 0 || 0 || 5 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Entanglement without secret key and the PPT-squared conjecture]] || Quantum information || 5 || 0 || 0 || 5 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Heilbronn's triangle problem]] || Discrete geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Heilbronn's triangle problem]] || Discrete geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Lech's multiplicity conjecture]] || Algebra || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Lech's multiplicity conjecture]] || Algebra || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 139: | Line 157: | ||
|- | |- | ||
| [[The Cartan–Hadamard isoperimetric conjecture]] || Differential geometry || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[The Cartan–Hadamard isoperimetric conjecture]] || Differential geometry || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[The Gotsman–Linial conjecture]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[The Laughlin spectral gap]] || Mathematical physics || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The Laughlin spectral gap]] || Mathematical physics || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 145: | Line 165: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[The generalized Lax conjecture]] || Convex geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[The hyperinvariant subspace problem]] || Functional analysis || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[The hyperinvariant subspace problem]] || Functional analysis || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
| Line 161: | Line 183: | ||
|- | |- | ||
| [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 5 || 3 || 0 || 2 || 0 || 0 || 2026-10-16 | | [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 5 || 3 || 0 || 2 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[A factor-two approximation for shortest common superstring]] || Algorithms || 5 || 1 || 4 || 0 || 0 || 0 || 2026-10-13 | | [[A factor-two approximation for shortest common superstring]] || Algorithms || 5 || 1 || 4 || 0 || 0 || 0 || 2026-10-13 | ||
| Line 169: | Line 189: | ||
|- | |- | ||
| [[The Ajtai–Erdős–Komlós–Szemerédi independence conjecture]] || Combinatorics || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-11 | | [[The Ajtai–Erdős–Komlós–Szemerédi independence conjecture]] || Combinatorics || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-11 | ||
|- | |||
| [[The circulant Hadamard conjecture]] || Combinatorics || 5 || 0 || 0 || 3 || 0 || 2 || 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 | ||
| Line 175: | Line 197: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Borsuk's conjecture]] || Discrete geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | |||
|- | |- | ||
| [[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 | ||
| Line 199: | Line 223: | ||
|- | |- | ||
| [[The area law for gapped ground states in two dimensions]] || Mathematical physics || 4 || 1 || 2 || 1 || 0 || 0 || 2026-10-16 | | [[The area law for gapped ground states in two dimensions]] || Mathematical physics || 4 || 1 || 2 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[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 | ||
| Line 220: | Line 242: | ||
| [[Thompson's group F is nonamenable]] || Group theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-13 | | [[Thompson's group F is nonamenable]] || Group theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-13 | ||
|- | |- | ||
| [[ | | [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-11 | ||
|- | |- | ||
| [[ | | [[Positive lower density of large prime gaps]] || Number theory || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-11 | ||
|- | |- | ||
| [[The logarithmic Brunn–Minkowski conjecture]] || Convex geometry || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-11 | | [[The logarithmic Brunn–Minkowski conjecture]] || Convex geometry || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-11 | ||
| Line 231: | Line 253: | ||
|- | |- | ||
| [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
|- | |||
| [[The Partition Principle and the Axiom of Choice]] || Mathematical logic || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | |||
|- | |- | ||
| [[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 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 low-temperature Sherrington–Kirkpatrick fluctuation law]] || Probability || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-20 | |||
|- | |- | ||
| [[Almost-linear-time maximum matching in general graphs]] || Algorithms || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Almost-linear-time maximum matching in general graphs]] || Algorithms || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 245: | Line 273: | ||
|- | |- | ||
| [[GOE bulk universality for random regular graphs]] || Probability || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[GOE bulk universality for random regular graphs]] || Probability || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[Gepner and large-volume stability conditions on threefolds]] || Algebraic geometry || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Hilbert's tenth problem over the rational numbers]] || Number theory || 3 || 1 || 1 || 1 || 0 || 0 || 2026-10-16 | | [[Hilbert's tenth problem over the rational numbers]] || Number theory || 3 || 1 || 1 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 269: | Line 299: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[The equivariant cohomological Hikita conjecture]] || Algebraic geometry || 3 || 0 || 0 || 2 || 1 || 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 276: | Line 308: | ||
| [[The spin-one Haldane gap]] || Mathematical physics || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The spin-one Haldane gap]] || Mathematical physics || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[ | | [[Monochromatic finite sums and products in the positive integers]] || Combinatorics || 3 || 0 || 2 || 0 || 0 || 1 || 2026-10-14 | ||
|- | |- | ||
| [[ | | [[Seymour's second-neighborhood conjecture]] || Combinatorics || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-14 | ||
|- | |- | ||
| [[The little finitistic dimension conjecture]] || Representation theory of algebras || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-14 | | [[The little finitistic dimension conjecture]] || Representation theory of algebras || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-14 | ||
| Line 285: | Line 317: | ||
|- | |- | ||
| [[Classical capacity of generalized amplitude damping]] || Quantum information || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-11 | | [[Classical capacity of generalized amplitude damping]] || Quantum information || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-11 | ||
|- | |- | ||
| [[Strong locality of unitary vertex operator algebras]] || Operator algebras || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[Strong locality of unitary vertex operator algebras]] || Operator algebras || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
| Line 299: | Line 329: | ||
|- | |- | ||
| [[The second Kahn–Kalai conjecture]] || Probability || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[The second Kahn–Kalai conjecture]] || Probability || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
|- | |||
| [[The trilinear Hilbert transform]] || Harmonic analysis || 2 || 0 || 0 || 2 || 0 || 0 || 2026-10-20 | |||
|- | |- | ||
| [[Gersten's conjecture and virtual specialness of one-relator groups]] || Group theory || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-18 | | [[Gersten's conjecture and virtual specialness of one-relator groups]] || Group theory || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-18 | ||
| Line 319: | Line 351: | ||
|- | |- | ||
| [[Kobayashi's canonical-ampleness conjecture]] || Complex analysis || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Kobayashi's canonical-ampleness conjecture]] || Complex analysis || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Kuznetsov's rationality conjecture]] || Algebraic geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Metric Markov cotype of ℓ1]] || Functional analysis || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Metric Markov cotype of ℓ1]] || Functional analysis || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 351: | Line 385: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[The near-boundary Birkhoff conjecture]] || Dynamical systems || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The near-boundary Birkhoff conjecture]] || Dynamical systems || 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 | | [[The random k-SAT satisfiability threshold]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[The unitary synthesis problem]] || Quantum information || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | |||
|- | |||
| [[Zariski's multiplicity conjecture]] || Algebraic geometry || 2 || 0 || 0 || 2 || 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 | ||
| Line 373: | Line 409: | ||
|- | |- | ||
| [[Free energies of random perceptrons]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-10 | | [[Free energies of random perceptrons]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-10 | ||
|- | |- | ||
| [[Long gaps between primes]] || Number theory || 2 || 1 || 1 || 0 || 0 || 0 || 2026-10-08 | | [[Long gaps between primes]] || Number theory || 2 || 1 || 1 || 0 || 0 || 0 || 2026-10-08 | ||
| Line 420: | Line 454: | ||
* 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 (9 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 18:16, 20 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 21 October 2026. The table can be re-sorted by any column.
Summary
- 218 result pages; 216 of them list at least one public follow-up.
- 925 follow-up entries in total:
- Research follow-ups: 322
- Formalizations: 27
- Reviews and verifications: 471
- Critiques and corrections: 14
- Catalogue entries, citations and exposition: 91
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 (9 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.
