Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (255 pages, 1310 entries) |
Automatic refresh from the published result pages (255 pages, 1318 entries) |
||
| Line 3: | Line 3: | ||
== Summary == | == Summary == | ||
* 255 result pages; 254 of them list at least one public follow-up. | * 255 result pages; 254 of them list at least one public follow-up. | ||
* | * 1318 follow-up entries in total: | ||
** Research follow-ups: 459 | ** Research follow-ups: 459 | ||
** Formalizations: 31 | ** Formalizations: 31 | ||
** Reviews and verifications: 639 | ** Reviews and verifications: 639 | ||
** Critiques and corrections: 17 | ** Critiques and corrections: 17 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 172 | ||
== Results == | == Results == | ||
| Line 69: | Line 69: | ||
|- | |- | ||
| [[Superexponential growth of van der Waerden numbers]] || Combinatorics || 9 || 1 || 0 || 4 || 0 || 4 || 2026-10-16 | | [[Superexponential growth of van der Waerden numbers]] || Combinatorics || 9 || 1 || 0 || 4 || 0 || 4 || 2026-10-16 | ||
|- | |||
| [[The generalized Lax conjecture]] || Convex geometry || 8 || 1 || 0 || 5 || 0 || 2 || 2026-10-25 | |||
|- | |- | ||
| [[Heilbronn's triangle problem]] || Discrete geometry || 8 || 2 || 0 || 5 || 0 || 1 || 2026-10-22 | | [[Heilbronn's triangle problem]] || Discrete geometry || 8 || 2 || 0 || 5 || 0 || 1 || 2026-10-22 | ||
| Line 91: | Line 93: | ||
|- | |- | ||
| [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 7 || 5 || 0 || 1 || 0 || 1 || 2026-10-26 | | [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 7 || 5 || 0 || 1 || 0 || 1 || 2026-10-26 | ||
|- | |- | ||
| [[Donaldson's tamed-to-compatible conjecture]] || Differential geometry || 7 || 0 || 0 || 7 || 0 || 0 || 2026-10-24 | | [[Donaldson's tamed-to-compatible conjecture]] || Differential geometry || 7 || 0 || 0 || 7 || 0 || 0 || 2026-10-24 | ||
| Line 113: | Line 113: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[The Gotsman–Linial conjecture]] || Computational complexity || 7 || 3 || 0 || 3 || 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 119: | Line 121: | ||
|- | |- | ||
| [[Cylinder coverings below the half-area bound]] || Discrete geometry || 7 || 4 || 0 || 3 || 0 || 0 || 2026-10-17 | | [[Cylinder coverings below the half-area bound]] || Discrete geometry || 7 || 4 || 0 || 3 || 0 || 0 || 2026-10-17 | ||
|- | |||
| [[The affine Bernstein problem]] || Differential geometry || 7 || 1 || 0 || 4 || 0 || 2 || 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 | ||
| Line 137: | Line 141: | ||
|- | |- | ||
| [[The Gaussian propeller conjecture]] || Probability || 6 || 3 || 0 || 2 || 0 || 1 || 2026-10-26 | | [[The Gaussian propeller conjecture]] || Probability || 6 || 3 || 0 || 2 || 0 || 1 || 2026-10-26 | ||
|- | |||
| [[Wall's D(2) problem]] || Homotopy theory || 6 || 2 || 1 || 2 || 0 || 1 || 2026-10-23 | |||
|- | |- | ||
| [[Bose–Einstein condensation in the dilute Bose gas]] || Mathematical physics || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-22 | | [[Bose–Einstein condensation in the dilute Bose gas]] || Mathematical physics || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-22 | ||
| Line 147: | Line 153: | ||
|- | |- | ||
| [[The Birch and Swinnerton-Dyer formula in low Selmer corank]] || Number theory || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-22 | | [[The Birch and Swinnerton-Dyer formula in low Selmer corank]] || Number theory || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-22 | ||
|- | |||
| [[Barnette's conjecture]] || Combinatorics || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-21 | |||
|- | |- | ||
| [[The circulant Hadamard conjecture]] || Combinatorics || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-21 | | [[The circulant Hadamard conjecture]] || Combinatorics || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-21 | ||
| Line 155: | Line 163: | ||
|- | |- | ||
| [[Sensitivity versus block sensitivity]] || Computational complexity || 6 || 4 || 0 || 0 || 0 || 2 || 2026-10-19 | | [[Sensitivity versus block sensitivity]] || Computational complexity || 6 || 4 || 0 || 0 || 0 || 2 || 2026-10-19 | ||
|- | |- | ||
| [[The Laughlin spectral gap]] || Mathematical physics || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-19 | | [[The Laughlin spectral gap]] || Mathematical physics || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-19 | ||
| Line 169: | Line 175: | ||
|- | |- | ||
| [[Monochromatic finite sums and products in the positive integers]] || Combinatorics || 6 || 0 || 2 || 2 || 0 || 2 || 2026-10-16 | | [[Monochromatic finite sums and products in the positive integers]] || Combinatorics || 6 || 0 || 2 || 2 || 0 || 2 || 2026-10-16 | ||
|- | |||
| [[Naimark's problem]] || Operator algebras || 6 || 0 || 0 || 4 || 1 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[Power-saving bounds for square-difference-free sets]] || Combinatorics || 6 || 2 || 0 || 3 || 0 || 1 || 2026-10-16 | | [[Power-saving bounds for square-difference-free sets]] || Combinatorics || 6 || 2 || 0 || 3 || 0 || 1 || 2026-10-16 | ||
| Line 179: | Line 187: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[The two-point Chowla conjecture]] || Number theory || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The two-point Chowla conjecture]] || Number theory || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 193: | Line 199: | ||
|- | |- | ||
| [[The strong isotropic constant conjecture]] || Convex geometry || 5 || 2 || 0 || 2 || 0 || 1 || 2026-10-23 | | [[The strong isotropic constant conjecture]] || Convex geometry || 5 || 2 || 0 || 2 || 0 || 1 || 2026-10-23 | ||
|- | |- | ||
| [[Mass generation in two-dimensional O(n) models]] || Mathematical physics || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-22 | | [[Mass generation in two-dimensional O(n) models]] || Mathematical physics || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-22 | ||
|- | |- | ||
| [[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 | ||
| Line 231: | Line 233: | ||
|- | |- | ||
| [[Mean-payoff games in quasipolynomial time]] || Algorithms || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[Mean-payoff games in quasipolynomial time]] || Algorithms || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[Optimal mixing of the Thorp shuffle]] || Probability || 5 || 3 || 0 || 1 || 1 || 0 || 2026-10-16 | | [[Optimal mixing of the Thorp shuffle]] || Probability || 5 || 3 || 0 || 1 || 1 || 0 || 2026-10-16 | ||
| Line 265: | Line 265: | ||
|- | |- | ||
| [[Yau's harmonic dimension comparison problem]] || Differential geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Yau's harmonic dimension comparison problem]] || Differential geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Residual finiteness of hyperbolic groups]] || Group theory || 5 || 2 || 0 || 1 || 0 || 2 || 2026-10-14 | |||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Dixmier's unitarizability problem]] || Group theory || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-13 | |||
|- | |- | ||
| [[The GNRS conjecture for planar and bounded-treewidth graphs]] || Functional analysis || 5 || 1 || 1 || 3 || 0 || 0 || 2026-10-13 | | [[The GNRS conjecture for planar and bounded-treewidth graphs]] || Functional analysis || 5 || 1 || 1 || 3 || 0 || 0 || 2026-10-13 | ||
| Line 331: | Line 335: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[The periodic tiling conjecture in dimension three]] || Discrete geometry || 4 || 2 || 0 || 0 || 0 || 2 || 2026-10-12 | | [[The periodic tiling conjecture in dimension three]] || Discrete geometry || 4 || 2 || 0 || 0 || 0 || 2 || 2026-10-12 | ||
Revision as of 20:57, 25 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 26 October 2026. The table can be re-sorted by any column.
Summary
- 255 result pages; 254 of them list at least one public follow-up.
- 1318 follow-up entries in total:
- Research follow-ups: 459
- Formalizations: 31
- Reviews and verifications: 639
- Critiques and corrections: 17
- Catalogue entries, citations and exposition: 172
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.
