Source ledger
References
918 bibliography records ground the catalog in original papers, established surveys and monographs, institutional problem lists, and formal-proof archives.
Complete bibliography
918 records
- Sarnak2010ThreeLecturesMobiusOpen source ↗
Three lectures on the Möbius function: randomness and dynamics
2010 · misc
Peter Sarnak, “Three lectures on the Möbius function: randomness and dynamics,” lecture notes, 2010.
- Savin2009FlatLevelSetsOpen source ↗
Regularity of flat level sets in phase transitions
2009 · misc
Ovidiu Savin, “Regularity of flat level sets in phase transitions,” Ann. of Math. 169 (2009), 41–78, DOI 10.4007/annals.2009.169.41.
- BrendleHung2026PositiveS2S2Open source ↗
A metric on $S^2\times S^2$ with positive sectional curvature
Simon Brendle and Pei-Ken Hung · 2026 · misc
arXiv:2608.19068; the submission includes ancillary Mathematica code.
- DavisOkun2001VanishingOpen source ↗
Vanishing theorems and conjectures for the $L^2$-homology of right-angled Coxeter groups
Michael W. Davis and Boris Okun · 2001 · misc
Geometry and Topology 5 (2001), 7–74.
- EilenbergGanea1957CategoryOpen source ↗
On the Lusternik–Schnirelmann category of abstract groups
Samuel Eilenberg and Tudor Ganea · 1957 · misc
Annals of Mathematics 65 (1957), 517–518.
- BestvinaBrady1997MorseOpen source ↗
Morse theory and finiteness properties of groups
Mladen Bestvina and Noel Brady · 1997 · misc
Inventiones Mathematicae 129 (1997), 445–470.
- Brown1982CohomologyGroupsOpen source ↗
- Freyd1966StableHomotopy
Stable homotopy
Peter Freyd · 1966 · misc
Proceedings of the Conference on Categorical Algebra, La Jolla 1965, Springer, 121–172; MR0211399.
- Devinatz1998Generating
The generating hypothesis revisited
Ethan S. Devinatz · 1998 · misc
Stable and Unstable Homotopy, Fields Institute Communications 19, American Mathematical Society, 73–92.
- Hovey2007FreydOpen source ↗
On Freyd's generating hypothesis
Mark Hovey · 2007 · misc
Quarterly Journal of Mathematics 58 (2007), 31–45.
- ChernDoCarmoKobayashi1970MinimalOpen source ↗
Minimal submanifolds of a sphere with second fundamental form of constant length
Shiing-Shen Chern and Manfredo do Carmo and Shoshichi Kobayashi · 1970 · misc
Functional Analysis and Related Fields, Springer, 59–75.
- Verstraelen1986SectionalCurvature
Sectional curvature of minimal submanifolds
Leopold Verstraelen · 1986 · misc
Proceedings of the Workshop on Differential Geometry, University of Southampton, 48–62.
- ScherfnerWeissYau2012Chern
A review of the Chern conjecture for isoparametric hypersurfaces in spheres
Mike Scherfner and Simon Weiss and Shing-Tung Yau · 2012 · misc
Advances in Geometric Analysis, Advanced Lectures in Mathematics 21, International Press, 175–187.
- FiresterTsiamis2026ChernOpen source ↗
On Chern's conjecture for minimal submanifolds of the sphere
Benjy Firester and Raphael Tsiamis · 2026 · misc
arXiv:2608.18074; counterexamples concern higher codimension, not the hypersurface strong version.
- Morrey1952QuasiconvexityOpen source ↗
Quasi-convexity and the lower semicontinuity of multiple integrals
Charles B. Morrey, Jr. · 1952 · misc
Pacific Journal of Mathematics 2 (1952), 25–53.
- Sverak1992RankOneOpen source ↗
Rank-one convexity does not imply quasiconvexity
Vladimir Sverak · 1992 · misc
Proceedings of the Royal Society of Edinburgh Section A 120 (1992), 185–189.
- Pedregal2026RankOneOpen source ↗
Rank-one convexity implies quasiconvexity for two-component maps
Pablo Pedregal · 2026 · misc
arXiv:1905.06571v5, revised 18 June 2026; a full proof claim under review.
- BorelSerre1953SteenrodOpen source ↗
Groupes de Lie et puissances reduites de Steenrod
Armand Borel and Jean-Pierre Serre · 1953 · misc
American Journal of Mathematics 75 (1953), 409–448.
- CampanaDemaillyPeternell2020S6Open source ↗
The algebraic dimension of compact complex threefolds with vanishing second Betti number
Frederic Campana and Jean-Pierre Demailly and Thomas Peternell · 2020 · misc
Compositio Mathematica 156 (2020), 679–696.
- AlpogeHosted2026S6Open source ↗
The $(3,4,\infty)$ modular family of 2-tori, completed at its three special points, is a complex structure on $S^6$
2026 · misc
Unsigned and undated 108-page manuscript hosted at alpo.ge, first located in August 2026.
- Yau1982ProblemSection
Problem section
Shing-Tung Yau · 1982 · misc
Seminar on Differential Geometry, Annals of Mathematics Studies 102, Princeton University Press, 669–706.
- ChoiWang1983EigenvalueOpen source ↗
A first eigenvalue estimate for minimal hypersurfaces
Hyeong In Choi and Ai-Nung Wang · 1983 · misc
Journal of Differential Geometry 18 (1983), 559–562.
- Zeng2025YauClaimOpen source ↗
The first eigenvalue of embedded minimal hypersurfaces in the unit sphere I: Yau's conjecture
Lingzhong Zeng · 2025 · misc
arXiv:2508.06123; the claimed proof contains a decisive variational error.
- Yu2026EigenvalueOpen source ↗
On the first eigenvalue of embedded minimal hypersurfaces in the unit sphere
Jinhong Yu · 2026 · misc
arXiv:2606.10962; proves an improved lower bound while retaining the conjecture.
- Whitehead1941AddingRelationsOpen source ↗
On adding relations to homotopy groups
J. H. C. Whitehead · 1941 · misc
Annals of Mathematics 42 (1941), 409–428.
- Pasku2021WhiteheadOpen source ↗
An answer to the Whitehead asphericity question
Elton Pasku · 2021 · misc
arXiv:2107.12293; full affirmative proof claim under review.
- Kawauchi2024WhiteheadOpen source ↗
Whitehead aspherical conjecture via ribbon sphere-link
Akio Kawauchi · 2024 · misc
arXiv:2303.04368v2; full affirmative proof claim under review.
- Mikhovich2025WhiteheadOpen source ↗
Rational and $p$-adic analogues of J. H. C. Whitehead's conjecture
Andrey M. Mikhovich · 2025 · misc
Izvestiya: Mathematics 89 (2025), 60–104; treats the classical integral conjecture as open.
- AbboudVWilliams2014Open source ↗
Popular conjectures imply strong lower bounds for dynamic problems
Amir Abboud and Virginia Vassilevska Williams · 2014 · misc
Amir Abboud and Virginia Vassilevska Williams, “Popular conjectures imply strong lower bounds for dynamic problems,” Proceedings of FOCS 2014, 434–443, DOI: 10.1109/FOCS.2014.53.
- AbboudWilliamsWang2015OVOpen source ↗
More applications of the polynomial method to algorithm design
Amir Abboud and Virginia Vassilevska Williams and Huacheng Yu · 2015 · misc
Amir Abboud, Virginia Vassilevska Williams, and Huacheng Yu, “More applications of the polynomial method to algorithm design,” Proceedings of SODA 2015, 218–230, DOI: 10.1137/1.9781611973730.17.
- AdiceamSolomonWeiss2020DanzerOpen source ↗
Cut-and-project quasicrystals, lattice flows, and homogeneous dynamics
Faustin Adiceam and Yaar Solomon and Barak Weiss · 2020 · misc
Faustin Adiceam, Yaar Solomon, and Barak Weiss, “Cut-and-project quasicrystals, lattice flows, and homogeneous dynamics,” and survey “Around Danzer's problem,” arXiv:2010.06756 (2020), https://arxiv.org/abs/2010.06756.
- AdiprasitoEtAl2023ThreePowerOpen source ↗
The 3^d-conjecture for centrally symmetric polytopes
Karim Adiprasito and Raman Sanyal and Martin Winter · 2023 · misc
Karim Adiprasito, Raman Sanyal, and Martin Winter, “The 3^d-conjecture for centrally symmetric polytopes,” arXiv:2308.02909 (2023), https://arxiv.org/abs/2308.02909.
- Aharoni2001RyserOpen source ↗
Ryser's conjecture for tripartite 3-graphs
Ron Aharoni · 2001 · misc
Ron Aharoni, “Ryser's conjecture for tripartite 3-graphs,” Combinatorica 21 (2001), 1–4, DOI: 10.1007/s004930170001.
- AharoniEtAl2023NonuniformOpen source ↗
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture
Ron Aharoni and Eli Berger and Maria Chudnovsky and He Guo and Shira Zerbib · 2023 · misc
Ron Aharoni, Eli Berger, Maria Chudnovsky, He Guo, and Shira Zerbib, “Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture,” SIAM Journal on Discrete Mathematics 37 (2023), 1704–1714, DOI: 10.1137/22M1529658.
- AharonovAradLandauVazirani2009Open source ↗
The detectability lemma and quantum gap amplification
Dorit Aharonov and Itai Arad and Zeph Landau and Umesh Vazirani · 2009 · misc
Dorit Aharonov, Itai Arad, Zeph Landau, and Umesh Vazirani, “The detectability lemma and quantum gap amplification,” Proceedings of STOC 2009, 417–426, DOI: 10.1145/1536414.1536472.
- AharonovEtAl2013QPCPOpen source ↗
The quantum PCP conjecture
Dorit Aharonov and Itai Arad and Thomas Vidick · 2013 · misc
Dorit Aharonov, Itai Arad, and Thomas Vidick, “The quantum PCP conjecture,” ACM SIGACT News 44:2 (2013), 47–79, arXiv:1309.7495, https://arxiv.org/abs/1309.7495.
- AkiyamaExooHarary1981Open source ↗
Covering and packing in graphs. III. Cyclic and acyclic invariants
Jin Akiyama and Geoffrey Exoo and Frank Harary · 1980 · misc
Jin Akiyama, Geoffrey Exoo, and Frank Harary, “Covering and packing in graphs. III. Cyclic and acyclic invariants,” Mathematica Slovaca 30 (1980), 405–417, http://dml.cz/dmlcz/136236.
- Albertson2007CrossingOpen source ↗
Chromatic number, independence ratio, and crossing number
Michael O. Albertson · 2008 · misc
Michael O. Albertson, “Chromatic number, independence ratio, and crossing number,” Ars Mathematica Contemporanea 1 (2008), 1–6, https://dlib.si/details/URN:NBN:SI:DOC-ADNJPTM6?language=eng.
- AllenderEtAl2006MCSPOpen source ↗
Power from random strings
Eric Allender and Harry Buhrman and Michal Koucký and Dieter van Melkebeek and Detlef Ronneburger · 2006 · misc
Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, and Detlef Ronneburger, “Power from random strings,” SIAM Journal on Computing 35 (2006), 1467–1493, DOI: 10.1137/050628994.
- AlmanEtAl2024AsymmetryOpen source ↗
More asymmetry yields faster matrix multiplication
Josh Alman and Ran Duan and Virginia Vassilevska Williams and Yinzhan Xu and Zixuan Xu and Renfei Zhou · 2024 · misc
Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, and Renfei Zhou, “More asymmetry yields faster matrix multiplication,” arXiv:2404.16349 (2024), https://arxiv.org/abs/2404.16349.
- AlmanVW2021Open source ↗
A refined laser method and faster matrix multiplication
Josh Alman and Virginia Vassilevska Williams · 2021 · misc
Josh Alman and Virginia Vassilevska Williams, “A refined laser method and faster matrix multiplication,” Proceedings of SODA 2021, 522–539, DOI: 10.1137/1.9781611976465.32.
- Alon1988LinearOpen source ↗
The linear arboricity of graphs
Noga Alon · 1988 · misc
Noga Alon, “The linear arboricity of graphs,” Israel Journal of Mathematics 62 (1988), 311–325, DOI: 10.1007/BF02783300.
- AlonKrivelevichSudakov1998Open source ↗
Finding a large hidden clique in a random graph
Noga Alon and Michael Krivelevich and Benny Sudakov · 1998 · misc
Noga Alon, Michael Krivelevich, and Benny Sudakov, “Finding a large hidden clique in a random graph,” Random Structures \& Algorithms 13 (1998), 457–466, DOI: 10.1002/(SICI)1098-2418(199810/12)13:3/4<457::AID-RSA14>3.0.CO;2-W.
- AlonTarsi1992Open source ↗
Colorings and orientations of graphs
Noga Alon and Michael Tarsi · 1992 · misc
Noga Alon and Michael Tarsi, “Colorings and orientations of graphs,” Combinatorica 12 (1992), 125–134, DOI: 10.1007/BF01204715.
- AlweissEtAl2021Open source ↗
Improved bounds for the sunflower lemma
Ryan Alweiss and Shachar Lovett and Kewen Wu and Jiapeng Zhang · 2021 · misc
Ryan Alweiss, Shachar Lovett, Kewen Wu, and Jiapeng Zhang, “Improved bounds for the sunflower lemma,” Annals of Mathematics 194 (2021), 795–815, DOI: 10.4007/annals.2021.194.3.5.
- AlweissHuangSellke2024Open source ↗
Improved lower bound for the union-closed sets conjecture
Ryan Alweiss and Brice Huang and Mark Sellke · 2024 · misc
Ryan Alweiss, Brice Huang, and Mark Sellke, “Improved lower bound for the union-closed sets conjecture,” Electronic Journal of Combinatorics 31 (2024), Paper P1.23, DOI: 10.37236/12232.
- AngeltveitMcKay2024R55Open source ↗
R(5,5)\leq46
Vigleik Angeltveit and Brendan D. McKay · 2024 · misc
Vigleik Angeltveit and Brendan D. McKay, “R(5,5)\leq46,” arXiv:2409.15709 (2024), https://arxiv.org/abs/2409.15709.
- AroraBarak2009Open source ↗
Computational Complexity: A Modern Approach
Sanjeev Arora and Boaz Barak · 2009 · misc
Sanjeev Arora and Boaz Barak, Computational Complexity: A Modern Approach, Cambridge University Press (2009), https://theory.cs.princeton.edu/complexity/.