Source ledger
References
837 bibliography records ground the catalog in original papers, established surveys and monographs, institutional problem lists, and formal-proof archives.
Complete bibliography
837 records
- ElShowkEtAl2012ThreeDimensionalIsingOpen source ↗
Solving the 3D Ising model with the conformal bootstrap
2012 · misc
Sheer El-Showk, Miguel F. Paulos, David Poland, Slava Rychkov, David Simmons-Duffin and Alessandro Vichi, “Solving the 3D Ising model with the conformal bootstrap,” Phys. Rev. D 86 (2012), 025022, DOI 10.1103/PhysRevD.86.025022.
- FerencziKulagaPrzymusLemanczyk2018SarnakOpen source ↗
Sarnak's conjecture: what's new
2018 · misc
Sébastien Ferenczi, Joanna Kułaga-Przymus and Mariusz Lemańczyk, “Sarnak's conjecture: what's new,” in Ergodic Theory and Dynamical Systems in their Interactions with Arithmetics and Combinatorics, Lecture Notes in Math. 2213, Springer, 2018, 163–235, DOI 10.1007/978-3-319-74908-2_11.
- FrantzikinakisHost2018LogarithmicSarnakOpen source ↗
The logarithmic Sarnak conjecture for ergodic weights
2018 · misc
Nikos Frantzikinakis and Bernard Host, “The logarithmic Sarnak conjecture for ergodic weights,” Ann. of Math. 187 (2018), 869–931, DOI 10.4007/annals.2018.187.3.6.
- GoldbringPi2025FirstOrderFreeGroupFactorsOpen source ↗
On the first-order free group factor elementary equivalence
2025 · misc
Isaac Goldbring and Jennifer Pi, “On the first-order free group factor elementary equivalence,” J. Operator Theory 94 (2025), 129–150, DOI 10.7900/jot.2023sep11.246.
- GomezAparicioJulgValette2019BaumConnesSurveyOpen source ↗
The Baum–Connes conjecture: an extended survey
2019 · misc
María Paula Gómez Aparicio, Pierre Julg and Alain Valette, “The Baum–Connes conjecture: an extended survey,” in Advances in Noncommutative Geometry, Springer, 2019, 127–244, DOI 10.1007/978-3-030-29597-4_3.
- HigsonKasparov2001ETheoryOpen source ↗
E-theory and KK-theory for groups which act properly and isometrically on Hilbert space
2001 · misc
Nigel Higson and Gennadi Kasparov, “E-theory and KK-theory for groups which act properly and isometrically on Hilbert space,” Invent. Math. 144 (2001), 23–74, DOI 10.1007/s002220000118.
- HigsonLafforgueSkandalis2002CounterexamplesOpen source ↗
Counterexamples to the Baum–Connes conjecture
2002 · misc
Nigel Higson, Vincent Lafforgue and Georges Skandalis, “Counterexamples to the Baum–Connes conjecture,” Geom. Funct. Anal. 12 (2002), 330–354, DOI 10.1007/s00039-002-8249-5.
- Kulske2025IsingHighlightsOpen source ↗
The Ising model: highlights and perspectives
2025 · misc
Christof Külske, “The Ising model: highlights and perspectives,” Math. Phys. Anal. Geom. 28 (2025), article 20, DOI 10.1007/s11040-025-09515-1.
- PolandSimmonsDuffin2016ConformalBootstrapOpen source ↗
The conformal bootstrap
2016 · misc
David Poland and David Simmons-Duffin, “The conformal bootstrap,” Nature Phys. 12 (2016), 535–539, DOI 10.1038/nphys3761.
- Radulescu1994RandomMatricesFreeFactorsOpen source ↗
Random matrices, amalgamated free products and subfactors of the von Neumann algebra of a free group, of noninteger index
1994 · misc
Florin Rădulescu, “Random matrices, amalgamated free products and subfactors of the von Neumann algebra of a free group, of noninteger index,” Invent. Math. 115 (1994), 347–390.
- 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.
- 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/.
- Babai2016GIOpen source ↗
Graph isomorphism in quasipolynomial time
László Babai · 2016 · misc
László Babai, “Graph isomorphism in quasipolynomial time,” Proceedings of STOC 2016, 684–697, DOI: 10.1145/2897518.2897542.
- BaiLiPark2026SecondNeighborhoodOpen source ↗
Towards a strengthening of the second neighborhood conjecture
Yandong Bai and Binlong Li and Boram Park · 2026 · misc
Yandong Bai, Binlong Li, and Boram Park, “Towards a strengthening of the second neighborhood conjecture,” arXiv:2607.18047 (2026), https://arxiv.org/abs/2607.18047.
- BaratToth2010AlbertsonOpen source ↗
Towards the Albertson conjecture
János Barát and Géza Tóth · 2010 · misc
János Barát and Géza Tóth, “Towards the Albertson conjecture,” Electronic Journal of Combinatorics 17 (2010), Research Paper R73, DOI: 10.37236/345.
- Barnette1969
Conjecture 5
David Barnette · 1969 · misc
David Barnette, “Conjecture 5,” in W. T. Tutte (ed.), Recent Progress in Combinatorics, Academic Press (1969), p. 343.
- BauerEtAl1990ToughOpen source ↗
Not every 2-tough graph is Hamiltonian
Douglas Bauer and Hajo J. Broersma and Henk Jan Veldman · 2000 · misc
Douglas Bauer, Hajo J. Broersma, and Henk Jan Veldman, “Not every 2-tough graph is Hamiltonian,” Discrete Applied Mathematics 99 (2000), 317–321, DOI: 10.1016/S0166-218X(99)00141-9.
- Behzad1965Total
Graphs and Their Chromatic Numbers
Mehdi Behzad · 1965 · misc
Mehdi Behzad, Graphs and Their Chromatic Numbers, PhD thesis, Michigan State University (1965).
- BennettEtAl2026TuzaOpen source ↗
Almost-perfect packings and Tuza's conjecture in the random geometric graph
Patrick Bennett and Ryan Cushman and Andrzej Dudek and Xavier Pérez-Giménez · 2026 · misc
Patrick Bennett, Ryan Cushman, Andrzej Dudek, and Xavier Pérez-Giménez, “Almost-perfect packings and Tuza's conjecture in the random geometric graph,” arXiv:2606.09736 (2026), https://arxiv.org/abs/2606.09736.
- BermanHartmanis1977Open source ↗
On isomorphisms and density of NP and other complete sets
Leonard Berman and Juris Hartmanis · 1977 · misc
Leonard Berman and Juris Hartmanis, “On isomorphisms and density of NP and other complete sets,” SIAM Journal on Computing 6 (1977), 305–322, DOI: 10.1137/0206023.
- BernsteinVazirani1997Open source ↗
Quantum complexity theory
Ethan Bernstein and Umesh Vazirani · 1997 · misc
Ethan Bernstein and Umesh Vazirani, “Quantum complexity theory,” SIAM Journal on Computing 26 (1997), 1411–1473, DOI: 10.1137/S0097539796300921.
- Bezdek2010IlluminationOpen source ↗
Classical Topics in Discrete Geometry
Károly Bezdek · 2010 · misc
Károly Bezdek, Classical Topics in Discrete Geometry, Springer (2010), Chapter 3, DOI: 10.1007/978-1-4419-0600-7.
- BonamyPerrettPostle2020ReedOpen source ↗
Bounding \chi by a fraction of \Delta for graphs without large cliques
Marthe Bonamy and Tom Kelly and Peter Nelson and Luke Postle · 2022 · misc
Marthe Bonamy, Tom Kelly, Peter Nelson, and Luke Postle, “Bounding \chi by a fraction of \Delta for graphs without large cliques,” Journal of Combinatorial Theory, Series B 157 (2022), 263–282, DOI: 10.1016/j.jctb.2022.06.002.
- BonatoNowakowski2011Open source ↗
The Game of Cops and Robbers on Graphs
Anthony Bonato and Richard J. Nowakowski · 2011 · misc
Anthony Bonato and Richard J. Nowakowski, The Game of Cops and Robbers on Graphs, AMS (2011), DOI: 10.1090/stml/061.
- Bondy1991ReconstructionOpen source ↗
A graph reconstructor's manual
J. A. Bondy · 1991 · misc
J. A. Bondy, “A graph reconstructor's manual,” in Surveys in Combinatorics 1991, London Mathematical Society Lecture Note Series 166, Cambridge University Press, 221–252, DOI: 10.1017/CBO9780511666216.009.
- Borsuk1933Open source ↗
Drei Sätze über die n-dimensionale euklidische Sphäre
Karol Borsuk · 1933 · misc
Karol Borsuk, “Drei Sätze über die n-dimensionale euklidische Sphäre,” Fundamenta Mathematicae 20 (1933), 177–190, http://eudml.org/doc/212650.
- BourgainMilman1987Open source ↗
New volume ratio properties for convex symmetric bodies in \mathbb R^n
Jean Bourgain and Vitali D. Milman · 1987 · misc
Jean Bourgain and Vitali D. Milman, “New volume ratio properties for convex symmetric bodies in \mathbb R^n,” Inventiones Mathematicae 88 (1987), 319–340, DOI: 10.1007/BF01388911.
- BrassMoserPach2005Open source ↗
Research Problems in Discrete Geometry
Peter Brass and William Moser and János Pach · 2005 · misc
Peter Brass, William Moser, and János Pach, Research Problems in Discrete Geometry, Springer (2005), Section 5.11, DOI: 10.1007/0-387-29929-7.