Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (376 pages, 2797 entries) |
Automatic refresh from the published result pages (376 pages, 2823 entries) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 3: | Line 3: | ||
== 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. | ||
* | * 2823 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 628 | ||
** Formalizations: 33 | ** Formalizations: 33 | ||
** Reviews and verifications: | ** Reviews and verifications: 920 | ||
** Critiques and corrections: 21 | ** Critiques and corrections: 21 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 1221 | ||
== Results == | == Results == | ||
| Line 16: | Line 16: | ||
| [[The quasi-Riemann hypothesis]] || Number theory || 73 || 50 || 4 || 9 || 0 || 10 || 2026-10-31 | | [[The quasi-Riemann hypothesis]] || Number theory || 73 || 50 || 4 || 9 || 0 || 10 || 2026-10-31 | ||
|- | |- | ||
| [[The Exponential Time Hypothesis]] || Computational complexity || | | [[The Exponential Time Hypothesis]] || Computational complexity || 38 || 11 || 0 || 15 || 0 || 12 || 2026-10-31 | ||
|- | |- | ||
| [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 30 || 16 || 0 || 7 || 0 || 7 || 2026-10-26 | | [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 30 || 16 || 0 || 7 || 0 || 7 || 2026-10-26 | ||
| Line 53: | Line 53: | ||
|- | |- | ||
| [[Sidorenko's conjecture]] || Combinatorics || 14 || 5 || 0 || 5 || 0 || 4 || 2026-10-24 | | [[Sidorenko's conjecture]] || Combinatorics || 14 || 5 || 0 || 5 || 0 || 4 || 2026-10-24 | ||
|- | |||
| [[Rapid mixing of the switch chain for every degree sequence]] || Algorithms || 14 || 5 || 0 || 5 || 0 || 4 || 2026-10-19 | |||
|- | |- | ||
| [[The Erdős similarity conjecture]] || Real analysis || 13 || 5 || 0 || 3 || 0 || 5 || 2026-10-30 | | [[The Erdős similarity conjecture]] || Real analysis || 13 || 5 || 0 || 3 || 0 || 5 || 2026-10-30 | ||
| Line 69: | Line 71: | ||
|- | |- | ||
| [[Thompson's group F is nonamenable]] || Group theory || 13 || 6 || 0 || 1 || 0 || 6 || 2026-10-20 | | [[Thompson's group F is nonamenable]] || Group theory || 13 || 6 || 0 || 1 || 0 || 6 || 2026-10-20 | ||
|- | |- | ||
| [[Hadwiger's conjecture]] || Combinatorics || 13 || 5 || 1 || 2 || 0 || 5 || 2026-10-16 | | [[Hadwiger's conjecture]] || Combinatorics || 13 || 5 || 1 || 2 || 0 || 5 || 2026-10-16 | ||
| Line 79: | Line 79: | ||
|- | |- | ||
| [[The generalized Lax conjecture]] || Convex geometry || 12 || 1 || 0 || 5 || 0 || 6 || 2026-10-27 | | [[The generalized Lax conjecture]] || Convex geometry || 12 || 1 || 0 || 5 || 0 || 6 || 2026-10-27 | ||
|- | |||
| [[Uniform bounds for limit cycles in Hilbert's sixteenth problem]] || Dynamical systems || 12 || 2 || 0 || 4 || 0 || 6 || 2026-10-27 | |||
|- | |- | ||
| [[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 87: | Line 89: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Permanence of weakly reversible mass-action systems]] || Dynamical systems || 12 || 6 || 0 || 3 || 0 || 3 || 2026-10-22 | |||
|- | |- | ||
| [[The Birch and Swinnerton-Dyer formula in low Selmer corank]] || Number theory || 12 || 6 || 0 || 2 || 0 || 4 || 2026-10-22 | | [[The Birch and Swinnerton-Dyer formula in low Selmer corank]] || Number theory || 12 || 6 || 0 || 2 || 0 || 4 || 2026-10-22 | ||
| Line 98: | Line 102: | ||
| [[One-sample matroid prophet inequalities]] || Algorithms || 11 || 2 || 0 || 5 || 0 || 4 || 2026-10-29 | | [[One-sample matroid prophet inequalities]] || Algorithms || 11 || 2 || 0 || 5 || 0 || 4 || 2026-10-29 | ||
|- | |- | ||
| [[ | | [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 11 || 5 || 0 || 2 || 0 || 4 || 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 | ||
| Line 109: | Line 113: | ||
|- | |- | ||
| [[Mean-payoff games in quasipolynomial time]] || Algorithms || 11 || 2 || 0 || 4 || 0 || 5 || 2026-10-22 | | [[Mean-payoff games in quasipolynomial time]] || Algorithms || 11 || 2 || 0 || 4 || 0 || 5 || 2026-10-22 | ||
|- | |- | ||
| [[The Gaussian moat problem]] || Number theory || 11 || 3 || 0 || 2 || 0 || 6 || 2026-10-22 | | [[The Gaussian moat problem]] || Number theory || 11 || 3 || 0 || 2 || 0 || 6 || 2026-10-22 | ||
| Line 143: | Line 145: | ||
|- | |- | ||
| [[The little finitistic dimension conjecture]] || Representation theory of algebras || 10 || 7 || 0 || 1 || 0 || 2 || 2026-10-28 | | [[The little finitistic dimension conjecture]] || Representation theory of algebras || 10 || 7 || 0 || 1 || 0 || 2 || 2026-10-28 | ||
|- | |- | ||
| [[Squarefree values of quartics and power-free values of polynomials]] || Number theory || 10 || 1 || 0 || 5 || 0 || 4 || 2026-10-27 | | [[Squarefree values of quartics and power-free values of polynomials]] || Number theory || 10 || 1 || 0 || 5 || 0 || 4 || 2026-10-27 | ||
| Line 177: | Line 177: | ||
|- | |- | ||
| [[The Bass trace conjecture]] || Group theory || 10 || 4 || 0 || 4 || 0 || 2 || 2026-10-17 | | [[The Bass trace conjecture]] || Group theory || 10 || 4 || 0 || 4 || 0 || 2 || 2026-10-17 | ||
|- | |||
| [[Bose–Einstein condensation in the dilute Bose gas]] || Mathematical physics || 9 || 2 || 0 || 4 || 0 || 3 || 2026-11-01 | |||
|- | |- | ||
| [[Monochromatic finite sums and products in the positive integers]] || Combinatorics || 9 || 0 || 2 || 3 || 0 || 4 || 2026-10-30 | | [[Monochromatic finite sums and products in the positive integers]] || Combinatorics || 9 || 0 || 2 || 3 || 0 || 4 || 2026-10-30 | ||
| Line 193: | Line 195: | ||
|- | |- | ||
| [[The circulant Hadamard conjecture]] || Combinatorics || 9 || 0 || 0 || 3 || 0 || 6 || 2026-10-21 | | [[The circulant Hadamard conjecture]] || Combinatorics || 9 || 0 || 0 || 3 || 0 || 6 || 2026-10-21 | ||
|- | |||
| [[Sensitivity versus block sensitivity]] || Computational complexity || 9 || 4 || 0 || 0 || 0 || 5 || 2026-10-19 | |||
|- | |- | ||
| [[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 | ||
| Line 211: | Line 215: | ||
|- | |- | ||
| [[The logarithmic Brunn–Minkowski conjecture]] || Convex geometry || 9 || 1 || 0 || 2 || 0 || 6 || 2026-10-18 | | [[The logarithmic Brunn–Minkowski conjecture]] || Convex geometry || 9 || 1 || 0 || 2 || 0 || 6 || 2026-10-18 | ||
|- | |||
| [[The periodic tiling conjecture in dimension three]] || Discrete geometry || 9 || 2 || 0 || 0 || 0 || 7 || 2026-10-18 | |||
|- | |- | ||
| [[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 | ||
| Line 235: | Line 241: | ||
|- | |- | ||
| [[The Cartan–Hadamard isoperimetric conjecture]] || Differential geometry || 8 || 1 || 0 || 4 || 0 || 3 || 2026-10-27 | | [[The Cartan–Hadamard isoperimetric conjecture]] || Differential geometry || 8 || 1 || 0 || 4 || 0 || 3 || 2026-10-27 | ||
|- | |||
| [[Deterministic polynomial factorization over prime fields]] || Algorithms || 8 || 3 || 0 || 1 || 0 || 4 || 2026-10-26 | |||
|- | |- | ||
| [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-26 | | [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-26 | ||
| Line 243: | Line 251: | ||
|- | |- | ||
| [[Wall's D(2) problem]] || Homotopy theory || 8 || 2 || 1 || 2 || 0 || 3 || 2026-10-23 | | [[Wall's D(2) problem]] || Homotopy theory || 8 || 2 || 1 || 2 || 0 || 3 || 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 257: | Line 263: | ||
|- | |- | ||
| [[Modularity of elliptic curves over imaginary quadratic fields]] || Number theory || 8 || 3 || 0 || 1 || 0 || 4 || 2026-10-19 | | [[Modularity of elliptic curves over imaginary quadratic fields]] || Number theory || 8 || 3 || 0 || 1 || 0 || 4 || 2026-10-19 | ||
|- | |- | ||
| [[Stable blowup for the defocusing nonlinear Schrödinger equation]] || Partial differential equations || 8 || 0 || 0 || 4 || 1 || 3 || 2026-10-19 | | [[Stable blowup for the defocusing nonlinear Schrödinger equation]] || Partial differential equations || 8 || 0 || 0 || 4 || 1 || 3 || 2026-10-19 | ||
| Line 267: | Line 271: | ||
|- | |- | ||
| [[Exponential semidefinite complexity of perfect matching]] || Computational complexity || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-18 | | [[Exponential semidefinite complexity of perfect matching]] || Computational complexity || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-18 | ||
|- | |||
| [[Homogeneous depth-five lower bounds for iterated matrix multiplication]] || Algebraic complexity || 8 || 0 || 0 || 4 || 0 || 4 || 2026-10-18 | |||
|- | |||
| [[Rokhlin's multiple-mixing problem]] || Dynamical systems || 8 || 0 || 0 || 4 || 1 || 3 || 2026-10-18 | |||
|- | |||
| [[Sinai's positive metric entropy conjecture for the standard map]] || Dynamical systems || 8 || 1 || 0 || 4 || 0 || 3 || 2026-10-18 | |||
|- | |- | ||
| [[The Lang–Plaut problem]] || Functional analysis || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-18 | | [[The Lang–Plaut problem]] || Functional analysis || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-18 | ||
|- | |||
| [[The entropy-rate dimension formula for self-similar measures]] || Dynamical systems || 8 || 2 || 0 || 2 || 0 || 4 || 2026-10-18 | |||
|- | |- | ||
| [[Bigeodesics in planar first-passage percolation]] || Probability || 8 || 0 || 0 || 4 || 0 || 4 || 2026-10-17 | | [[Bigeodesics in planar first-passage percolation]] || Probability || 8 || 0 || 0 || 4 || 0 || 4 || 2026-10-17 | ||
| Line 287: | Line 299: | ||
|- | |- | ||
| [[The modified integer round-up conjecture for bin packing]] || Algorithms || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-16 | | [[The modified integer round-up conjecture for bin packing]] || Algorithms || 8 || 1 || 0 || 3 || 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 | ||
| Line 305: | Line 315: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Memory–sample lower bounds for noiseless Gaussian regression]] || Information theory || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-29 | |||
|- | |- | ||
| [[The trilinear Hilbert transform]] || Harmonic analysis || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-29 | | [[The trilinear Hilbert transform]] || Harmonic analysis || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-29 | ||
|- | |- | ||
| [[The Barendregt–Geuvers–Klop conjecture]] || Mathematical logic || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-27 | | [[The Barendregt–Geuvers–Klop conjecture]] || Mathematical logic || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-27 | ||
|- | |- | ||
| [[Stein's conjecture for Hilbert transforms along Lipschitz vector fields]] || Harmonic analysis || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-26 | | [[Stein's conjecture for Hilbert transforms along Lipschitz vector fields]] || Harmonic analysis || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-26 | ||
| Line 319: | Line 329: | ||
|- | |- | ||
| [[Regularity of infinity-harmonic functions]] || Partial differential equations || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-24 | | [[Regularity of infinity-harmonic functions]] || Partial differential equations || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-24 | ||
|- | |||
| [[Singular Bernoulli convolutions]] || Real analysis || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-23 | |||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[Cannon's conjecture]] || Geometric topology || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-22 | | [[Cannon's conjecture]] || Geometric topology || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-22 | ||
|- | |||
| [[Generalized star height at most three]] || Computational complexity || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-22 | |||
|- | |- | ||
| [[Goldfeld's conjecture for quadratic twists]] || Number theory || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-22 | | [[Goldfeld's conjecture for quadratic twists]] || Number theory || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-22 | ||
| Line 347: | Line 361: | ||
|- | |- | ||
| [[Approximability of uniform sparsest cut]] || Computational complexity || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-18 | | [[Approximability of uniform sparsest cut]] || Computational complexity || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-18 | ||
|- | |||
| [[Banach's simple Lebesgue-spectrum problem]] || Dynamical systems || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-18 | |||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[Entanglement without secret key and the PPT-squared conjecture]] || Quantum information || 7 || 0 || 0 || 5 || 0 || 2 || 2026-10-18 | | [[Entanglement without secret key and the PPT-squared conjecture]] || Quantum information || 7 || 0 || 0 || 5 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[Ergodicity and weak mixing of irrational triangular billiards]] || Dynamical systems || 7 || 0 || 0 || 4 || 0 || 3 || 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 | ||
|- | |- | ||
| [[Kalton's bounded approximation question for Lipschitz-free spaces]] || Functional analysis || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-18 | | [[Kalton's bounded approximation question for Lipschitz-free spaces]] || Functional analysis || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-18 | ||
|- | |||
| [[One-tape time simulation in two-fifths-power space]] || Computational complexity || 7 || 0 || 0 || 3 || 0 || 4 || 2026-10-18 | |||
|- | |- | ||
| [[Shokurov's conjecture on bounded klt complements]] || Algebraic geometry || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-18 | | [[Shokurov's conjecture on bounded klt complements]] || Algebraic geometry || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-18 | ||
| Line 379: | Line 399: | ||
|- | |- | ||
| [[The Kervaire conjecture]] || Group theory || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-17 | | [[The Kervaire conjecture]] || Group theory || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-17 | ||
|- | |- | ||
| [[Kaplansky's zero-divisor conjecture]] || Group theory || 7 || 3 || 0 || 1 || 0 || 3 || 2026-10-16 | | [[Kaplansky's zero-divisor conjecture]] || Group theory || 7 || 3 || 0 || 1 || 0 || 3 || 2026-10-16 | ||
|- | |- | ||
| [[Ryser's covering conjecture]] || Combinatorics || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-16 | | [[Ryser's covering conjecture]] || Combinatorics || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-16 | ||
|- | |- | ||
| [[The higher-dimensional Erdős distinct-distances conjecture]] || Discrete geometry || 7 || 0 || 1 || 2 || 0 || 4 || 2026-10-16 | | [[The higher-dimensional Erdős distinct-distances conjecture]] || Discrete geometry || 7 || 0 || 1 || 2 || 0 || 4 || 2026-10-16 | ||
| Line 403: | Line 415: | ||
|- | |- | ||
| [[Directional zero–one laws and ballisticity for random walks in random environment]] || Probability || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-29 | | [[Directional zero–one laws and ballisticity for random walks in random environment]] || Probability || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-29 | ||
|- | |- | ||
| [[Symplectic ball packing in higher dimensions]] || Differential geometry || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-29 | | [[Symplectic ball packing in higher dimensions]] || Differential geometry || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-29 | ||
| Line 420: | Line 430: | ||
| [[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 | ||
|- | |- | ||
| [[ | | [[The approximation threshold for metric k-median]] || Algorithms || 6 || 3 || 0 || 0 || 0 || 3 || 2026-10-22 | ||
|- | |- | ||
| [[The | | [[The computational complexity of Weisfeiler–Leman refinement]] || Computational complexity || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-22 | ||
|- | |- | ||
| [[De Giorgi's conjecture]] || Partial differential equations || 6 || 2 || 0 || 1 || 0 || 3 || 2026-10-21 | | [[De Giorgi's conjecture]] || Partial differential equations || 6 || 2 || 0 || 1 || 0 || 3 || 2026-10-21 | ||
| Line 453: | Line 461: | ||
|- | |- | ||
| [[The logarithmic Sobolev conjecture for subgaussian log-concave measures]] || Probability || 6 || 1 || 0 || 1 || 0 || 4 || 2026-10-18 | | [[The logarithmic Sobolev conjecture for subgaussian log-concave measures]] || Probability || 6 || 1 || 0 || 1 || 0 || 4 || 2026-10-18 | ||
|- | |||
| [[The near-boundary Birkhoff conjecture]] || Dynamical systems || 6 || 2 || 0 || 1 || 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 | ||
|- | |- | ||
| [[The separable quotient problem]] || Functional analysis || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-18 | | [[The separable quotient problem]] || Functional analysis || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[The smooth realization problem]] || Dynamical systems || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-18 | |||
|- | |- | ||
| [[Trace reconstruction from deletion channels]] || Computational complexity || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-18 | | [[Trace reconstruction from deletion channels]] || Computational complexity || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-18 | ||
| Line 471: | Line 483: | ||
|- | |- | ||
| [[Almost-linear-time maximum matching in general graphs]] || Algorithms || 6 || 2 || 0 || 1 || 0 || 3 || 2026-10-16 | | [[Almost-linear-time maximum matching in general graphs]] || Algorithms || 6 || 2 || 0 || 1 || 0 || 3 || 2026-10-16 | ||
|- | |- | ||
| [[Seymour's second-neighborhood conjecture]] || Combinatorics || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-16 | | [[Seymour's second-neighborhood conjecture]] || Combinatorics || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-16 | ||
| Line 499: | Line 505: | ||
|- | |- | ||
| [[Rigidity of the Turing degrees]] || Mathematical logic || 5 || 2 || 0 || 1 || 0 || 2 || 2026-10-22 | | [[Rigidity of the Turing degrees]] || Mathematical logic || 5 || 2 || 0 || 1 || 0 || 2 || 2026-10-22 | ||
|- | |- | ||
| [[The generalized Mukai conjecture]] || Algebraic geometry || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-21 | | [[The generalized Mukai conjecture]] || Algebraic geometry || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-21 | ||
| Line 541: | Line 545: | ||
|- | |- | ||
| [[Quasi-isometric recognition of virtually polycyclic groups]] || Group theory || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[Quasi-isometric recognition of virtually polycyclic groups]] || Group theory || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[Query complexity of log-concave sampling]] || Algorithms || 5 || 0 || 0 || 2 || 0 || 3 || 2026-10-18 | |||
|- | |- | ||
| [[Shub's entropy conjecture]] || Dynamical systems || 5 || 1 || 0 || 0 || 0 || 4 || 2026-10-18 | | [[Shub's entropy conjecture]] || Dynamical systems || 5 || 1 || 0 || 0 || 0 || 4 || 2026-10-18 | ||
| Line 589: | Line 595: | ||
|- | |- | ||
| [[The inhomogeneous Duffin–Schaeffer conjecture]] || Number theory || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-16 | | [[The inhomogeneous Duffin–Schaeffer conjecture]] || Number theory || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-16 | ||
|- | |- | ||
| [[The sharp constant in random triangle removal]] || Combinatorics || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-16 | | [[The sharp constant in random triangle removal]] || Combinatorics || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[The Lipschitz isomorphism problem for separable Banach spaces]] || Functional analysis || 4 || 1 || 0 || 0 || 0 || 3 || 2026-10-28 | | [[The Lipschitz isomorphism problem for separable Banach spaces]] || Functional analysis || 4 || 1 || 0 || 0 || 0 || 3 || 2026-10-28 | ||
| Line 623: | Line 625: | ||
|- | |- | ||
| [[Pixton's conjecture on tautological relations]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[Pixton's conjecture on tautological relations]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[Pointwise convergence of multiple ergodic averages for mixing transformations]] || Dynamical systems || 4 || 0 || 0 || 1 || 0 || 3 || 2026-10-18 | |||
|- | |- | ||
| [[QMA-hardness of continuum Coulomb energy]] || Mathematical physics || 4 || 0 || 0 || 2 || 0 || 2 || 2026-10-18 | | [[QMA-hardness of continuum Coulomb energy]] || Mathematical physics || 4 || 0 || 0 || 2 || 0 || 2 || 2026-10-18 | ||
| Line 631: | Line 635: | ||
|- | |- | ||
| [[The Hovey–Strickland conjecture]] || Homotopy theory || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[The Hovey–Strickland conjecture]] || Homotopy theory || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[The PCP-for-PPAD conjecture]] || Computational complexity || 4 || 0 || 0 || 1 || 0 || 3 || 2026-10-18 | |||
|- | |- | ||
| [[The Phillips–Toms conjecture]] || Operator algebras || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[The Phillips–Toms conjecture]] || Operator algebras || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[The abundance conjecture for threefolds in positive characteristic]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[The abundance conjecture for threefolds in positive characteristic]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[The existential theory of the reals in the counting hierarchy]] || Computational complexity || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | |||
|- | |- | ||
| [[The generalised abundance conjecture]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[The generalised abundance conjecture]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
| Line 649: | Line 657: | ||
|- | |- | ||
| [[Milne's rationality conjecture]] || Number theory || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-16 | | [[Milne's rationality conjecture]] || Number theory || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[Long gaps between primes]] || Number theory || 4 || 3 || 1 || 0 || 0 || 0 || 2026-10-09 | | [[Long gaps between primes]] || Number theory || 4 || 3 || 1 || 0 || 0 || 0 || 2026-10-09 | ||
| Line 755: | Line 761: | ||
|- | |- | ||
| [[Alperin's weight conjecture]] || Representation theory of algebras || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | | [[Alperin's weight conjecture]] || Representation theory of algebras || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The Eisenbud–Green–Harris and lex-plus-powers conjectures]] || Algebra || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[The Eisenbud–Green–Harris and lex-plus-powers conjectures]] || Algebra || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[Gaboriau's fixed price problem]] || Group theory || 2 || 0 || 0 || 1 || 0 || 1 || 2026-10-17 | | [[Gaboriau's fixed price problem]] || Group theory || 2 || 0 || 0 || 1 || 0 || 1 || 2026-10-17 | ||
Latest revision as of 21:49, 1 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 2 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.
- 2823 follow-up entries in total:
- Research follow-ups: 628
- Formalizations: 33
- Reviews and verifications: 920
- Critiques and corrections: 21
- Catalogue entries, citations and exposition: 1221
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.
