List of unsolved problems in mathematics

From HandWiki
Short description: none

Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations. Some problems belong to more than one discipline and are studied using techniques from different areas. Prizes are often awarded for the solution to a long-standing problem, and some lists of unsolved problems, such as the Millennium Prize Problems, receive considerable attention.

This list is a composite of notable unsolved problems mentioned in previously published lists, including but not limited to lists considered authoritative, and the problems listed here vary widely in both difficulty and importance.

Notable lists

Various mathematicians and organizations have published and promoted lists of unsolved mathematical problems. In some cases, the lists have been associated with prizes for the discoverers of solutions.

List Number of
problems
Number unsolved
or incompletely solved
Proposed by Proposed
in
Thurston's 24 questions[1][2] 24 2 William Thurston 1982
Smale's problems 18 14 Stephen Smale 1998
Millennium Prize Problems 7 6[3] Clay Mathematics Institute 2000
Simon problems 15 < 12[4][5] Barry Simon 2000
DARPA's math challenges[6][7] 23 DARPA 2007
The Riemann zeta function, subject of the Riemann hypothesis[8]

Millennium Prize Problems

Of the original seven Millennium Prize Problems listed by the Clay Mathematics Institute in 2000, six remain unsolved to date:[3]

The seventh problem, the Poincaré conjecture, was solved by Grigori Perelman in 2003.[9] However, a generalization called the smooth four-dimensional Poincaré conjecture—that is, whether a four-dimensional topological sphere can have two or more inequivalent smooth structures—is unsolved.[10]

Notebooks

  • The Kourovka Notebook (Russian: Коуровская тетрадь) is a collection of unsolved problems in group theory, first published in 1965 and updated many times since.[11]
  • The Sverdlovsk Notebook (Russian: Свердловская тетрадь) is a collection of unsolved problems in semigroup theory, first published in 1965 and updated every 2 to 4 years since.[12][13][14]
  • The Dniester Notebook (Russian: Днестровская тетрадь) lists several hundred unsolved problems in algebra, particularly ring theory and modulus theory.[15][16]
  • The Erlagol Notebook (Russian: Эрлагольская тетрадь) lists unsolved problems in algebra and model theory.[17]

Unsolved problems

Algebra

In the Bloch sphere representation of a qubit, a SIC-POVM forms a regular tetrahedron. Zauner conjectured that analogous structures exist in complex Hilbert spaces of all finite dimensions.

Group theory

The free Burnside group B(2,3) is finite; in its Cayley graph, shown here, each of its 27 elements is represented by a vertex. The question of which other groups B(m,n) are finite remains open.

Representation theory

Analysis

Combinatorics

  • The 1/3–2/3 conjecture – does every finite partially ordered set that is not totally ordered contain two elements x and y such that the probability that x appears before y in a random linear extension is between 1/3 and 2/3?[23]
  • The Dittert conjecture concerning the maximum achieved by a particular function of matrices with real, nonnegative entries satisfying a summation condition
  • Problems in Latin squares – open questions concerning Latin squares
  • The lonely runner conjecture – if k runners with pairwise distinct speeds run round a track of unit length, will every runner be "lonely" (that is, be at least a distance 1/k from each other runner) at some time?[24]
  • Map folding – various problems in map folding and stamp folding.
  • No-three-in-line problem – how many points can be placed in the n×n grid so that no three of them lie on a line?
  • Rudin's conjecture on the number of squares in finite arithmetic progressions[25]
  • The sunflower conjecture – can the number of k size sets required for the existence of a sunflower of r sets be bounded by an exponential function in k for every fixed r>2?
  • Frankl's union-closed sets conjecture – for any family of sets closed under sums there exists an element (of the underlying space) belonging to half or more of the sets[26]

Dynamical systems

A detail of the Mandelbrot set. It is not known whether the Mandelbrot set is locally connected or not.

Games and puzzles

Combinatorial games

  • Sudoku:
  • Tic-tac-toe variants:
    • Given the width of a tic-tac-toe board, what is the smallest dimension such that X is guaranteed to have a winning strategy? (See also Hales–Jewett theorem and nd game)[37]
  • Chess:
    • What is the outcome of a perfectly played game of chess? (See also first-move advantage in chess)
  • Go:
    • What is the perfect value of Komi?
  • Set:
  • Are the nim-sequences of all finite octal games eventually periodic?
  • Is the nim-sequence of Grundy's game eventually periodic?

Games with imperfect information

Geometry

Algebraic geometry

Covering and packing

Differential geometry

Discrete geometry

In three dimensions, the kissing number is 12, because 12 non-overlapping unit spheres can be put into contact with a central unit sphere. (Here, the centers of outer spheres form the vertices of a regular icosahedron.) Kissing numbers are only known exactly in dimensions 1, 2, 3, 4, 8 and 24.

Euclidean geometry

  • Are the two Meissner tetrahedra the minimum-volume three-dimensional shapes of constant width?[79]
  • Moser's worm problem – what is the smallest area of a shape that can cover every unit-length curve in the plane?[80]
  • The moving sofa problem – what is the largest area of a shape that can be maneuvered through a unit-width L-shaped corridor?[81]
  • In parallelohedron:
    • Can every spherical non-convex polyhedron that tiles space by translation have its faces grouped into patches with the same combinatorial structure as a parallelohedron?[82]
    • Does every higher-dimensional tiling by translations of convex polytope tiles have an affine transformation taking it to a Voronoi diagram?[83]
  • Ropelength problems:
    • Is there a general expression for the minimum ropelength of an arbitrary closed knot?
    • What constant 1.1<a10.76 governs the lower bound of a closed knot K's minimum ropelength L(K)aCr(K)3/4?
    • Is the upper bound of a closed knot's minimum ropelength linear to its crossing number?
    • Is there a general expression for how much the ends of a long rope of radius 1 get closer when a tight open knot is tied into it?
  • Does every convex polyhedron have Rupert's property?[84][85][lower-alpha 1]
  • Shephard's problem (a.k.a. Dürer's conjecture) – does every convex polyhedron have a net, or simple edge-unfolding?[87][88]
  • Is there a non-convex polyhedron without self-intersections with more than seven faces, all of which share an edge with each other?
  • The Thomson problem – what is the minimum energy configuration of n mutually-repelling particles on a unit sphere?[89]
  • Convex uniform 5-polytopes – find and classify the complete set of these shapes[90]

Non-Euclidean geometry

Graph theory

Algebraic graph theory

Games on graphs

Graph coloring and labeling

An instance of the Erdős–Faber–Lovász conjecture: a graph formed from four cliques of four vertices each, any two of which intersect in a single vertex, can be four-colored.

Graph drawing and embedding

Restriction of graph parameters

Subgraphs

Word-representation of graphs

Miscellaneous graph theory

Model theory and formal languages

  • The Cherlin–Zilber conjecture: A simple group whose first-order theory is stable in 0 is a simple algebraic group over an algebraically closed field.
  • Generalized star height problem: can all regular languages be expressed using generalized regular expressions with limited nesting depths of Kleene stars?
  • For which number fields does Hilbert's tenth problem hold?
  • Kueker's conjecture[150]
  • The main gap conjecture, e.g. for uncountable first order theories, for AECs, and for 1-saturated models of a countable theory.[151]
  • Shelah's categoricity conjecture for Lω1,ω: If a sentence is categorical above the Hanf number then it is categorical in all cardinals above the Hanf number.[151]
  • Shelah's eventual categoricity conjecture: For every cardinal λ there exists a cardinal μ(λ) such that if an AEC K with LS(K)λ is categorical in a cardinal above μ(λ) then it is categorical in all cardinals above μ(λ).[151][152]
  • The stable field conjecture: every infinite field with a stable first-order theory is separably closed.
  • The stable forking conjecture for simple theories[153]
  • Tarski's exponential function problem: is the theory of the real numbers with the exponential function decidable?
  • The universality problem for C-free graphs: For which finite sets C of graphs does the class of C-free countable graphs have a universal member under strong embeddings?[154]
  • The universality spectrum problem: Is there a first-order theory whose universality spectrum is minimum?[155]
  • Vaught conjecture: the number of countable models of a first-order complete theory in a countable language is either finite, 0, or 20.
  • Assume K is the class of models of a countable first order theory omitting countably many types. If K has a model of cardinality ω1 does it have a model of cardinality continuum?[156]
  • Do the Henson graphs have the finite model property?
  • Does a finitely presented homogeneous structure for a finite relational language have finitely many reducts?
  • Does there exist an o-minimal first order theory with a trans-exponential (rapid growth) function?
  • If the class of atomic models of a complete first order theory is categorical in the n, is it categorical in every cardinal?[157][158]
  • Is every infinite, minimal field of characteristic zero algebraically closed? (Here, "minimal" means that every definable subset of the structure is finite or co-finite.)
  • Is the Borel monadic theory of the real order (BMTO) decidable? Is the monadic theory of well-ordering (MTWO) consistently decidable?[159]
  • Is the theory of the field of Laurent series over p decidable? of the field of polynomials over ?
  • Is there a logic L which satisfies both the Beth property and Δ-interpolation, is compact but does not satisfy the interpolation property?[160]
  • Determine the structure of Keisler's order.[161][162]
  • What is the nature of the proof-theoretic ordinal (the smallest ordinal a theory cannot prove well-founded) for second-order arithmetic, ZFC, or stronger theories?[163]

Probability theory

Number theory

General

6 is a perfect number because it is the sum of its proper positive divisors, 1, 2 and 3. It is not known how many perfect numbers there are, nor if any of them is odd.

Additive number theory

Algebraic number theory

Analytic number theory

Arithmetic geometry

Computational number theory

Diophantine approximation and transcendental number theory

The area of the blue region converges to the Euler–Mascheroni constant, which may or may not be a rational number.

Diophantine equations

Prime numbers

Goldbach's conjecture states that all even integers greater than 2 can be written as the sum of two primes. Here this is illustrated for the even integers from 4 to 28.

Set theory

Note: The following conjectures are expressed in the first-order language of axiomatic set theory and, unless stated otherwise, are here taken to be over Zermelo-Frankel set theory, possibly with Choice. In particular, the conjecture's independence may not be open in set theories with a wider or conflicting class of models, such as the various constructive resp. non-wellfounded set theories, etc.

Topology

The unknotting problem asks whether there is an efficient algorithm to identify when the shape presented in a knot diagram is actually the unknot.

Problems solved since 1995

Ricci flow, here illustrated with a 2D manifold, was the key tool in Grigori Perelman's solution of the Poincaré conjecture.

Algebra

Analysis

Combinatorics

Dynamical systems

Game theory

Geometry

21st century

20th century

Graph theory

Group theory

Number theory

21st century

20th century

Ramsey theory

Theoretical computer science

Topology

Uncategorised

2010s

2000s

See also

Notes

  1. A counterexample has been announced, with a preprint made available on arXiv.[86]
  2. A disproof has been announced, with a preprint made available on arXiv.[182]

References

  1. Friedl, Stefan (2014). "Thurston's vision and the virtual fibering theorem for 3-manifolds". Jahresbericht der Deutschen Mathematiker-Vereinigung 116 (4): 223–241. doi:10.1365/s13291-014-0102-x. 
  2. Thurston, William P. (1982). "Three-dimensional manifolds, Kleinian groups and hyperbolic geometry". Bulletin of the American Mathematical Society. New Series 6 (3): 357–381. doi:10.1090/S0273-0979-1982-15003-0. 
  3. 3.0 3.1 "Millennium Problems". http://claymath.org/millennium-problems. 
  4. "Fields Medal awarded to Artur Avila". 2014-08-13. http://www2.cnrs.fr/en/2435.htm?debut=8&theme1=12. 
  5. Bellos, Alex (2014-08-13). "Fields Medals 2014: the maths of Avila, Bhargava, Hairer and Mirzakhani explained". https://www.theguardian.com/science/alexs-adventures-in-numberland/2014/aug/13/fields-medals-2014-maths-avila-bhargava-hairer-mirzakhani. 
  6. "DARPA invests in math". CNN. 2008-10-14. http://edition.cnn.com/2008/TECH/science/10/09/darpa.challenges/index.html. 
  7. "Broad Agency Announcement (BAA 07-68) for Defense Sciences Office (DSO)". DARPA. 2007-09-10. http://www.math.utk.edu/~vasili/refs/darpa07.MathChallenges.html. 
  8. "Math Problems Guide: From Simple to Hardest Math Problems Tips & Examples." (in en-US). https://blendedlearningmath.com/math-word-problems-to-challenge-university-students/. 
  9. "Poincaré Conjecture". http://www.claymath.org/millenium-problems/poincar%C3%A9-conjecture. 
  10. rybu (November 7, 2009). "Smooth 4-dimensional Poincare conjecture". http://www.openproblemgarden.org/?q=op/smooth_4_dimensional_poincare_conjecture. 
  11. Khukhro, Evgeny I.; Mazurov, Victor D. (2019), Unsolved Problems in Group Theory. The Kourovka Notebook 
  12. RSFSR, MV i SSO; Russie), Uralʹskij gosudarstvennyj universitet im A. M. Gorʹkogo (Ekaterinbourg (1969) (in ru). Свердловская тетрадь: нерешенные задачи теории подгрупп. S. l.. https://books.google.com/books?id=nKwgzgEACAAJ. 
  13. Свердловская тетрадь: Сб. нерешённых задач по теории полугрупп. Свердловск: Уральский государственный университет. 1979. 
  14. Свердловская тетрадь: Сб. нерешённых задач по теории полугрупп. Свердловск: Уральский государственный университет. 1989. 
  15. (in ru) ДНЕСТРОВСКАЯ ТЕТРАДЬ, The Russian Academy of Sciences, 1993, http://math.nsc.ru/LBRT/a1/files/dnestr93.pdf 
  16. DNIESTER NOTEBOOK: Unsolved Problems in the Theory of Rings and Modules, https://math.usask.ca/~bremner/research/publications/dniester.pdf, retrieved 2019-08-15 
  17. (in ru) Эрлагольская тетрадь, The Novosibirsk State University, 2018, http://uamt.conf.nstu.ru/erl_note.pdf 
  18. Dowling, T. A. (February 1973). "A class of geometric lattices based on finite groups". Journal of Combinatorial Theory. Series B 14 (1): 61–86. doi:10.1016/S0095-8956(73)80007-3. 
  19. Aschbacher, Michael (1990), "On Conjectures of Guralnick and Thompson", Journal of Algebra 135 (2): 277–343, doi:10.1016/0021-8693(90)90292-V 
  20. Kung, H. T.; Traub, Joseph Frederick (1974), "Optimal order of one-point and multipoint iteration", Journal of the ACM 21 (4): 643–651, doi:10.1145/321850.321860 
  21. Smyth, Chris (2008), "The Mahler measure of algebraic numbers: a survey", in McKee, James; Smyth, Chris, Number Theory and Polynomials, London Mathematical Society Lecture Note Series, 352, Cambridge University Press, pp. 322–349, ISBN 978-0-521-71467-9 
  22. Hazewinkel, Michiel, ed. (2001), "Pompeiu problem", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4, https://www.encyclopediaofmath.org/index.php?title=Pompeiu_problem&oldid=14506 
  23. Brightwell, Graham R.; Felsner, Stefan; Trotter, William T. (1995), "Balancing pairs and the cross product conjecture", Order 12 (4): 327–349, doi:10.1007/BF01110378 .
  24. "Some remarks on the lonely runner conjecture". Contributions to Discrete Mathematics 13 (2): 1–31. 2018. doi:10.11575/cdm.v13i2.62728. 
  25. González-Jiménez, Enrique; Xarles, Xavier (2014). "On a conjecture of Rudin on squares in arithmetic progressions". LMS Journal of Computation and Mathematics 17 (1): 58–76. doi:10.1112/S1461157013000259. 
  26. Bruhn, Henning; Schaudt, Oliver (2015), "The journey of the union-closed sets conjecture", Graphs and Combinatorics 31 (6): 2043–2074, doi:10.1007/s00373-014-1515-0, http://www.zaik.uni-koeln.de/~schaudt/UCSurvey.pdf, retrieved 2017-07-18 
  27. Murnaghan, F. D. (1938), "The Analysis of the Direct Product of Irreducible Representations of the Symmetric Groups", American Journal of Mathematics 60 (1): 44–65, doi:10.2307/2371542, PMID 16577800 
  28. "Dedekind Numbers and Related Sequences". http://www.sfu.ca/~tyusun/ThesisDedekind.pdf. 
  29. Liśkiewicz, Maciej; Ogihara, Mitsunori; Toda, Seinosuke (2003-07-28). "The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes". Theoretical Computer Science 304 (1): 129–156. doi:10.1016/S0304-3975(03)00080-X. 
  30. S. M. Ulam, Problems in Modern Mathematics. Science Editions John Wiley & Sons, Inc., New York, 1964, page 76.
  31. Kaloshin, Vadim; Sorrentino, Alfonso (2018). "On the local Birkhoff conjecture for convex billiards". Annals of Mathematics 188 (1): 315–380. doi:10.4007/annals.2018.188.1.6. 
  32. Sarnak, Peter (2011), "Recent progress on the quantum unique ergodicity conjecture", Bulletin of the American Mathematical Society 48 (2): 211–228, doi:10.1090/S0273-0979-2011-01323-4 
  33. Paul Halmos, Ergodic theory. Chelsea, New York, 1956.
  34. Bowman, Joshua (2015), "The way the billiard ball bounces", Math Horizons 22 (3): 18–22, doi:10.4169/mathhorizons.22.3.18 
  35. Kari, Jarkko (2009). "Structure of Reversible Cellular Automata". International Conference on Unconventional Computation. 5715. Springer. p. 6. doi:10.1007/978-3-642-03745-0_5. ISBN 978-3-642-03744-3. Bibcode2009LNCS.5715....6K. 
  36. 36.0 36.1 36.2 "Open Q – Solving and rating of hard Sudoku". http://english.log-it-ex.com/2.html. 
  37. "Higher-Dimensional Tic-Tac-Toe". YouTube. 2017-09-21. https://www.youtube.com/watch?v=FwJZa-helig. 
  38. Austin, David (August 2016), "Game. SET. Polynomial.", Feature column (American Mathematical Society), https://www.ams.org/samplings/feature-column/fc-2016-08 .
  39. Barlet, Daniel; Peternell, Thomas; Schneider, Michael (1990). "On two conjectures of Hartshorne's". Mathematische Annalen 286 (1–3): 13–25. doi:10.1007/BF01453563. 
  40. Dupont, Johan L. (2001), Scissors congruences, group homology and characteristic classes, Nankai Tracts in Mathematics, 1, World Scientific Publishing Co., Inc., River Edge, NJ, p. 6, doi:10.1142/9789812810335, ISBN 978-981-02-4507-8, http://home.math.au.dk/dupont/scissors.ps .
  41. Maulik, Davesh (2004-06-05), Gromov–Witten theory and Donaldson–Thomas theory, I, Bibcode2003math.....12059M 
  42. Zariski, Oscar (1971). "Some open questions in the theory of singularities". Bulletin of the American Mathematical Society 77 (4): 481–491. doi:10.1090/S0002-9904-1971-12729-5. 
  43. Bereg, Sergey; Dumitrescu, Adrian; Jiang, Minghui (2010), "On covering problems of Rado", Algorithmica 57 (3): 538–561, doi:10.1007/s00453-009-9298-z 
  44. Melissen, Hans (1993), "Densest packings of congruent circles in an equilateral triangle", American Mathematical Monthly 100 (10): 916–925, doi:10.2307/2324212 
  45. Conway, John H.; Neil J.A. Sloane (1999), Sphere Packings, Lattices and Groups (3rd ed.), New York: Springer-Verlag, pp. 21–22, ISBN 978-0-387-98585-5 
  46. The Reinhardt conjecture as an optimal control problem, 2017 
  47. Brass, Peter; Moser, William; Pach, János (2005), Research Problems in Discrete Geometry, New York: Springer, p. 45, ISBN 978-0387-23815-9, https://books.google.com/books?id=WehCspo0Qa0C&pg=PA45 
  48. Gardner, Martin (1995), New Mathematical Diversions (Revised Edition), Washington: Mathematical Association of America, p. 251 
  49. Musin, Oleg R.; Tarasov, Alexey S. (2015). "The Tammes Problem for N = 14". Experimental Mathematics 24 (4): 460–468. doi:10.1080/10586458.2015.1022842. 
  50. Barros, Manuel (1997), "General Helices and a Theorem of Lancret", Proceedings of the American Mathematical Society 125 (5): 1503–1509, doi:10.1090/S0002-9939-97-03692-7 
  51. Katz, Mikhail G. (2007), Systolic geometry and topology, Mathematical Surveys and Monographs, 137, American Mathematical Society, Providence, RI, p. 57, doi:10.1090/surv/137, ISBN 978-0-8218-4177-8, https://books.google.com/books?id=R5_zBwAAQBAJ&pg=PA57 
  52. Rosenberg, Steven (1997), The Laplacian on a Riemannian Manifold: An introduction to analysis on manifolds, London Mathematical Society Student Texts, 31, Cambridge: Cambridge University Press, pp. 62–63, doi:10.1017/CBO9780511623783, ISBN 978-0-521-46300-3, https://books.google.com/books?id=gzJ6Vn0y7XQC&pg=PA62 
  53. Nikolayevsky, Y. (2003), "Two theorems on Osserman manifolds", Differential Geometry and Its Applications 18 (3): 239–253, doi:10.1016/S0926-2245(02)00160-2 
  54. Ghosh, Subir Kumar; Goswami, Partha P. (2013), "Unsolved problems in visibility graphs of points, segments, and polygons", ACM Computing Surveys 46 (2): 22:1–22:29, doi:10.1145/2543581.2543589 
  55. Brass, Peter; Moser, William; Pach, János (2005), Research problems in discrete geometry, Berlin: Springer, ISBN 0-387-23815-8 
  56. Boltjansky, V.; Gohberg, I. (1985), "11. Hadwiger's Conjecture", Results and Problems in Combinatorial Geometry, Cambridge University Press, pp. 44–46 .
  57. Morris, Walter D.; Soltan, Valeriu (2000), "The Erdős-Szekeres problem on points in convex position—a survey", Bull. Amer. Math. Soc. 37 (4): 437–458, doi:10.1090/S0273-0979-00-00877-6 ; Suk, Andrew (2016), "On the Erdős–Szekeres convex polygon problem", J. Amer. Math. Soc. 30 (4): 1047–1053, doi:10.1090/jams/869 
  58. "The number of faces of centrally-symmetric polytopes", Graphs and Combinatorics 5 (1): 389–391, 1989, doi:10.1007/BF01788696 .
  59. Moreno, José Pedro; Prieto-Martínez, Luis Felipe (2021). "El problema de los triángulos de Kobon" (in es). La Gaceta de la Real Sociedad Matemática Española 24 (1): 111–130. 
  60. "An olla-podrida of open problems, often oddly posed", American Mathematical Monthly 90 (3): 196–200, 1983, doi:10.2307/2975549 
  61. Lectures on discrete geometry, Graduate Texts in Mathematics, 212, Springer-Verlag, New York, 2002, p. 206, doi:10.1007/978-1-4613-0039-7, ISBN 978-0-387-95373-1 
  62. Burr, S. A.; Grünbaum, B.; Sloane, N. J. A. (1974), "The Orchard problem", Geometriae Dedicata 2 (4): 397–424, doi:10.1007/BF00147569 
  63. Brass, Peter; Moser, William; Pach, János (2005), "5.1 The Maximum Number of Unit Distances in the Plane", Research problems in discrete geometry, Springer, New York, pp. 183–190, ISBN 978-0-387-23815-9 
  64. "Improved bounds for planar k-sets and related problems", Discrete & Computational Geometry 19 (3): 373–382, 1998, doi:10.1007/PL00009354 ; Tóth, Gábor (2001), "Point sets with many k-sets", Discrete & Computational Geometry 26 (2): 187–194, doi:10.1007/s004540010022 .
  65. Aichholzer, Oswin; García, Jesús; Orden, David; Ramos, Pedro (2007). "New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn". Discrete & Computational Geometry 38 (1): 1–14. doi:10.1007/s00454-007-1325-8. https://link.springer.com/content/pdf/10.1007/s00454-007-1325-8.pdf. Retrieved 22 July 2025. 
  66. Aronov, Boris; Dujmović, Vida; Morin, Pat; Ooms, Aurélien; Schultz Xavier da Silveira, Luís Fernando (2019), "More Turán-type theorems for triangles in convex point sets", Electronic Journal of Combinatorics 26 (1): P1.8, doi:10.37236/7224, Bibcode2017arXiv170610193A, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p8, retrieved 2019-02-18 
  67. Atiyah, Michael (2001), "Configurations of points", Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 359 (1784): 1375–1387, doi:10.1098/rsta.2001.0840, ISSN 1364-503X, Bibcode2001RSPTA.359.1375A 
  68. Finch, S. R.; Wetzel, J. E. (2004), "Lost in a forest", American Mathematical Monthly 11 (8): 645–654, doi:10.2307/4145038 
  69. Howards, Hugh Nelson (2013), "Forming the Borromean rings out of arbitrary polygonal unknots", Journal of Knot Theory and Its Ramifications 22 (14): 1350083, 15, doi:10.1142/S0218216513500831 
  70. Miller, Ezra (2008), "Metric combinatorics of convex polyhedra: Cut loci and nonoverlapping unfoldings", Discrete & Computational Geometry 39 (1–3): 339–388, doi:10.1007/s00454-008-9052-3 . Announced in 2003.
  71. Solomon, Yaar; Weiss, Barak (2016), "Dense forests and Danzer sets", Annales Scientifiques de l'École Normale Supérieure 49 (5): 1053–1074, doi:10.24033/asens.2303 ; Conway, John H., Five $1,000 Problems (Update 2017), On-Line Encyclopedia of Integer Sequences, https://oeis.org/A248380/a248380.pdf, retrieved 2019-02-12 
  72. Brandts, Jan; Korotov, Sergey; Křížek, Michal; Šolc, Jakub (2009), "On nonobtuse simplicial partitions", SIAM Review 51 (2): 317–335, doi:10.1137/060669073, Bibcode2009SIAMR..51..317B, https://pure.uva.nl/ws/files/836396/73198_315330.pdf, retrieved 2018-11-22 . See in particular Conjecture 23, p. 327.
  73. Arutyunyants, G.; Iosevich, A. (2004), "Falconer conjecture, spherical averages and discrete analogs", in Pach, János, Towards a Theory of Geometric Graphs, Contemp. Math., 342, Amer. Math. Soc., Providence, RI, pp. 15–24, doi:10.1090/conm/342/06127, ISBN 978-0-8218-3484-8 
  74. Matschke, Benjamin (2014), "A survey on the square peg problem", Notices of the American Mathematical Society 61 (4): 346–352, doi:10.1090/noti1100 
  75. Katz, Nets; Tao, Terence (2002), "Recent progress on the Kakeya conjecture", Proceedings of the 6th International Conference on Harmonic Analysis and Partial Differential Equations (El Escorial, 2000), Publicacions Matemàtiques, pp. 161–179, doi:10.5565/PUBLMAT_Esco02_07 
  76. Weaire, Denis, ed. (1997), The Kelvin Problem, CRC Press, p. 1, ISBN 978-0-7484-0632-6, https://books.google.com/books?id=otokU4KQnXIC&pg=PA1 
  77. Brass, Peter; Moser, William; Pach, János (2005), Research problems in discrete geometry, New York: Springer, p. 457, ISBN 978-0-387-29929-7, https://books.google.com/books?id=cT7TB20y3A8C&pg=PA457 
  78. Mahler, Kurt (1939). "Ein Minimalproblem für konvexe Polygone". Mathematica (Zutphen) B: 118–127. 
  79. Kawohl, Bernd; Weber, Christof (2011), "Meissner's Mysterious Bodies", Mathematical Intelligencer 33 (3): 94–101, doi:10.1007/s00283-011-9239-y, https://www.mi.uni-koeln.de/mi/Forschung/Kawohl/kawohl/pub100.pdf .
  80. Norwood, Rick; Poole, George; Laidacker, Michael (1992), "The worm problem of Leo Moser", Discrete & Computational Geometry 7 (2): 153–162, doi:10.1007/BF02187832 
  81. Wagner, Neal R. (1976), "The Sofa Problem", The American Mathematical Monthly 83 (3): 188–189, doi:10.2307/2977022, http://www.cs.utsa.edu/~wagner/pubs/corner/corner_final.pdf, retrieved 2014-05-14 
  82. Senechal, Marjorie; Galiulin, R. V. (1984). "An introduction to the theory of figures: the geometry of E. S. Fedorov" (in en,fr). Structural Topology (10): 5–22. 
  83. Grünbaum, Branko; Shephard, G. C. (1980). "Tilings with congruent tiles". Bulletin of the American Mathematical Society. New Series 3 (3): 951–973. doi:10.1090/S0273-0979-1980-14827-2. 
  84. Chai, Ying; Yuan, Liping; Zamfirescu, Tudor (June–July 2018), "Rupert Property of Archimedean Solids", The American Mathematical Monthly 125 (6): 497–504, doi:10.1080/00029890.2018.1449505 
  85. Steininger, Jakob; Yurkevich, Sergey (December 27, 2021), An algorithmic approach to Rupert's problem 
  86. Steininger, Jakob; Yurkevich, Sergey (2025), A convex polyhedron without Rupert's property 
  87. Demaine, Erik D.; O'Rourke, Joseph (2007), "Chapter 22. Edge Unfolding of Polyhedra", Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Cambridge University Press, pp. 306–338 
  88. Ghomi, Mohammad (2018-01-01). "Dürer's Unfolding Problem for Convex Polyhedra". Notices of the American Mathematical Society 65 (1): 25–27. doi:10.1090/noti1609. ISSN 0002-9920. 
  89. Whyte, L. L. (1952), "Unique arrangements of points on a sphere", The American Mathematical Monthly 59 (9): 606–611, doi:10.2307/2306764 
  90. ACW (May 24, 2012), "Convex uniform 5-polytopes", Open Problem Garden, http://www.openproblemgarden.org/op/convex_uniform_5_polytopes, retrieved 2016-10-04 .
  91. Klostermeyer, W.; Mynhardt, C. (2015). "Protecting a graph with mobile guards". Applicable Analysis and Discrete Mathematics 10: 21. doi:10.2298/aadm151109021k. .
  92. Pleanmani, Nopparat (2019). "Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph". Discrete Mathematics, Algorithms and Applications 11 (6): 1950068, 7. doi:10.1142/s179383091950068x. 
  93. Baird, William; Bonato, Anthony (2012). "Meyniel's conjecture on the cop number: a survey". Journal of Combinatorics 3 (2): 225–238. doi:10.4310/JOC.2012.v3.n2.a6. 
  94. Zhu, Xuding (1999). "The Game Coloring Number of Planar Graphs". Journal of Combinatorial Theory, Series B 75 (2): 245–258. doi:10.1006/jctb.1998.1878. 
  95. Bousquet, Nicolas; Bartier, Valentin (2019), "Linear Transformations Between Colorings in Chordal Graphs", in Bender, Michael A.; Svensson, Ola; Herman, Grzegorz, 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany, LIPIcs, 144, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 24:1–24:15, doi:10.4230/LIPIcs.ESA.2019.24, ISBN 978-3-95977-124-5 
  96. "To the Moon and beyond", Graph Theory: Favorite Conjectures and Open Problems, II, Problem Books in Mathematics, Springer International Publishing, 2018, pp. 115–133, doi:10.1007/978-3-319-97686-0_11, ISBN 978-3-319-97684-6 
  97. Erdős on Graphs: His Legacy of Unsolved Problems, A K Peters, 1998, pp. 97–99 .
  98. "Extending the Gyárfás-Sumner conjecture", Journal of Combinatorial Theory, Series B 105: 11–16, 2014, doi:10.1016/j.jctb.2013.11.002 
  99. Toft, Bjarne (1996), "A survey of Hadwiger's conjecture", Congressus Numerantium 115: 249–283 .
  100. Croft, Hallard T.; Falconer, Kenneth J. (1991), Unsolved Problems in Geometry, Springer-Verlag , Problem G10.
  101. Hägglund, Jonas; Steffen, Eckhard (2014), "Petersen-colorings and some families of snarks", Ars Mathematica Contemporanea 7 (1): 161–173, doi:10.26493/1855-3974.288.11a, http://amc-journal.eu/index.php/amc/article/viewFile/288/247, retrieved 2016-09-30 .
  102. Jensen, Tommy R.; Toft, Bjarne (1995), "12.20 List-Edge-Chromatic Numbers", Graph Coloring Problems, New York: Wiley-Interscience, pp. 201–202, ISBN 978-0-471-02865-9 .
  103. Molloy, Michael (1998), "A bound on the total chromatic number", Combinatorica 18 (2): 241–280, doi:10.1007/PL00009820 .
  104. Barát, János; Tóth, Géza (2010), "Towards the Albertson Conjecture", Electronic Journal of Combinatorics 17 (1): R73, doi:10.37236/345, Bibcode2009arXiv0909.0413B .
  105. Fulek, Radoslav; Pach, János (2011), "A computational approach to Conway's thrackle conjecture", Computational Geometry 44 (6–7): 345–355, doi:10.1016/j.comgeo.2011.02.001 .
  106. Gupta, Anupam; Newman, Ilan; Rabinovich, Yuri (2004), "Cuts, trees and 1-embeddings of graphs", Combinatorica 24 (2): 233–269, doi:10.1007/s00493-004-0015-x 
  107. Hartsfield, Nora; Ringel, Gerhard (2013), Pearls in Graph Theory: A Comprehensive Introduction, Dover Books on Mathematics, Courier Dover Publications, p. 247, ISBN 978-0-486-31552-2 .
  108. Hliněný, Petr (2010), "20 years of Negami's planar cover conjecture", Graphs and Combinatorics 26 (4): 525–536, doi:10.1007/s00373-010-0934-9, http://www.fi.muni.cz/~hlineny/papers/plcover20-gc.pdf, retrieved 2016-10-04 .
  109. Nöllenburg, Martin; Prutkin, Roman; Rutter, Ignaz (2016), "On self-approaching and increasing-chord drawings of 3-connected planar graphs", Journal of Computational Geometry 7 (1): 47–69, doi:10.20382/jocg.v7i1a3 
  110. Pach, János; Sharir, Micha (2009), "5.1 Crossings—the Brick Factory Problem", Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures, Mathematical Surveys and Monographs, 152, American Mathematical Society, pp. 126–127 .
  111. Guy, R. K. (1960). "A combinatorial problem". Nabla (Bulletin of the Malayan Mathematical Society) 7: 68–72. 
  112. Demaine, E.; O'Rourke, J. (2002–2012), "Problem 45: Smallest Universal Set of Points for Planar Graphs", The Open Problems Project, http://cs.smith.edu/~orourke/TOPP/P45.html, retrieved 2013-03-19 .
  113. Brouwer, Andries E.; Van Maldeghem, Hendrik (2022). "8.2 Conference matrices and conference graphs". Strongly regular graphs. New Mathematical Monographs. 41. American Mathematical Society. pp. 189–190. ISBN 978-1-316-51203-6. https://homepages.cwi.nl/~aeb/math/srg/rk3/srgw.pdf. 
  114. Conway, John H., Five $1,000 Problems (Update 2017), Online Encyclopedia of Integer Sequences, https://oeis.org/A248380/a248380.pdf, retrieved 2019-02-12 
  115. mdevos; Wood, David (December 7, 2019), "Jorgensen's Conjecture", Open Problem Garden, http://www.openproblemgarden.org/op/jorgensens_conjecture, retrieved 2016-11-13 .
  116. Ducey, Joshua E. (2017), "On the critical group of the missing Moore graph", Discrete Mathematics 340 (5): 1104–1109, doi:10.1016/j.disc.2016.10.001 
  117. Blokhuis, A. (1988), "Geodetic graphs of diameter two", Geometriae Dedicata 25 (1–3): 527–533, doi:10.1007/BF00191941 
  118. Florek, Jan (2010), "On Barnette's conjecture", Discrete Mathematics 310 (10–11): 1531–1535, doi:10.1016/j.disc.2010.01.018 .
  119. Broersma, Hajo; Patel, Viresh; Pyatkin, Artem (2014), "On toughness and Hamiltonicity of $2K_2$-free graphs", Journal of Graph Theory 75 (3): 244–255, doi:10.1002/jgt.21734, https://ris.utwente.nl/ws/files/6416631/jgt21734.pdf 
  120. Jaeger, F. (1985), "A survey of the cycle double cover conjecture", Annals of Discrete Mathematics 27 – Cycles in Graphs, North-Holland Mathematics Studies, 27, pp. 1–12, doi:10.1016/S0304-0208(08)72993-1, ISBN 978-0-444-87803-8 .
  121. Heckman, Christopher Carl; Krakovski, Roi (2013), "Erdös-Gyárfás conjecture for cubic planar graphs", Electronic Journal of Combinatorics 20 (2): P7, doi:10.37236/3252 .
  122. Chudnovsky, Maria (2014), "The Erdös–Hajnal conjecture—a survey", Journal of Graph Theory 75 (2): 178–190, doi:10.1002/jgt.21730, http://www.columbia.edu/~mc2775/EHsurvey.pdf, retrieved 2016-09-22 .
  123. "Chords of longest circuits in locally planar graphs", European Journal of Combinatorics 28 (1): 315–321, 2007, doi:10.1016/j.ejc.2005.07.017 
  124. "Covering and packing in graphs. IV. Linear arboricity", Networks 11 (1): 69–72, 1981, doi:10.1002/net.3230110108 .
  125. Babai, László (June 9, 1994). "Automorphism groups, isomorphism, reconstruction" (PostScript). Handbook of Combinatorics. http://newtraell.cs.uchicago.edu/files/tr_authentic/TR-94-10.ps. 
  126. Lenz, Hanfried; Ringel, Gerhard (1991), "A brief review on Egmont Köhler's mathematical work", Discrete Mathematics 97 (1–3): 3–16, doi:10.1016/0012-365X(91)90416-Y 
  127. Fomin, Fedor V.; Høie, Kjartan (2006), "Pathwidth of cubic graphs and exact algorithms", Information Processing Letters 97 (5): 191–196, doi:10.1016/j.ipl.2005.10.012 
  128. Schwenk, Allen (2012). "Some History on the Reconstruction Conjecture". Joint Mathematics Meetings. http://faculty.nps.edu/rgera/conjectures/jmm2012/Schwenk,%20%20Some%20History%20on%20the%20RC.pdf. Retrieved 2018-11-26. 
  129. Ramachandran, S. (1981), "On a new digraph reconstruction conjecture", Journal of Combinatorial Theory, Series B 31 (2): 143–149, doi:10.1016/S0095-8956(81)80019-6 
  130. "A proof of Sumner's universal tournament conjecture for large tournaments", Proceedings of the London Mathematical Society, Third Series 102 (4): 731–766, 2011, doi:10.1112/plms/pdq035 .
  131. Tuza, Zsolt (1990). "A conjecture on triangles of graphs". Graphs and Combinatorics 6 (4): 373–380. doi:10.1007/BF01787705. 
  132. DeVos, Matthew (October 22, 2007), "Unfriendly partitions", Open problem garden, http://www.openproblemgarden.org/op/unfriendly_partitions 
  133. Brešar, Boštjan; Dorbec, Paul; Goddard, Wayne; Hartnell, Bert L.; Henning, Michael A.; Klavžar, Sandi; Rall, Douglas F. (2012), "Vizing's conjecture: a survey and recent results", Journal of Graph Theory 69 (1): 46–76, doi:10.1002/jgt.20565 .
  134. Bailey, R. F.; Stevens, B. (2010), "Hamiltonian decompositions of complete $k$-uniform hypergraphs", Discrete Mathematics 310 (22): 3088–3095, doi:10.1016/j.disc.2009.03.047, ISSN 0012-365X, https://www.sciencedirect.com/science/article/pii/S0012365X09001769 
  135. 135.0 135.1 135.2 135.3 135.4 Kitaev, Sergey; Lozin, Vadim (2015). Words and Graphs. Monographs in Theoretical Computer Science. An EATCS Series. doi:10.1007/978-3-319-25859-1. ISBN 978-3-319-25857-7. https://link.springer.com/book/10.1007/978-3-319-25859-1. 
  136. 136.0 136.1 136.2 136.3 136.4 Kitaev, Sergey (2017-05-16). "A Comprehensive Introduction to the Theory of Word-Representable Graphs" (in en). International Conference on Developments in Language Theory. doi:10.1007/978-3-319-62809-7_2. 
  137. 137.0 137.1 137.2 137.3 137.4 Kitaev, S. V.; Pyatkin, A. V. (April 1, 2018). "Word-Representable Graphs: a Survey". Journal of Applied and Industrial Mathematics 12 (2): 278–296. doi:10.1134/S1990478918020084. 
  138. 138.0 138.1 138.2 138.3 138.4 Kitaev, Sergey V.; Pyatkin, Artem V. (2018). "Графы, представимые в виде слов. Обзор результатов" (in ru). Дискретн. Анализ И Исслед. Опер. 25 (2): 19–53. doi:10.17377/daio.2018.25.588. http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=da&paperid=894&option_lang=rus. 
  139. Marc Elliot Glen (2016). "Colourability and word-representability of near-triangulations". arXiv:1605.01688 [math.CO].
  140. Kitaev, Sergey (2014-03-06). "On graphs with representation number 3". arXiv:1403.1616v1 [math.CO].
  141. Glen, Marc; Kitaev, Sergey; Pyatkin, Artem (2018). "On the representation number of a crown graph". Discrete Applied Mathematics 244: 89–93. doi:10.1016/j.dam.2018.03.013. https://www.sciencedirect.com/science/article/pii/S0166218X18301045. 
  142. Gurvich, V. (2011). "On exact blockers and anti-blockers, Δ-conjecture, and related problems". Discrete Applied Mathematics 159: 311–321. doi:10.1016/j.dam.2010.11.014. 
  143. Andrade, Diogo V.; Boros, Endre; Gurvich, Vladimir (2018). Goldengorin, Boris. ed. Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th Birthday. Springer Optimization and Its Applications 139. pp. 3–64. 
  144. Kozerenko, Sergiy; Skochko, Volodymyr (2014). "On graphs with graphic imbalance sequences". Algebra and Discrete Mathematics 18 (1): 97–108. https://www.researchgate.net/publication/289776294. 
  145. Spinrad, Jeremy P. (2003), "2. Implicit graph representation", Efficient Graph Representations, American Mathematical Soc., pp. 17–30, ISBN 978-0-8218-2815-1, https://books.google.com/books?id=RrtXSKMAmWgC&pg=PA17 .
  146. "Seymour's 2nd Neighborhood Conjecture". https://faculty.math.illinois.edu/~west/openp/2ndnbhd.html. 
  147. Teschner, Ulrich (1997). "New results about the bondage number of a graph". Discrete Mathematics 171 (1–3): 249–259. doi:10.1016/S0012-365X(96)00007-6. 
  148. mdevos (May 4, 2007). "5-flow conjecture". http://www.openproblemgarden.org/op/5_flow_conjecture. 
  149. mdevos (March 31, 2010). "4-flow conjecture". http://www.openproblemgarden.org/op/4_flow_conjecture. 
  150. Hrushovski, Ehud (1989). "Kueker's conjecture for stable theories". Journal of Symbolic Logic 54 (1): 207–220. doi:10.2307/2275025. 
  151. 151.0 151.1 151.2 Classification Theory. North-Holland. 1990. 
  152. Shelah, Saharon (2009). Classification theory for abstract elementary classes. College Publications. ISBN 978-1-904987-71-0. 
  153. Peretz, Assaf (2006). "Geometry of forking in simple theories". Journal of Symbolic Logic 71 (1): 347–359. doi:10.2178/jsl/1140641179. 
  154. Cherlin, Gregory; Shelah, Saharon (May 2007). "Universal graphs with a forbidden subtree". Journal of Combinatorial Theory. Series B 97 (3): 293–333. doi:10.1016/j.jctb.2006.05.008. 
  155. Džamonja, Mirna, "Club guessing and the universal models." On PCF, ed. M. Foreman, (Banff, Alberta, 2004).
  156. Shelah, Saharon (1999). "Borel sets with large squares". Fundamenta Mathematicae 159 (1): 1–50. doi:10.4064/fm-159-1-1-50. Bibcode1998math......2134S. 
  157. Baldwin, John T. (July 24, 2009). Categoricity. American Mathematical Society. ISBN 978-0-8218-4893-7. http://www.math.uic.edu/~jbaldwin/pub/AEClec.pdf. Retrieved February 20, 2014. 
  158. Shelah, Saharon (2009). "Introduction to classification theory for abstract elementary classes". arXiv:0903.3428 [math.LO].
  159. Gurevich, Yuri, "Monadic Second-Order Theories," in J. Barwise, S. Feferman, eds., Model-Theoretic Logics (New York: Springer-Verlag, 1985), 479–506.
  160. Makowsky J, "Compactness, embeddings and definability," in Model-Theoretic Logics, eds Barwise and Feferman, Springer 1985 pps. 645–715.
  161. Keisler, HJ (1967). "Ultraproducts which are not saturated". J. Symb. Log. 32 (1): 23–46. doi:10.2307/2271240. 
  162. Malliaris, Maryanthe; Shelah, Saharon (10 August 2012). "A Dividing Line Within Simple Unstable Theories". arXiv:1208.2140 [math.LO]. Malliaris, M.; Shelah, S. (2012). "A Dividing Line within Simple Unstable Theories". arXiv:1208.2140 [math.LO].
  163. "Proof-Theoretic Ordinal of ZFC or Consistent ZFC Extensions?" (in en). https://mathoverflow.net/questions/144041/proof-theoretic-ordinal-of-zfc-or-consistent-zfc-extensions. 
  164. Singmaster, David (1971), "Research Problems: How often does an integer occur as a binomial coefficient?", American Mathematical Monthly 78 (4): 385–386, doi:10.2307/2316907 .
  165. Guo, Song; Sun, Zhi-Wei (2005), "On odd covering systems with distinct moduli", Advances in Applied Mathematics 35 (2): 182–187, doi:10.1016/j.aam.2005.01.004 
  166. "Are the Digits of Pi Random? Berkeley Lab Researcher May Hold Key". http://www2.lbl.gov/Science-Articles/Archive/pi-random.html. 
  167. "Lectures on the Riemann zeta function (book review)", Bulletin of the American Mathematical Society 53 (3): 507–512, 2016, doi:10.1090/bull/1525 
  168. Unsolved Problems in Number Theory, Problem Books in Mathematics, 1 (2nd ed.), Springer-Verlag, 1991, pp. 181–185, doi:10.1007/978-1-4899-3585-4, ISBN 978-1-4899-3587-8 
  169. 169.0 169.1 Waldschmidt, Michel (2013), Diophantine Approximation on Linear Algebraic Groups: Transcendence Properties of the Exponential Function in Several Variables, Springer, pp. 14, 16, ISBN 978-3-662-11569-5, https://books.google.com/books?id=Wrj0CAAAQBAJ&pg=PA14 
  170. Waldschmidt, Michel (2008). "An introduction to irrationality and transcendence methods.". 2008 Arizona Winter School. https://webusers.imj-prg.fr/~michel.waldschmidt/articles/pdf/AWSLecture5.pdf. Retrieved 15 December 2014. 
  171. Albert, John, Some unsolved problems in number theory, http://www2.math.ou.edu/~jalbert/courses/openprob2.pdf, retrieved 15 December 2014 
  172. For some background on the numbers in this problem, see articles by Eric W. Weisstein at Wolfram MathWorld (all articles accessed 22 August 2024):
  173. 173.0 173.1 Waldschmidt, Michel (2003-12-24). "Open Diophantine Problems". arXiv:math/0312440.
  174. Kontsevich, Maxim; Zagier, Don (2001), Engquist, Björn; Schmid, Wilfried, eds., "Periods" (in en), Mathematics Unlimited — 2001 and Beyond (Berlin, Heidelberg: Springer): pp. 771–808, doi:10.1007/978-3-642-56478-9_39, ISBN 978-3-642-56478-9, https://link.springer.com/chapter/10.1007/978-3-642-56478-9_39, retrieved 2024-08-22 
  175. Weisstein, Eric W.. "Khinchin's Constant" (in en). https://mathworld.wolfram.com/KhinchinsConstant.html. 
  176. Aigner, Martin (2013), Markov's theorem and 100 years of the uniqueness conjecture, Cham: Springer, doi:10.1007/978-3-319-00888-2, ISBN 978-3-319-00887-5 
  177. Huisman, Sander G. (2016). "Newer sums of three cubes". arXiv:1604.07746 [math.NT].
  178. Dobson, J. B. (1 April 2017). "On Lerch's formula for the Fermat quotient". p. 23. arXiv:1103.3907v6 [math.NT].{{cite arXiv}}: CS1 maint: overridden setting (link)
  179. Ribenboim, P. (2006) (in de). Die Welt der Primzahlen. Springer-Lehrbuch (2nd ed.). Springer. pp. 242–243. doi:10.1007/978-3-642-18079-8. ISBN 978-3-642-18078-1. https://books.google.com/books?id=XMyzh-2SClUC&q=die+folgenden+probleme+sind+ungel%C3%B6st&pg=PA242. 
  180. Mazur, Barry (1992), "The topology of rational points", Experimental Mathematics 1 (1): 35–45, doi:10.1080/10586458.1992.10504244, https://projecteuclid.org/euclid.em/1048709114, retrieved 2019-04-07 
  181. "Quadrisecants of knots and links", Journal of Knot Theory and Its Ramifications 3: 41–50, 1994, doi:10.1142/S021821659400006X 
  182. Burklund, Robert; Hahn, Jeremy; Levy, Ishan; Schlank, Tomer (2023). "K-theoretic counterexamples to Ravenel's telescope conjecture". arXiv:2310.17459 [math.AT].
  183. Lisa Traynor (2024). "Eliashberg's contributions towards the theory of generating functions"
  184. Dimitrov, Vessilin; Gao, Ziyang; Habegger, Philipp (2021). "Uniformity in Mordell–Lang for curves". Annals of Mathematics 194: 237–298. doi:10.4007/annals.2021.194.1.4. https://hal.sorbonne-universite.fr/hal-03374335/file/Dimitrov%20et%20al.%20-%202021%20-%20Uniformity%20in%20Mordell%E2%80%93Lang%20for%20curves.pdf. 
  185. Guan, Qi'an; Zhou, Xiangyu (2015). "A solution of an L2 extension problem with optimal estimate and applications". Annals of Mathematics 181 (3): 1139–1208. doi:10.4007/annals.2015.181.3.6. 
  186. Merel, Loïc (1996). ""Bornes pour la torsion des courbes elliptiques sur les corps de nombres" [Bounds for the torsion of elliptic curves over number fields]". Inventiones Mathematicae 124 (1): 437–449. doi:10.1007/s002220050059. Bibcode1996InMat.124..437M. 
  187. Cohen, Stephen D.; Fried, Michael D. (1995), "Lenstra's proof of the Carlitz–Wan conjecture on exceptional polynomials: an elementary version", Finite Fields and Their Applications 1 (3): 372–375, doi:10.1006/ffta.1995.1027 
  188. Hartnett, Kevin (2025-08-01). "At 17, Hannah Cairo Solved a Major Math Mystery" (in en). https://www.quantamagazine.org/at-17-hannah-cairo-solved-a-major-math-mystery-20250801/. 
  189. Cairo, Hannah (2025). "A Counterexample to the Mizohata-Takeuchi Conjecture". arXiv:2502.06137 [math.CA].
  190. Casazza, Peter G.; Fickus, Matthew; Tremain, Janet C.; Weber, Eric (2006). "The Kadison-Singer problem in mathematics and engineering: A detailed account". in Han, Deguang; Jorgensen, Palle E. T.; Larson, David Royal. Large Deviations for Additive Functionals of Markov Chains: The 25th Great Plains Operator Theory Symposium, June 7–12, 2005, University of Central Florida, Florida. Contemporary Mathematics. 414. American Mathematical Society.. pp. 299–355. doi:10.1090/conm/414/07820. ISBN 978-0-8218-3923-2. https://books.google.com/books?id=9b-4uqEGJdoC&pg=PA299. Retrieved 24 April 2015. 
  191. Mackenzie, Dana. "Kadison–Singer Problem Solved". SIAM News (Society for Industrial and Applied Mathematics) (January/February 2014). https://www.siam.org/pdf/news/2123.pdf. 
  192. 192.0 192.1 Agol, Ian (2004). "Tameness of hyperbolic 3-manifolds". arXiv:math/0405568.
  193. Kurdyka, Krzysztof; Mostowski, Tadeusz; Parusiński, Adam (2000). "Proof of the gradient conjecture of R. Thom". Annals of Mathematics 152 (3): 763–792. doi:10.2307/2661354. 
  194. Moreira, Joel; Richter, Florian K.; Robertson, Donald (2019). "A proof of a sumset conjecture of Erdős" (in en-US). Annals of Mathematics 189 (2): 605–652. doi:10.4007/annals.2019.189.2.4. 
  195. Stanley, Richard P. (1994), "A survey of Eulerian posets", in Bisztriczky, T.; McMullen, P.; Schneider, R. et al., Polytopes: abstract, convex and computational (Scarborough, ON, 1993), NATO Advanced Science Institutes Series C: Mathematical and Physical Sciences, 440, Dordrecht: Kluwer Academic Publishers, pp. 301–333 . See in particular p. 316.
  196. Kalai, Gil (2018-12-25). "Amazing: Karim Adiprasito proved the g-conjecture for spheres!". https://gilkalai.wordpress.com/2018/12/25/amazing-karim-adiprasito-proved-the-g-conjecture-for-spheres/. 
  197. Santos, Franciscos (2012). "A counterexample to the Hirsch conjecture". Annals of Mathematics 176 (1): 383–412. doi:10.4007/annals.2012.176.1.7. 
  198. Ziegler, Günter M. (2012). "Who solved the Hirsch conjecture?". Documenta Mathematica. Documenta Mathematica Series 6 (Extra Volume "Optimization Stories"): 75–85. doi:10.4171/dms/6/13. ISBN 978-3-936609-58-5. https://www.math.uni-bielefeld.de/documenta/vol-ismp/22_ziegler-guenter.html. 
  199. Kauers, Manuel; Koutschan, Christoph; Zeilberger, Doron (2009-07-14). "Proof of Ira Gessel's lattice path conjecture". Proceedings of the National Academy of Sciences 106 (28): 11502–11505. doi:10.1073/pnas.0901678106. ISSN 0027-8424. Bibcode2009PNAS..10611502K. 
  200. Chung, Fan; Greene, Curtis; Hutchinson, Joan (April 2015). "Herbert S. Wilf (1931–2012)". Notices of the AMS 62 (4): 358. doi:10.1090/noti1247. ISSN 1088-9477. OCLC 34550461. "The conjecture was finally given an exceptionally elegant proof by A. Marcus and G. Tardos in 2004.". 
  201. Savchev, Svetoslav (2005). "Kemnitz' conjecture revisited". Discrete Mathematics 297 (1–3): 196–201. doi:10.1016/j.disc.2005.02.018. 
  202. Green, Ben (2004). "The Cameron–Erdős conjecture". The Bulletin of the London Mathematical Society 36 (6): 769–778. doi:10.1112/S0024609304003650. 
  203. "News from 2007". AMS. 31 December 2007. https://www.ams.org/news?news_id=155. "The 2007 prize also recognizes Green for "his many outstanding results including his resolution of the Cameron-Erdős conjecture..."" 
  204. Martí-Pete, David; Rempe, Lasse; Waterman, James (2025). "Eremenko's conjecture, wandering Lakes of Wada, and maverick points". Journal of the American Mathematical Society 38 (4): 877–918. doi:10.1090/jams/1049. 
  205. A bot will complete this citation soon. Click here to jump the queue arXiv:1710.02735.
  206. Xue, Jinxin (2014). "Noncollision Singularities in a Planar Four-body Problem". arXiv:1409.0048 [math.DS].
  207. Xue, Jinxin (2020). "Non-collision singularities in a planar 4-body problem". Acta Mathematica 224 (2): 253–388. doi:10.4310/ACTA.2020.v224.n2.a2. 
  208. Richard P Mann. "Known Historical Beggar-My-Neighbour Records". https://richardpmann.com/beggar-my-neighbour-records.html. 
  209. Bowditch, Brian H. (2006). "The angel game in the plane". School of Mathematics, University of Southampton: warwick.ac.uk Warwick University. http://homepages.warwick.ac.uk/~masgak/papers/bhb-angel.pdf. 
  210. Kloster, Oddvar. "A Solution to the Angel Problem". Oslo, Norway: SINTEF ICT. http://home.broadpark.no/~oddvark/angel/Angel.pdf. 
  211. Mathe, Andras (2007). "The Angel of power 2 wins". Combinatorics, Probability and Computing 16 (3): 363–374. doi:10.1017/S0963548306008303. http://homepages.warwick.ac.uk/~masibe/angel-mathe.pdf. Retrieved 2016-03-18. 
  212. Gacs, Peter (June 19, 2007). "THE ANGEL WINS". http://www.cs.bu.edu/~gacs/papers/angel.pdf. 
  213. Guilfoyle, B.; Klingenberg, W. (2025). "The three obdurate conjectures of differential geometry". Math. Proc. R. Ir. Acad. 125A: 9–17. doi:10.1353/mpr.2025.a968272. 
  214. Smith, David; Myers, Joseph Samuel; Kaplan, Craig S.; Goodman-Strauss, Chaim (2024). "An aperiodic monotile" (in en). Combinatorial Theory 4 (1). doi:10.5070/C64163843. ISSN 2766-1334. https://escholarship.org/uc/item/3317z9z9. 
  215. Larson, Eric (2017). "The Maximal Rank Conjecture". arXiv:1711.04906 [math.AG].
  216. Kerz, Moritz; Strunk, Florian; Tamme, Georg (2018), "Algebraic K-theory and descent for blow-ups", Inventiones Mathematicae 211 (2): 523–577, doi:10.1007/s00222-017-0752-2, Bibcode2018InMat.211..523K 
  217. Song, Antoine. "Existence of infinitely many minimal hypersurfaces in closed manifolds.". www.ams.org. https://www.ams.org/amsmtgs/2251_abstracts/1147-53-499.pdf. ""..I will present a solution of the conjecture, which builds on min-max methods developed by F. C. Marques and A. Neves.."" 
  218. "Antoine Song | Clay Mathematics Institute". https://www.claymath.org/people/antoine-song. ""...Building on work of Codá Marques and Neves, in 2018 Song proved Yau's conjecture in complete generality"" 
  219. Wolchover, Natalie (July 11, 2017), "Pentagon Tiling Proof Solves Century-Old Math Problem", Quanta Magazine, https://www.quantamagazine.org/pentagon-tiling-proof-solves-century-old-math-problem-20170711/, retrieved July 18, 2017 
  220. Marques, Fernando C.; Neves, André (2013). "Min-max theory and the Willmore conjecture". Annals of Mathematics 179 (2): 683–782. doi:10.4007/annals.2014.179.2.6. 
  221. Guth, Larry; Katz, Nets Hawk (2015). "On the Erdos distinct distance problem in the plane". Annals of Mathematics 181 (1): 155–190. doi:10.4007/annals.2015.181.1.2. 
  222. Henle, Frederick V.; Henle, James M.. "Squaring the Plane". maa.org Mathematics Association of America. http://www.ww.amc12.org/sites/default/files/pdf/pubs/SquaringThePlane.pdf. 
  223. Brock, Jeffrey F.; Canary, Richard D. (2012). "The classification of Kleinian surface groups, II: The Ending Lamination Conjecture". Annals of Mathematics 176 (1): 1–149. doi:10.4007/annals.2012.176.1.1. 
  224. "Straightening polygonal arcs and convexifying polygonal cycles", Discrete & Computational Geometry 30 (2): 205–239, 2003, doi:10.1007/s00454-003-0006-7, http://page.mi.fu-berlin.de/~rote/Papers/pdf/Straightening+polygonal+arcs+and+convexifying+polygonal+cycles-DCG.pdf 
  225. Faber, C.; Pandharipande, R. (2003), "Hodge integrals, partition matrices, and the λg conjecture", Ann. of Math., 2 157 (1): 97–124, doi:10.4007/annals.2003.157.97 
  226. Shestakov, Ivan P.; Umirbaev, Ualbai U. (2004). "The tame and the wild automorphisms of polynomial rings in three variables". Journal of the American Mathematical Society 17 (1): 197–227. doi:10.1090/S0894-0347-03-00440-5. 
  227. Hutchings, Michael; Morgan, Frank; Ritoré, Manuel; Ros, Antonio (2002). "Proof of the double bubble conjecture". Annals of Mathematics. Second Series 155 (2): 459–489. doi:10.2307/3062123. 
  228. "The Honeycomb Conjecture". Discrete & Computational Geometry 25: 1–22. 2001. doi:10.1007/s004540010071. 
  229. Teixidor i Bigas, Montserrat; Russo, Barbara (1999). "On a conjecture of Lange". Journal of Algebraic Geometry 8 (3): 483–496. ISSN 1056-3911. Bibcode1997alg.geom.10019R. 
  230. Ullmo, E (1998). "Positivité et Discrétion des Points Algébriques des Courbes". Annals of Mathematics 147 (1): 167–179. doi:10.2307/120987. 
  231. Zhang, S.-W. (1998). "Equidistribution of small points on abelian varieties". Annals of Mathematics 147 (1): 159–165. doi:10.2307/120986. 
  232. Hales, Thomas; Adams, Mark; Bauer, Gertrud; Dang, Dat Tat; Harrison, John; Hoang, Le Truong; Kaliszyk, Cezary; Magron, Victor et al. (2017). "A formal proof of the Kepler conjecture". Forum of Mathematics, Pi 5. doi:10.1017/fmp.2017.1. 
  233. Hales, Thomas C.; McLaughlin, Sean (2010). "The dodecahedral conjecture". Journal of the American Mathematical Society 23 (2): 299–344. doi:10.1090/S0894-0347-09-00647-X. Bibcode2010JAMS...23..299H. 
  234. Park, Jinyoung; Pham, Huy Tuan (2022-03-31). "A Proof of the Kahn-Kalai Conjecture". arXiv:2203.17207 [math.CO].
  235. "Stack-number is not bounded by queue-number". Combinatorica 42 (2): 151–164. August 2021. doi:10.1007/s00493-021-4585-7. 
  236. Huang, C.; Kotzig, A.; Rosa, A. (1982). "Further results on tree labellings". Utilitas Mathematica 21: 31–48. .
  237. Hartnett, Kevin (19 February 2020). "Rainbow Proof Shows Graphs Have Uniform Parts" (in en). https://www.quantamagazine.org/mathematicians-prove-ringels-graph-theory-conjecture-20200219/. 
  238. Shitov, Yaroslav (2019-09-01). "Counterexamples to Hedetniemi's conjecture". Annals of Mathematics 190 (2): 663–667. doi:10.4007/annals.2019.190.2.6. https://annals.math.princeton.edu/2019/190-2/p06. Retrieved 2021-07-19. 
  239. He, Dawei; Wang, Yan; Yu, Xingxing (2019-12-11). "The Kelmans-Seymour conjecture I: Special separations". Journal of Combinatorial Theory, Series B 144: 197–224. doi:10.1016/j.jctb.2019.11.008. ISSN 0095-8956. http://www.sciencedirect.com/science/article/pii/S0095895619301224. 
  240. He, Dawei; Wang, Yan; Yu, Xingxing (2019-12-11). "The Kelmans-Seymour conjecture II: 2-Vertices in K4−". Journal of Combinatorial Theory, Series B 144: 225–264. doi:10.1016/j.jctb.2019.11.007. ISSN 0095-8956. http://www.sciencedirect.com/science/article/pii/S0095895619301212. 
  241. He, Dawei; Wang, Yan; Yu, Xingxing (2019-12-09). "The Kelmans-Seymour conjecture III: 3-vertices in K4−". Journal of Combinatorial Theory, Series B 144: 265–308. doi:10.1016/j.jctb.2019.11.006. ISSN 0095-8956. http://www.sciencedirect.com/science/article/pii/S0095895619301200. 
  242. He, Dawei; Wang, Yan; Yu, Xingxing (2019-12-19). "The Kelmans-Seymour conjecture IV: A proof". Journal of Combinatorial Theory, Series B 144: 309–358. doi:10.1016/j.jctb.2019.12.002. ISSN 0095-8956. http://www.sciencedirect.com/science/article/pii/S0095895619301248. 
  243. Zang, Wenan; Jing, Guangming; Chen, Guantao (2019-01-29). "Proof of the Goldberg–Seymour Conjecture on Edge-Colorings of Multigraphs". arXiv:1901.10316v1 [math.CO].
  244. Abdollahi A., Zallaghi M. (2015). "Character sums for Cayley graphs". Communications in Algebra 43 (12): 5159–5167. doi:10.1080/00927872.2014.967398. 
  245. Huh, June (2012). "Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs". Journal of the American Mathematical Society 25 (3): 907–927. doi:10.1090/S0894-0347-2012-00731-0. 
  246. Chalopin, Jérémie; Gonçalves, Daniel (2009). "Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 – June 2, 2009". in Mitzenmacher, Michael. ACM. pp. 631–638. doi:10.1145/1536414.1536500. 
  247. "Menger's theorem for infinite graphs". Inventiones Mathematicae 176 (1): 1–62. 2009. doi:10.1007/s00222-008-0157-3. Bibcode2009InMat.176....1A. 
  248. Seigel-Itzkovich, Judy (2008-02-08). "Russian immigrant solves math puzzle". The Jerusalem Post. https://www.jpost.com/Home/Article.aspx?id=91431. 
  249. Diestel, Reinhard (2005). "Minors, Trees, and WQO". Graph Theory (Electronic Edition 2005 ed.). Springer. pp. 326–367. http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/preview/Ch12.pdf. 
  250. Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2002). "The strong perfect graph theorem". Annals of Mathematics 164: 51–229. doi:10.4007/annals.2006.164.51. Bibcode2002math.....12070C. https://annals.math.princeton.edu/2006/164-1/p02. 
  251. Klin, M. H., M. Muzychuk and R. Poschel: The isomorphism problem for circulant graphs via Schur ring theory, Codes and Association Schemes, American Math. Society, 2001.
  252. Chen, Zhibo (1996). "Harary's conjectures on integral sum graphs". Discrete Mathematics 160 (1–3): 241–244. doi:10.1016/0012-365X(95)00163-Q. https://www.researchgate.net/publication/220188021. 
  253. Friedman, Joel (January 2015). "Sheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture: with an Appendix by Warren Dicks" (in en). Memoirs of the American Mathematical Society 233 (1100): 0. doi:10.1090/memo/1100. ISSN 0065-9266. https://www.cs.ubc.ca/~jf/pubs/web_stuff/shnc_memoirs.pdf. 
  254. Mineyev, Igor (2012). "Submultiplicativity and the Hanna Neumann conjecture". Annals of Mathematics. Second Series 175 (1): 393–414. doi:10.4007/annals.2012.175.1.11. 
  255. Namazi, Hossein; Souto, Juan (2012). "Non-realizability and ending laminations: Proof of the density conjecture". Acta Mathematica 209 (2): 323–395. doi:10.1007/s11511-012-0088-0. https://www.researchgate.net/publication/228365532. 
  256. Pila, Jonathan; Shankar, Ananth; Tsimerman, Jacob; Esnault, Hélène; Groechenig, Michael (2021-09-17). "Canonical Heights on Shimura Varieties and the André-Oort Conjecture". arXiv:2109.08788 [math.NT].
  257. Bourgain, Jean; Ciprian, Demeter; Larry, Guth (2015). "Proof of the main conjecture in Vinogradov's Mean Value Theorem for degrees higher than three". Annals of Mathematics 184 (2): 633–682. doi:10.4007/annals.2016.184.2.7. Bibcode2015arXiv151201565B. 
  258. Helfgott, Harald A. (2013). "Major arcs for Goldbach's theorem". arXiv:1305.2897 [math.NT].
  259. Helfgott, Harald A. (2012). "Minor arcs for Goldbach's problem". arXiv:1205.5252 [math.NT].
  260. Helfgott, Harald A. (2013). "The ternary Goldbach conjecture is true". arXiv:1312.7748 [math.NT].
  261. Zhang, Yitang (2014-05-01). "Bounded gaps between primes". Annals of Mathematics 179 (3): 1121–1174. doi:10.4007/annals.2014.179.3.7. ISSN 0003-486X. 
  262. "Bounded gaps between primes – Polymath Wiki". https://asone.ai/polymath/index.php?title=Bounded_gaps_between_primes. 
  263. Maynard, James (2015-01-01). "Small gaps between primes". Annals of Mathematics: 383–413. doi:10.4007/annals.2015.181.1.7. ISSN 0003-486X. 
  264. Cilleruelo, Javier (2010). "Generalized Sidon sets". Advances in Mathematics 225 (5): 2786–2807. doi:10.1016/j.aim.2010.05.010. 
  265. Khare, Chandrashekhar; Wintenberger, Jean-Pierre (2009), "Serre's modularity conjecture (I)", Inventiones Mathematicae 178 (3): 485–504, doi:10.1007/s00222-009-0205-7, Bibcode2009InMat.178..485K 
  266. Khare, Chandrashekhar; Wintenberger, Jean-Pierre (2009), "Serre's modularity conjecture (II)", Inventiones Mathematicae 178 (3): 505–586, doi:10.1007/s00222-009-0206-6, Bibcode2009InMat.178..505K 
  267. "2011 Cole Prize in Number Theory". Notices of the AMS 58 (4): 610–611. ISSN 1088-9477. OCLC 34550461. https://www.ams.org/notices/201104/rtx110400610p.pdf. Retrieved 2015-11-12. 
  268. "Bombieri and Tao Receive King Faisal Prize". Notices of the AMS 57 (5): 642–643. May 2010. ISSN 1088-9477. OCLC 34550461. https://www.ams.org/notices/201005/rtx100500642p.pdf. Retrieved 2016-03-18. "Working with Ben Green, he proved there are arbitrarily long arithmetic progressions of prime numbers—a result now known as the Green–Tao theorem.". 
  269. Metsänkylä, Tauno (5 September 2003). "Catalan's conjecture: another old diophantine problem solved". Bulletin of the American Mathematical Society 41 (1): 43–57. doi:10.1090/s0273-0979-03-00993-5. ISSN 0273-0979. https://www.ams.org/journals/bull/2004-41-01/S0273-0979-03-00993-5/S0273-0979-03-00993-5.pdf. Retrieved 13 November 2015. "The conjecture, which dates back to 1844, was recently proven by the Swiss mathematician Preda Mihăilescu.". 
  270. Croot, Ernest S. III (2000). Unit Fractions. Ph.D. thesis. University of Georgia, Athens.  Croot, Ernest S. III (2003). "On a coloring conjecture about unit fractions". Annals of Mathematics 157 (2): 545–556. doi:10.4007/annals.2003.157.545. Bibcode2003math.....11421C. 
  271. Lafforgue, Laurent (1998), "Chtoucas de Drinfeld et applications" (in fr), Documenta Mathematica II: 563–570, ISSN 1431-0635, http://www.math.uni-bielefeld.de/documenta/xvol-icm/07/Lafforgue.MAN.html, retrieved 2016-03-18 
  272. Wiles, Andrew (1995). "Modular elliptic curves and Fermat's Last Theorem". Annals of Mathematics 141 (3): 443–551. doi:10.2307/2118559. OCLC 37032255. http://math.stanford.edu/~lekheng/flt/wiles.pdf. Retrieved 2016-03-06. 
  273. Taylor R, Wiles A (1995). "Ring theoretic properties of certain Hecke algebras". Annals of Mathematics 141 (3): 553–572. doi:10.2307/2118560. OCLC 37032255. http://www.math.harvard.edu/~rtaylor/hecke.ps. 
  274. Lee, Choongbum (2017). "Ramsey numbers of degenerate graphs". Annals of Mathematics 185 (3): 791–829. doi:10.4007/annals.2017.185.3.2. 
  275. Lamb, Evelyn (26 May 2016). "Two-hundred-terabyte maths proof is largest ever". Nature 534 (7605): 17–18. doi:10.1038/nature.2016.19990. PMID 27251254. Bibcode2016Natur.534...17L. 
  276. "Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer". Theory and Applications of Satisfiability Testing – SAT 2016. Lecture Notes in Computer Science. 9710. Springer, [Cham]. 2016. pp. 228–245. doi:10.1007/978-3-319-40970-2_15. ISBN 978-3-319-40969-6. 
  277. Linkletter, David (27 December 2019). "The 10 Biggest Math Breakthroughs of 2019". Popular Mechanics. https://www.popularmechanics.com/science/math/g30346822/biggest-math-breakthroughs-2019/. 
  278. Piccirillo, Lisa (2020). "The Conway knot is not slice". Annals of Mathematics 191 (2): 581–591. doi:10.4007/annals.2020.191.2.5. https://annals.math.princeton.edu/2020/191-2/p05. 
  279. Klarreich, Erica (2020-05-19). "Graduate Student Solves Decades-Old Conway Knot Problem" (in en). https://www.quantamagazine.org/graduate-student-solves-decades-old-conway-knot-problem-20200519/. 
  280. Agol, Ian (2013). "The virtual Haken conjecture (with an appendix by Ian Agol, Daniel Groves, and Jason Manning)". Documenta Mathematica 18: 1045–1087. doi:10.4171/dm/421. https://www.math.uni-bielefeld.de/documenta/vol-18/33.pdf. 
  281. "Embedded minimal tori in S3 and the Lawson conjecture". Acta Mathematica 211 (2): 177–190. 2013. doi:10.1007/s11511-013-0101-2. 
  282. "The good pants homology and the Ehrenpreis conjecture". Annals of Mathematics 182 (1): 1–72. 2015. doi:10.4007/annals.2015.182.1.1. 
  283. Austin, Tim (December 2013). "Rational group ring elements with kernels having irrational dimension". Proceedings of the London Mathematical Society 107 (6): 1424–1448. doi:10.1112/plms/pdt029. Bibcode2009arXiv0909.2360A. 
  284. Lurie, Jacob (2009). "On the classification of topological field theories". Current Developments in Mathematics 2008: 129–280. doi:10.4310/cdm.2008.v2008.n1.a3. Bibcode2009arXiv0905.0465L. 
  285. 285.0 285.1 "Prize for Resolution of the Poincaré Conjecture Awarded to Dr. Grigoriy Perelman" (PDF) (Press release). Clay Mathematics Institute. March 18, 2010. Archived from the original on March 22, 2010. Retrieved November 13, 2015. The Clay Mathematics Institute hereby awards the Millennium Prize for resolution of the Poincaré conjecture to Grigoriy Perelman.
  286. Morgan, John; Tian, Gang (2008). "Completion of the Proof of the Geometrization Conjecture". arXiv:0809.4040 [math.DG].
  287. "Nikiel's Conjecture". Topology and Its Applications 116 (3): 305–331. 2001. doi:10.1016/S0166-8641(01)00218-8. 
  288. Norio Iwase (1 November 1998). "Ganea's Conjecture on Lusternik-Schnirelmann Category". ResearchGate. https://www.researchgate.net/publication/220032558. 
  289. Tao, Terence (2015). "The Erdős discrepancy problem". arXiv:1509.05363v5 [math.CO].
  290. Duncan, John F. R.; Griffin, Michael J.; Ono, Ken (1 December 2015). "Proof of the umbral moonshine conjecture". Research in the Mathematical Sciences 2 (1): 26. doi:10.1186/s40687-015-0044-7. Bibcode2015arXiv150301472D. 
  291. Cheeger, Jeff; Naber, Aaron (2015). "Regularity of Einstein Manifolds and the Codimension 4 Conjecture". Annals of Mathematics 182 (3): 1093–1165. doi:10.4007/annals.2015.182.3.5. 
  292. Wolchover, Natalie (March 28, 2017). "A Long-Sought Proof, Found and Almost Lost". Quanta Magazine. https://www.quantamagazine.org/20170328-statistician-proves-gaussian-correlation-inequality/. Retrieved May 2, 2017. 
  293. Newman, Alantha; Nikolov, Aleksandar (2011). "A counterexample to Beck's conjecture on the discrepancy of three permutations". arXiv:1104.2922 [cs.DM].
  294. Voevodsky, Vladimir (1 July 2011). "On motivic cohomology with Z/l-coefficients". Princeton, NJ: Princeton University. pp. 401–438. https://annals.math.princeton.edu/wp-content/uploads/annals-v174-n1-p11-p.pdf. 
  295. Geisser, Thomas; Levine, Marc (2001). "The Bloch-Kato conjecture and a theorem of Suslin-Voevodsky". Journal für die Reine und Angewandte Mathematik 2001 (530): 55–103. doi:10.1515/crll.2001.006. 
  296. Kahn, Bruno. "Algebraic K-Theory, Algebraic Cycles and Arithmetic Geometry". https://webusers.imj-prg.fr/~bruno.kahn/preprints/kcag.pdf. 
  297. "motivic cohomology – Milnor–Bloch–Kato conjecture implies the Beilinson-Lichtenbaum conjecture – MathOverflow". https://mathoverflow.net/q/87162. 
  298. Mattman, Thomas W.; Solis, Pablo (2009). "A proof of the Kauffman-Harary Conjecture". Algebraic & Geometric Topology 9 (4): 2027–2039. doi:10.2140/agt.2009.9.2027. Bibcode2009arXiv0906.1612M. 
  299. Kahn, Jeremy; Markovic, Vladimir (2012). "Immersing almost geodesic surfaces in a closed hyperbolic three manifold". Annals of Mathematics 175 (3): 1127–1190. doi:10.4007/annals.2012.175.3.4. 
  300. Lu, Zhiqin (September 2011). "Normal Scalar Curvature Conjecture and its applications". Journal of Functional Analysis 261 (5): 1284–1308. doi:10.1016/j.jfa.2011.05.002. 
  301. Dencker, Nils (2006), "The resolution of the Nirenberg–Treves conjecture", Annals of Mathematics 163 (2): 405–444, doi:10.4007/annals.2006.163.405, https://annals.math.princeton.edu/wp-content/uploads/annals-v163-n2-p02.pdf, retrieved 2019-04-07 
  302. "Research Awards". https://www.claymath.org/research. 
  303. Lewis, A. S.; Parrilo, P. A.; Ramana, M. V. (2005). "The Lax conjecture is true". Proceedings of the American Mathematical Society 133 (9): 2495–2499. doi:10.1090/S0002-9939-05-07752-X. 
  304. "Fields Medal – Ngô Bảo Châu". ICM. 19 August 2010. http://www.icm2010.in/prize-winners-2010/fields-medal-ngo-bao-chau. "Ngô Bảo Châu is being awarded the 2010 Fields Medal for his proof of the Fundamental Lemma in the theory of automorphic forms through the introduction of new algebro-geometric methods." 
  305. Voevodsky, Vladimir (2003). "Reduced power operations in motivic cohomology". Publications Mathématiques de l'IHÉS 98: 1–57. doi:10.1007/s10240-003-0009-z. http://archive.numdam.org/item/PMIHES_2003__98__1_0/. Retrieved 2016-03-18. 
  306. Baruch, Ehud Moshe (2003). "A proof of Kirillov's conjecture". Annals of Mathematics. Second Series 158 (1): 207–252. doi:10.4007/annals.2003.158.207. 
  307. Haas, Bertrand (2002). "A Simple Counterexample to Kouchnirenko's Conjecture". Beiträge zur Algebra und Geometrie 43 (1): 1–8. https://www.emis.de/journals/BAG/vol.43/no.1/b43h1haa.pdf. Retrieved 2016-03-18. 
  308. Haiman, Mark (2001). "Hilbert schemes, polygraphs and the Macdonald positivity conjecture". Journal of the American Mathematical Society 14 (4): 941–1006. doi:10.1090/S0894-0347-01-00373-3. 
  309. Auscher, Pascal; Hofmann, Steve; Lacey, Michael; McIntosh, Alan; Tchamitchian, Ph. (2002). "The solution of the Kato square root problem for second order elliptic operators on n". Annals of Mathematics. Second Series 156 (2): 633–654. doi:10.2307/3597201. 
  310. Barbieri-Viale, Luca; Rosenschon, Andreas; Saito, Morihiko (2003). "Deligne's Conjecture on 1-Motives". Annals of Mathematics 158 (2): 593–633. doi:10.4007/annals.2003.158.593. 
  311. Breuil, Christophe; Conrad, Brian; Diamond, Fred; Taylor, Richard (2001), "On the modularity of elliptic curves over Q: wild 3-adic exercises", Journal of the American Mathematical Society 14 (4): 843–939, doi:10.1090/S0894-0347-01-00370-8, ISSN 0894-0347 
  312. Luca, Florian (2000). "On a conjecture of Erdős and Stewart". Mathematics of Computation 70 (234): 893–897. doi:10.1090/s0025-5718-00-01178-9. Bibcode2001MaCom..70..893L. https://www.ams.org/journals/mcom/2001-70-234/S0025-5718-00-01178-9/S0025-5718-00-01178-9.pdf. Retrieved 2016-03-18. 
  313. "The geometry of classical particles". Papers dedicated to Atiyah, Bott, Hirzebruch, and Singer. Surveys in Differential Geometry. 7. Somerville, Massachusetts: International Press. 2000. pp. 1–15. doi:10.4310/SDG.2002.v7.n1.a1. 

Further reading

Books discussing problems solved since 1995

Books discussing unsolved problems