List of unsolved problems in mathematics

Template:Pp Template:Short description Template:CS1 config {{#invoke:Hatnote|hatnote}}{{#ifeq:||}}

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.

Lists of unsolved problems in mathematics

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
Hilbert's problems<ref>Template:Citation</ref>	23	15	David Hilbert	1900
Landau's problems<ref>Template:Citation.</ref>	4	4	Edmund Landau	1912
Taniyama's problems<ref>Template:Cite journal</ref>	36	–	Yutaka Taniyama	1955
Thurston's 24 questions<ref>Template:Cite journal</ref><ref>Template:Cite journal</ref>	24	2	William Thurston	1982
Smale's problems	18	14	Stephen Smale	1998
Millennium Prize Problems	7	citation	CitationClass=web }}</ref>|| Clay Mathematics Institute || 2000
Simon problems	15	citation	CitationClass=web }}</ref><ref name="guardian">{{#invoke:citation/CS1|citation	CitationClass=web }}</ref> || Barry Simon || 2000
Unsolved Problems on Mathematics for the 21st Century<ref>Template:Cite book</ref>	22	–	Jair Minoro Abe, Shotaro Tanaka	2001
DARPA's math challenges<ref>{{#invoke:citation/CS1|citation	CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation	CitationClass=web }}</ref> || 23 || – || DARPA || 2007
Erdős's problems<ref>{{#invoke:citation/CS1|citation	CitationClass=web }}</ref> || > 934 || 617 || Paul Erdős || Over six decades of Erdős' career, from the 1930s to 1990s

File:Riemann-Zeta-Func.png

CitationClass=web }}</ref>

Millennium Prize Problems

Of the original seven Millennium Prize Problems listed by the Clay Mathematics Institute in 2000, six remain unsolved to date:<ref name="auto1"/>

• Birch and Swinnerton-Dyer conjecture
• Hodge conjecture
• Navier–Stokes existence and smoothness
• P versus NP
• Riemann hypothesis
• Yang–Mills existence and mass gap

The seventh problem, the Poincaré conjecture, was solved by Grigori Perelman in 2003.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> 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.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

Notebooks

• The Kourovka Notebook (Template:Langx) is a collection of unsolved problems in group theory, first published in 1965 and updated many times since.<ref>Template:Citation</ref>
• The Sverdlovsk Notebook (Template:Langx) is a collection of unsolved problems in semigroup theory, first published in 1965 and updated every 2 to 4 years since.<ref>Template:Cite book</ref><ref>Template:Cite book</ref><ref>Template:Cite book</ref>
• The Dniester Notebook (Template:Langx) lists several hundred unsolved problems in algebra, particularly ring theory and modulus theory.<ref>Template:Citation</ref><ref>Template:Citation</ref>
• The Erlagol Notebook (Template:Langx) lists unsolved problems in algebra and model theory.<ref>Template:Citation</ref>

Unsolved problems

Algebra

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

File:Regular tetrahedron inscribed in a sphere.svg

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.

• Birch–Tate conjecture on the relation between the order of the center of the Steinberg group of the ring of integers of a number field to the field's Dedekind zeta function.
• Bombieri–Lang conjectures on densities of rational points of algebraic surfaces and algebraic varieties defined on number fields and their field extensions.
• Connes embedding problem in Von Neumann algebra theory
• Crouzeix's conjecture: the matrix norm of a complex function <math>f</math> applied to a complex matrix <math>A</math> is at most twice the supremum of <math>|f(z)|</math> over the field of values of <math>A</math>.
• Determinantal conjecture on the determinant of the sum of two normal matrices.
• Eilenberg–Ganea conjecture: a group with cohomological dimension 2 also has a 2-dimensional Eilenberg–MacLane space <math>K(G, 1)</math>.
• Farrell–Jones conjecture on whether certain assembly maps are isomorphisms.
  • Bost conjecture: a specific case of the Farrell–Jones conjecture
• Finite lattice representation problem: is every finite lattice isomorphic to the congruence lattice of some finite algebra?<ref>Template:Cite journal</ref>
• Goncharov conjecture on the cohomology of certain motivic complexes.
• Green's conjecture: the Clifford index of a non-hyperelliptic curve is determined by the extent to which it, as a canonical curve, has linear syzygies.
• Grothendieck–Katz p-curvature conjecture: a conjectured local–global principle for linear ordinary differential equations.
• Hadamard conjecture: for every positive integer <math>k</math>, a Hadamard matrix of order <math>4k</math> exists.
  • Williamson conjecture: the problem of finding Williamson matrices, which can be used to construct Hadamard matrices.
• Hadamard's maximal determinant problem: what is the largest determinant of a matrix with entries all equal to 1 or −1?
• Hilbert's fifteenth problem: put Schubert calculus on a rigorous foundation.
• Hilbert's sixteenth problem: what are the possible configurations of the connected components of M-curves?
• Homological conjectures in commutative algebra
• Jacobson's conjecture: the intersection of all powers of the Jacobson radical of a left-and-right Noetherian ring is precisely 0.
• Kaplansky's conjectures
• Köthe conjecture: if a ring has no nil ideal other than <math>\{0\}</math>, then it has no nil one-sided ideal other than <math>\{0\}</math>.
• Monomial conjecture on Noetherian local rings
• Existence of perfect cuboids and associated cuboid conjectures
• Pierce–Birkhoff conjecture: every piecewise-polynomial <math>f:\mathbb{R}^{n}\rightarrow\mathbb{R}</math> is the maximum of a finite set of minimums of finite collections of polynomials.
• Rota's basis conjecture: for matroids of rank <math>n</math> with <math>n</math> disjoint bases <math>B_{i}</math>, it is possible to create an <math>n \times n</math> matrix whose rows are <math>B_{i}</math> and whose columns are also bases.
• Serre's conjecture II: if <math>G</math> is a simply connected semisimple algebraic group over a perfect field of cohomological dimension at most <math>2</math>, then the Galois cohomology set <math>H^{1}(F, G)</math> is zero.
• Serre's positivity conjecture that if <math>R</math> is a commutative regular local ring, and <math>P, Q</math> are prime ideals of <math>R</math>, then <math>\dim (R/P) + \dim (R/Q) = \dim (R)</math> implies <math>\chi(R/P, R/Q) > 0</math>.
• Uniform boundedness conjecture for rational points: do algebraic curves of genus <math>g \geq 2</math> over number fields <math>K</math> have at most some bounded number <math>N(K, g)</math> of <math>K</math>-rational points?
• Wild problems: problems involving classification of pairs of <math>n\times n</math> matrices under simultaneous conjugation.
• Zariski–Lipman conjecture: for a complex algebraic variety <math>V</math> with coordinate ring <math>R</math>, if the derivations of <math>R</math> are a free module over <math>R</math>, then <math>V</math> is smooth.
• Zauner's conjecture: do SIC-POVMs exist in all dimensions?
• Zilber–Pink conjecture that if <math>X</math> is a mixed Shimura variety or semiabelian variety defined over <math>\mathbb{C}</math>, and <math>V \subseteq X</math> is a subvariety, then <math>V</math> contains only finitely many atypical subvarieties.

Group theory

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

File:FreeBurnsideGroupExp3Gens2.png

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

• Andrews–Curtis conjecture: every balanced presentation of the trivial group can be transformed into a trivial presentation by a sequence of Nielsen transformations on relators and conjugations of relators
• Bounded Burnside problem: for which positive integers m, n is the free Burnside group Template:Nowrap finite? In particular, is Template:Nowrap finite?
• Guralnick–Thompson conjecture on the composition factors of groups in genus-0 systems<ref>Template:Citation</ref>
• Herzog–Schönheim conjecture: if a finite system of left cosets of subgroups of a group <math>G</math> form a partition of <math>G</math>, then the finite indices of said subgroups cannot be distinct.
• The inverse Galois problem: is every finite group the Galois group of a Galois extension of the rationals?
• Isomorphism problem of Coxeter groups
• Are there an infinite number of Leinster groups?
• Does generalized moonshine exist?
• Is every finitely presented periodic group finite?
• Is every group surjunctive?
• Is every discrete, countable group sofic?
• Problems in loop theory and quasigroup theory consider generalizations of groups

Representation theory

• Arthur's conjectures
• Dade's conjecture relating the numbers of characters of blocks of a finite group to the numbers of characters of blocks of local subgroups.
• Demazure conjecture on representations of algebraic groups over the integers.
• Kazhdan–Lusztig conjectures relating the values of the Kazhdan–Lusztig polynomials at 1 with representations of complex semisimple Lie groups and Lie algebras.
• McKay conjecture: in a group <math>G</math>, the number of irreducible complex characters of degree not divisible by a prime number <math>p</math> is equal to the number of irreducible complex characters of the normalizer of any Sylow <math>p</math>-subgroup within <math>G</math>.

Analysis

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• The Brennan conjecture: estimating the integral of powers of the moduli of the derivative of conformal maps into the open unit disk, on certain subsets of <math>\mathbb{C}</math>
• Fuglede's conjecture on whether nonconvex sets in <math>\mathbb{R}</math> and <math>\mathbb{R}^{2}</math> are spectral if and only if they tile by translation.
• Goodman's conjecture on the coefficients of multivalued functions
• Invariant subspace problem – does every bounded operator on a complex Banach space send some non-trivial closed subspace to itself?
• Kung–Traub conjecture on the optimal order of a multipoint iteration without memory<ref>Template:Citation</ref>
• Lehmer's conjecture on the Mahler measure of non-cyclotomic polynomials<ref>Template:Citation</ref>
• The mean value problem: given a complex polynomial <math>f</math> of degree <math>d \ge 2</math> and a complex number <math>z</math>, is there a critical point <math>c</math> of <math>f</math> such that <math>|f(z)-f(c)| \le |f'(z)||z-c|</math>?
• The Pompeiu problem on the topology of domains for which some nonzero function has integrals that vanish over every congruent copy<ref>Template:SpringerEOM</ref>
• Sendov's conjecture: if a complex polynomial with degree at least <math>2</math> has all roots in the closed unit disk, then each root is within distance <math>1</math> from some critical point.
• Vitushkin's conjecture on compact subsets of <math>\mathbb{C}</math> with analytic capacity <math>0</math>
• What is the exact value of Landau's constants, including Bloch's constant?

• Regularity of solutions of Euler equations
• Convergence of Flint Hills series
• Regularity of solutions of Vlasov–Maxwell equations

Combinatorics

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• 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?<ref>Template:Citation.</ref>
• 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 <math>k</math> runners with pairwise distinct speeds run round a track of unit length, will every runner be "lonely" (that is, be at least a distance <math>1/k</math> from each other runner) at some time?<ref>Template:Cite journal</ref>
• Map folding – various problems in map folding and stamp folding.
• No-three-in-line problem – how many points can be placed in the <math>n \times n</math> grid so that no three of them lie on a line?
• Rudin's conjecture on the number of squares in finite arithmetic progressions<ref>Template:Cite journal</ref>
• The sunflower conjecture – can the number of <math>k</math> size sets required for the existence of a sunflower of <math>r</math> sets be bounded by an exponential function in <math>k</math> for every fixed <math>r>2</math>?
• 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<ref>Template:Citation</ref>

• Give a combinatorial interpretation of the Kronecker coefficients<ref>Template:Citation</ref>
• The values of the Dedekind numbers <math>M(n)</math> for <math>n \ge 10</math><ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• The values of the Ramsey numbers, particularly <math>R(5, 5)</math>
• The values of the Van der Waerden numbers
• Finding a function to model n-step self-avoiding walks<ref>Template:Cite journal</ref>

Dynamical systems

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

File:Mandel zoom 07 satellite.jpg

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

• Arnold–Givental conjecture and Arnold conjecture – relating symplectic geometry to Morse theory.
• Berry–Tabor conjecture in quantum chaos
• Banach's problem – is there an ergodic system with simple Lebesgue spectrum?<ref>S. M. Ulam, Problems in Modern Mathematics. Science Editions John Wiley & Sons, Inc., New York, 1964, page 76.</ref>
• Birkhoff conjecture – if a billiard table is strictly convex and integrable, is its boundary necessarily an ellipse?<ref>Template:Cite journal</ref>
• Collatz conjecture (also known as the <math>3n + 1</math> conjecture)
• Eden's conjecture that the supremum of the local Lyapunov dimensions on the global attractor is achieved on a stationary point or an unstable periodic orbit embedded into the attractor.
• Eremenko's conjecture: every component of the escaping set of an entire transcendental function is unbounded.
• Fatou conjecture that a quadratic family of maps from the complex plane to itself is hyperbolic for an open dense set of parameters.
• Furstenberg conjecture – is every invariant and ergodic measure for the <math>\times 2,\times 3</math> action on the circle either Lebesgue or atomic?
• Kaplan–Yorke conjecture on the dimension of an attractor in terms of its Lyapunov exponents
• Margulis conjecture – measure classification for diagonalizable actions in higher-rank groups.
• Hilbert–Arnold problem – is there a uniform bound on limit cycles in generic finite-parameter families of vector fields on a sphere?
• MLC conjecture – is the Mandelbrot set locally connected?
• Many problems concerning an outer billiard, for example showing that outer billiards relative to almost every convex polygon have unbounded orbits.
• Quantum unique ergodicity conjecture on the distribution of large-frequency eigenfunctions of the Laplacian on a negatively-curved manifold<ref>Template:Citation</ref>
• Rokhlin's multiple mixing problem – are all strongly mixing systems also strongly 3-mixing?<ref>Paul Halmos, Ergodic theory. Chelsea, New York, 1956.</ref>
• Weinstein conjecture – does a regular compact contact type level set of a Hamiltonian on a symplectic manifold carry at least one periodic orbit of the Hamiltonian flow?

• Does every positive integer generate a juggler sequence terminating at 1?
• Lyapunov function: Lyapunov's second method for stability – For what classes of ODEs, describing dynamical systems, does Lyapunov's second method, formulated in the classical and canonically generalized forms, define the necessary and sufficient conditions for the (asymptotical) stability of motion?
• Is every reversible cellular automaton in three or more dimensions locally reversible?<ref>Template:Cite conference</ref>

Games and puzzles

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Combinatorial games

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Sudoku:
  • How many puzzles have exactly one solution?<ref name="openq"/>
  • How many puzzles with exactly one solution are minimal?<ref name="openq"/>
  • What is the maximum number of givens for a minimal puzzle?<ref name="openq">{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• 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 n^d game)<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• 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?
• 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

• Rendezvous problem

Geometry

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Algebraic geometry

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Abundance conjecture: if the canonical bundle of a projective variety with Kawamata log terminal singularities is nef, then it is semiample.
• Bass conjecture on the finite generation of certain algebraic K-groups.
• Bass–Quillen conjecture relating vector bundles over a regular Noetherian ring and over the polynomial ring <math>A[t_{1}, \ldots, t_{n}]</math>.
• Deligne conjecture: any one of numerous named for Pierre Deligne.
  • Deligne's conjecture on Hochschild cohomology about the operadic structure on Hochschild cochain complex.
• Dixmier conjecture: any endomorphism of a Weyl algebra is an automorphism.
• Fröberg conjecture on the Hilbert functions of a set of forms.
• Fujita conjecture regarding the line bundle <math>K_{M} \otimes L^{\otimes m}</math> constructed from a positive holomorphic line bundle <math>L</math> on a compact complex manifold <math>M</math> and the canonical line bundle <math>K_{M}</math> of <math>M</math>
• General elephant problem: do general elephants have at most Du Val singularities?
• Hartshorne's conjectures<ref>Template:Cite journal</ref>
• In spherical or hyperbolic geometry, must polyhedra with the same volume and Dehn invariant be scissors-congruent?<ref>Template:Citation.</ref>
• Jacobian conjecture: if a polynomial mapping over a characteristic-0 field has a constant nonzero Jacobian determinant, then it has a regular (i.e. with polynomial components) inverse function.
• Manin conjecture on the distribution of rational points of bounded height in certain subsets of Fano varieties
• Maulik–Nekrasov–Okounkov–Pandharipande conjecture on an equivalence between Gromov–Witten theory and Donaldson–Thomas theory<ref>Template:Citation</ref>
• Nagata's conjecture on curves, specifically the minimal degree required for a plane algebraic curve to pass through a collection of very general points with prescribed multiplicities.
• Nagata–Biran conjecture that if <math>X</math> is a smooth algebraic surface and <math>L</math> is an ample line bundle on <math>X</math> of degree <math>d</math>, then for sufficiently large <math>r</math>, the Seshadri constant satisfies <math>\varepsilon(p_1,\ldots,p_r;X,L) = d/\sqrt{r}</math>.
• Nakai conjecture: if a complex algebraic variety has a ring of differential operators generated by its contained derivations, then it must be smooth.
• Parshin's conjecture: the higher algebraic K-groups of any smooth projective variety defined over a finite field must vanish up to torsion.
• Section conjecture on splittings of group homomorphisms from fundamental groups of complete smooth curves over finitely-generated fields <math>k</math> to the Galois group of <math>k</math>.
• Standard conjectures on algebraic cycles
• Tate conjecture on the connection between algebraic cycles on algebraic varieties and Galois representations on étale cohomology groups.
• Virasoro conjecture: a certain generating function encoding the Gromov–Witten invariants of a smooth projective variety is fixed by an action of half of the Virasoro algebra.
• Zariski multiplicity conjecture on the topological equisingularity and equimultiplicity of varieties at singular points<ref>Template:Cite journal</ref>

• Are infinite sequences of flips possible in dimensions greater than 3?
• Resolution of singularities in characteristic <math>p</math>

Covering and packing

• Borsuk's problem on upper and lower bounds for the number of smaller-diameter subsets needed to cover a bounded n-dimensional set.
• The covering problem of Rado: if the union of finitely many axis-parallel squares has unit area, how small can the largest area covered by a disjoint subset of squares be?<ref>Template:Citation</ref>
• The Erdős–Oler conjecture: when <math>n</math> is a triangular number, packing <math>n-1</math> circles in an equilateral triangle requires a triangle of the same size as packing <math>n</math> circles.<ref>Template:Citation</ref>
• The disk covering problem abount finding the smallest real number <math>r(n)</math> such that <math>n</math> disks of radius <math>r(n)</math> can be arranged in such a way as to cover the unit disk.
• The kissing number problem for dimensions other than 1, 2, 3, 4, 8 and 24<ref>Template:Citation</ref>
• Reinhardt's conjecture: the smoothed octagon has the lowest maximum packing density of all centrally-symmetric convex plane sets<ref>Template:Citation</ref>
• Sphere packing problems, including the density of the densest packing in dimensions other than 1, 2, 3, 8 and 24, and its asymptotic behavior for high dimensions.
• Square packing in a square: what is the asymptotic growth rate of wasted space?<ref>Template:Citation</ref>
• Ulam's packing conjecture about the identity of the worst-packing convex solid<ref>Template:Citation</ref>
• The Tammes problem for numbers of nodes greater than 14 (except 24).<ref>Template:Cite journal</ref>

Differential geometry

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• The spherical Bernstein's problem, a generalization of Bernstein's problem
• Carathéodory conjecture: any convex, closed, and twice-differentiable surface in three-dimensional Euclidean space admits at least two umbilical points.
• Cartan–Hadamard conjecture: can the classical isoperimetric inequality for subsets of Euclidean space be extended to spaces of nonpositive curvature, known as Cartan–Hadamard manifolds?
• Chern's conjecture (affine geometry) that the Euler characteristic of a compact affine manifold vanishes.
• Chern's conjecture for hypersurfaces in spheres, a number of closely related conjectures.
• Closed curve problem: find (explicit) necessary and sufficient conditions that determine when, given two periodic functions with the same period, the integral curve is closed.<ref>Template:Citation</ref>
• The filling area conjecture, that a hemisphere has the minimum area among shortcut-free surfaces in Euclidean space whose boundary forms a closed curve of given length<ref>Template:Citation</ref>
• The Hopf conjectures relating the curvature and Euler characteristic of higher-dimensional Riemannian manifolds<ref>Template:Citation</ref>
• Osserman conjecture: that every Osserman manifold is either flat or locally isometric to a rank-one symmetric space<ref>Template:Citation</ref>
• Yau's conjecture on the first eigenvalue that the first eigenvalue for the Laplace–Beltrami operator on an embedded minimal hypersurface of <math>S^{n+1}</math> is <math>n</math>.

Discrete geometry

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

File:Kissing-3d.png

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.

• The big-line-big-clique conjecture on the existence of either many collinear points or many mutually visible points in large planar point sets<ref>Template:Citation</ref>
• The Hadwiger conjecture on covering n-dimensional convex bodies with at most 2ⁿ smaller copies<ref>Template:Citation.</ref>
• Solving the happy ending problem for arbitrary <math>n</math><ref>Template:Citation; Template:Citation</ref>
• Improving lower and upper bounds for the Heilbronn triangle problem.
• Kalai's 3^d conjecture on the least possible number of faces of centrally symmetric polytopes.<ref name="kalai">Template:Citation.</ref>
• The Kobon triangle problem on triangles in line arrangements<ref>Template:Cite journal</ref>
• The Kusner conjecture: at most <math>2d</math> points can be equidistant in <math>L^1</math> spaces<ref>Template:Citation</ref>
• The McMullen problem on projectively transforming sets of points into convex position<ref>Template:Citation</ref>
• Opaque forest problem on finding opaque sets for various planar shapes
• How many unit distances can be determined by a set of Template:Mvar points in the Euclidean plane?<ref>Template:Citation</ref>
• Finding matching upper and lower bounds for k-sets and halving lines<ref>Template:Citation; Template:Citation.</ref>
• Tripod packing:<ref>Template:Citation</ref> how many tripods can have their apexes packed into a given cube?

Euclidean geometry

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• The Atiyah conjecture on configurations on the invertibility of a certain <math>n</math>-by-<math>n</math> matrix depending on <math>n</math> points in <math>\mathbb{R}^{3}</math><ref>Template:Citation</ref>
• Bellman's lost-in-a-forest problem – find the shortest route that is guaranteed to reach the boundary of a given shape, starting at an unknown point of the shape with unknown orientation<ref>Template:Citation</ref>
• Borromean rings — are there three unknotted space curves, not all three circles, which cannot be arranged to form this link?<ref>Template:Citation</ref>
• Connelly’s blooming conjecture: Does every net of a convex polyhedron have a blooming?<ref>Template:Citation. Announced in 2003.</ref>
• Danzer's problem and Conway's dead fly problem – do Danzer sets of bounded density or bounded separation exist?<ref>Template:Citation; Template:Citation</ref>
• Dissection into orthoschemes – is it possible for simplices of every dimension?<ref>Template:Citation. See in particular Conjecture 23, p. 327.</ref>
• Ehrhart's volume conjecture: a convex body <math>K</math> in <math>n</math> dimensions containing a single lattice point in its interior as its center of mass cannot have volume greater than <math>(n+1)^{n}/n!</math>
• Falconer's conjecture: sets of Hausdorff dimension greater than <math>d/2</math> in <math>\mathbb{R}^d</math> must have a distance set of nonzero Lebesgue measure<ref>Template:Citation</ref>
• The values of the Hermite constants for dimensions other than 1–8 and 24
• What is the lowest number of faces possible for a holyhedron?
• Inscribed square problem, also known as Toeplitz' conjecture and the square peg problem – does every Jordan curve have an inscribed square?<ref name="matschke">Template:Citation</ref>
• The Kakeya conjecture – do <math>n</math>-dimensional sets that contain a unit line segment in every direction necessarily have Hausdorff dimension and Minkowski dimension equal to <math>n</math>?<ref>Template:Citation</ref>
• The Kelvin problem on minimum-surface-area partitions of space into equal-volume cells, and the optimality of the Weaire–Phelan structure as a solution to the Kelvin problem<ref>Template:Citation</ref>
• Lebesgue's universal covering problem on the minimum-area convex shape in the plane that can cover any shape of diameter one<ref>Template:Citation</ref>
• Mahler's conjecture on the product of the volumes of a centrally symmetric convex body and its polar.<ref>Template:Cite journal</ref>
• Moser's worm problem – what is the smallest area of a shape that can cover every unit-length curve in the plane?<ref>Template:Citation</ref>
• The moving sofa problem – what is the largest area of a shape that can be maneuvered through a unit-width L-shaped corridor?<ref>Template:Citation</ref>
• 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?<ref>Template:Cite journal</ref>
  • Does every higher-dimensional tiling by translations of convex polytope tiles have an affine transformation taking it to a Voronoi diagram?<ref>Template:Cite journal</ref>
• Does every convex polyhedron have Rupert's property?<ref name=cyz>Template:Citation</ref><ref name=styu>Template:Citation</ref>
• Shephard's problem (a.k.a. Dürer's conjecture) – does every convex polyhedron have a net, or simple edge-unfolding?<ref>Template:Citation</ref><ref>Template:Cite journal</ref>
• 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 <math>n</math> mutually-repelling particles on a unit sphere?<ref>Template:Citation</ref>
• Convex uniform 5-polytopes – find and classify the complete set of these shapes<ref>Template:Citation.</ref>

Graph theory

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Algebraic graph theory

• Babai's problem: which groups are Babai invariant groups?
• Brouwer's conjecture on upper bounds for sums of eigenvalues of Laplacians of graphs in terms of their number of edges

Games on graphs

• Does there exist a graph <math>G</math> such that the dominating number <math>\gamma(G)</math> equals the eternal dominating number <math>\gamma</math>_∞<math>(G)</math> of <math>G</math> and <math>\gamma(G)</math> is less than the clique covering number of <math>G</math>? <ref>Template:Cite journal.</ref>
• Graham's pebbling conjecture on the pebbling number of Cartesian products of graphs<ref>Template:Cite journal</ref>
• Meyniel's conjecture that cop number is <math>O(\sqrt n)</math><ref>Template:Cite journal</ref>
• Suppose Alice has a winning strategy for the vertex coloring game on a graph <math>G</math> with <math>k</math> colors. Does she have one for <math>k+1</math> colors?<ref name=zhu1999>Template:Cite journal</ref>

Graph coloring and labeling

File:Erdős–Faber–Lovász conjecture.svg

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.

• The 1-factorization conjecture that if <math>n</math> is odd or even and <math>k \geq n, n - 1</math> respectively, then a <math>k</math>-regular graph with <math>2n</math> vertices is 1-factorable.
  • The perfect 1-factorization conjecture that every complete graph on an even number of vertices admits a perfect 1-factorization.
• Cereceda's conjecture on the diameter of the space of colorings of degenerate graphs<ref>Template:Citation</ref>
• The Earth–Moon problem: what is the maximum chromatic number of biplanar graphs?<ref>Template:Citation</ref>
• The Erdős–Faber–Lovász conjecture on coloring unions of cliques<ref>Template:Citation.</ref>
• The graceful tree conjecture that every tree admits a graceful labeling
  • Rosa's conjecture that all triangular cacti are graceful or nearly-graceful
• The Gyárfás–Sumner conjecture on χ-boundedness of graphs with a forbidden induced tree<ref>Template:Citation</ref>
• The Hadwiger conjecture relating coloring to clique minors<ref>Template:Citation.</ref>
• The Hadwiger–Nelson problem on the chromatic number of unit distance graphs<ref>Template:Citation, Problem G10.</ref>
• Jaeger's Petersen-coloring conjecture: every bridgeless cubic graph has a cycle-continuous mapping to the Petersen graph<ref>Template:Citation.</ref>
• The list coloring conjecture: for every graph, the list chromatic index equals the chromatic index<ref>Template:Citation.</ref>
• The overfull conjecture that a graph with maximum degree <math>\Delta(G) \geq n/3</math> is class 2 if and only if it has an overfull subgraph <math>S</math> satisfying <math>\Delta(S) = \Delta(G)</math>.
• The total coloring conjecture of Behzad and Vizing that the total chromatic number is at most two plus the maximum degree<ref>Template:Citation.</ref>

Graph drawing and embedding

• The Albertson conjecture: the crossing number can be lower-bounded by the crossing number of a complete graph with the same chromatic number<ref>Template:Citation.</ref>
• Conway's thrackle conjecture<ref>Template:Citation.</ref> that thrackles cannot have more edges than vertices
• The GNRS conjecture on whether minor-closed graph families have <math>\ell_1</math> embeddings with bounded distortion<ref>Template:Citation</ref>
• Harborth's conjecture: every planar graph can be drawn with integer edge lengths<ref>Template:Citation.</ref>
• Negami's conjecture on projective-plane embeddings of graphs with planar covers<ref>Template:Citation.</ref>
• The strong Papadimitriou–Ratajczak conjecture: every polyhedral graph has a convex greedy embedding<ref>Template:Citation</ref>
• Turán's brick factory problem – Is there a drawing of any complete bipartite graph with fewer crossings than the number given by Zarankiewicz?<ref>Template:Citation.</ref>

• Universal point sets of subquadratic size for planar graphs<ref>Template:Citation.</ref>

Restriction of graph parameters

• Conway's 99-graph problem: does there exist a strongly regular graph with parameters (99,14,1,2)?<ref>Template:Citation</ref>
• Degree diameter problem: given two positive integers <math>d, k</math>, what is the largest graph of diameter <math>k</math> such that all vertices have degrees at most <math>d</math>?
• Jørgensen's conjecture that every 6-vertex-connected K₆-minor-free graph is an apex graph<ref>Template:Citation.</ref>
• Does a Moore graph with girth 5 and degree 57 exist?<ref>Template:Citation

</ref>

• Do there exist infinitely many strongly regular geodetic graphs, or any strongly regular geodetic graphs that are not Moore graphs?<ref>Template:Citation</ref>

Subgraphs

• Barnette's conjecture: every cubic bipartite three-connected planar graph has a Hamiltonian cycle<ref>Template:Citation.</ref>
• Gilbert–Pollack conjecture on the Steiner ratio of the Euclidean plane that the Steiner ratio is <math>\sqrt{3}/2</math>
• Chvátal's toughness conjecture, that there is a number Template:Mvar such that every Template:Mvar-tough graph is Hamiltonian<ref>Template:Citation</ref>
• The cycle double cover conjecture: every bridgeless graph has a family of cycles that includes each edge twice<ref>Template:Citation.</ref>
• The Erdős–Gyárfás conjecture on cycles with power-of-two lengths in cubic graphs<ref>Template:Citation.</ref>
• The Erdős–Hajnal conjecture on large cliques or independent sets in graphs with a forbidden induced subgraph<ref>Template:Citation.</ref>
• The linear arboricity conjecture on decomposing graphs into disjoint unions of paths according to their maximum degree<ref>Template:Citation.</ref>
• The Lovász conjecture on Hamiltonian paths in symmetric graphs<ref>Template:Cite book</ref>
• The Oberwolfach problem on which 2-regular graphs have the property that a complete graph on the same number of vertices can be decomposed into edge-disjoint copies of the given graph.<ref>Template:Citation</ref>
• What is the largest possible pathwidth of an Template:Mvar-vertex cubic graph?<ref>Template:Citation

</ref>

• The reconstruction conjecture and new digraph reconstruction conjecture on whether a graph is uniquely determined by its vertex-deleted subgraphs.<ref>Template:Cite conference</ref><ref>Template:Citation</ref>
• The snake-in-the-box problem: what is the longest possible induced path in an <math>n</math>-dimensional hypercube graph?
• Sumner's conjecture: does every <math>(2n-2)</math>-vertex tournament contain as a subgraph every <math>n</math>-vertex oriented tree?<ref>Template:Citation.</ref>
• Szymanski's conjecture: every permutation on the <math>n</math>-dimensional doubly-directed hypercube graph can be routed with edge-disjoint paths.
• Tuza's conjecture: if the maximum number of disjoint triangles is <math>\nu</math>, can all triangles be hit by a set of at most <math>2\nu</math> edges?<ref>Template:Cite journal</ref>
• Vizing's conjecture on the domination number of cartesian products of graphs<ref>Template:Citation.</ref>
• Zarankiewicz problem: how many edges can there be in a bipartite graph on a given number of vertices with no complete bipartite subgraphs of a given size?

Word-representation of graphs

• Are there any graphs on n vertices whose representation requires more than floor(n/2) copies of each letter?<ref name="KL15">Template:Cite book</ref><ref name="K17">Template:Cite conference</ref><ref name="KP18">Template:Cite journal</ref><ref name="KP18-2">Template:Cite journal</ref>
• Characterise (non-)word-representable planar graphs<ref name="KL15"/><ref name="K17"/><ref name="KP18"/><ref name="KP18-2"/>
• Characterise word-representable graphs in terms of (induced) forbidden subgraphs.<ref name="KL15"/><ref name="K17"/><ref name="KP18"/><ref name="KP18-2"/>
• Characterise word-representable near-triangulations containing the complete graph K₄ (such a characterisation is known for K₄-free planar graphs<ref name="Glen2019">Template:Cite arXiv</ref>)
• Classify graphs with representation number 3, that is, graphs that can be represented using 3 copies of each letter, but cannot be represented using 2 copies of each letter<ref name="Kit2013-3-repr">Template:Cite arXiv</ref>
• Is it true that out of all bipartite graphs, crown graphs require longest word-representants?<ref name="GKP18">Template:Cite journal</ref>
• Is the line graph of a non-word-representable graph always non-word-representable?<ref name="KL15"/><ref name="K17"/><ref name="KP18"/><ref name="KP18-2"/>
• Which (hard) problems on graphs can be translated to words representing them and solved on words (efficiently)?<ref name="KL15"/><ref name="K17"/><ref name="KP18"/><ref name="KP18-2"/>

Miscellaneous graph theory

• The implicit graph conjecture on the existence of implicit representations for slowly-growing hereditary families of graphs<ref>Template:Citation.</ref>
• Ryser's conjecture relating the maximum matching size and minimum transversal size in hypergraphs
• The second neighborhood problem: does every oriented graph contain a vertex for which there are at least as many other vertices at distance two as at distance one?<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• Sidorenko's conjecture on homomorphism densities of graphs in graphons
• Tutte's conjectures:
  • every bridgeless graph has a nowhere-zero 5-flow<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• • every Petersen-minor-free bridgeless graph has a nowhere-zero 4-flow<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• Woodall's conjecture that the minimum number of edges in a dicut of a directed graph is equal to the maximum number of disjoint dijoins

Model theory and formal languages

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• The Cherlin–Zilber conjecture: A simple group whose first-order theory is stable in <math>\aleph_0</math> 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<ref>Template:Cite journal</ref>
• The main gap conjecture, e.g. for uncountable first order theories, for AECs, and for <math>\aleph_1</math>-saturated models of a countable theory.<ref name=":0">Template:Cite book</ref>
• Shelah's categoricity conjecture for <math>L_{\omega_1,\omega}</math>: If a sentence is categorical above the Hanf number then it is categorical in all cardinals above the Hanf number.<ref name=":0" />
• Shelah's eventual categoricity conjecture: For every cardinal <math>\lambda</math> there exists a cardinal <math>\mu(\lambda)</math> such that if an AEC K with LS(K)<math>{} \le \lambda</math> is categorical in a cardinal above <math>\mu(\lambda)</math> then it is categorical in all cardinals above <math>\mu(\lambda)</math>.<ref name=":0" /><ref>Template:Cite book</ref>
• The stable field conjecture: every infinite field with a stable first-order theory is separably closed.
• The stable forking conjecture for simple theories<ref>Template:Cite journal</ref>
• 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?<ref>Template:Cite journal</ref>
• The universality spectrum problem: Is there a first-order theory whose universality spectrum is minimum?<ref>Džamonja, Mirna, "Club guessing and the universal models." On PCF, ed. M. Foreman, (Banff, Alberta, 2004).</ref>
• Vaught conjecture: the number of countable models of a first-order complete theory in a countable language is either finite, <math>\aleph_0</math>, or <math>2^{\aleph_0}</math>.

• Assume K is the class of models of a countable first order theory omitting countably many types. If K has a model of cardinality <math>\aleph_{\omega_1}</math> does it have a model of cardinality continuum?<ref>Template:Cite journal</ref>
• 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 <math>\aleph_n</math>, is it categorical in every cardinal?<ref>Template:Cite book</ref><ref>Template:Cite arXiv</ref>
• 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?<ref>Gurevich, Yuri, "Monadic Second-Order Theories," in J. Barwise, S. Feferman, eds., Model-Theoretic Logics (New York: Springer-Verlag, 1985), 479–506.</ref>
• Is the theory of the field of Laurent series over <math>\mathbb{Z}_p</math> decidable? of the field of polynomials over <math>\mathbb{C}</math>?
• Is there a logic L which satisfies both the Beth property and Δ-interpolation, is compact but does not satisfy the interpolation property?<ref>Makowsky J, "Compactness, embeddings and definability," in Model-Theoretic Logics, eds Barwise and Feferman, Springer 1985 pps. 645–715.</ref>

• Determine the structure of Keisler's order.<ref>Template:Cite journal</ref><ref>Template:Cite arXiv Template:Cite arXiv</ref>

Probability theory

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Ibragimov–Iosifescu conjecture for φ-mixing sequences

Number theory

General

File:Perfect number Cuisenaire rods 6 exact.svg

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.

• Beilinson's conjectures
• Brocard's problem: are there any integer solutions to <math>n! + 1 = m^{2}</math> other than <math>n = 4, 5, 7</math>?
• Büchi's problem on sufficiently large sequences of square numbers with constant second difference.
• Carmichael's totient function conjecture: do all values of Euler's totient function have multiplicity greater than <math>1</math>?
• Casas-Alvero conjecture: if a polynomial of degree <math>d</math> defined over a field <math>K</math> of characteristic <math>0</math> has a factor in common with its first through <math>d - 1</math>-th derivative, then must <math>f</math> be the <math>d</math>-th power of a linear polynomial?
• Catalan–Dickson conjecture on aliquot sequences: no aliquot sequences are infinite but non-repeating.
• Erdős–Ulam problem: is there a dense set of points in the plane all at rational distances from one-another?
• Exponent pair conjecture: for all <math>\varepsilon > 0</math>, is the pair <math>(\varepsilon, 1/2 + \varepsilon)</math> an exponent pair?
• The Gauss circle problem: how far can the number of integer points in a circle centered at the origin be from the area of the circle?
• Grand Riemann hypothesis: do the nontrivial zeros of all automorphic L-functions lie on the critical line <math>1/2 + it</math> with real <math>t</math>?
  • Generalized Riemann hypothesis: do the nontrivial zeros of all Dirichlet L-functions lie on the critical line <math>1/2 + it</math> with real <math>t</math>?
    • Riemann hypothesis: do the nontrivial zeros of the Riemann zeta function lie on the critical line <math>1/2 + it</math> with real <math>t</math>?
• Grimm's conjecture: each element of a set of consecutive composite numbers can be assigned a distinct prime number that divides it.
• Hall's conjecture: for any <math>\varepsilon > 0</math>, there is some constant <math>c(\varepsilon)</math> such that either <math>y^2 = x^3</math> or <math>|y^2 - x^3| > c(\varepsilon)x^{1/2 - \varepsilon}</math>.
• Hardy–Littlewood zeta function conjectures
• Hilbert–Pólya conjecture: the nontrivial zeros of the Riemann zeta function correspond to eigenvalues of a self-adjoint operator.
• Hilbert's eleventh problem: classify quadratic forms over algebraic number fields.
• Hilbert's ninth problem: find the most general reciprocity law for the norm residues of <math>k</math>-th order in a general algebraic number field, where <math>k</math> is a power of a prime.
• Hilbert's twelfth problem: extend the Kronecker–Weber theorem on Abelian extensions of <math>\mathbb{Q}</math> to any base number field.
• Keating–Snaith conjecture concerning the asymptotics of an integral involving the Riemann zeta function<ref>Template:Citation</ref>
• Lehmer's totient problem: if <math>\phi(n)</math> divides <math>n - 1</math>, must <math>n</math> be prime?
• Leopoldt's conjecture: a p-adic analogue of the regulator of an algebraic number field does not vanish.
• Lindelöf hypothesis that for all <math>\varepsilon > 0</math>, <math>\zeta(1/2 + it) = o(t^\varepsilon)</math>
  • The density hypothesis for zeroes of the Riemann zeta function
• Littlewood conjecture: for any two real numbers <math>\alpha, \beta</math>, <math>\liminf_{n \rightarrow \infty} n\,\Vert n\alpha\Vert\,\Vert n\beta\Vert = 0</math>, where <math>\Vert x\Vert</math> is the distance from <math>x</math> to the nearest integer.
• Mahler's 3/2 problem that no real number <math>x</math> has the property that the fractional parts of <math>x(3/2)^n</math> are less than <math>1/2</math> for all positive integers <math>n</math>.
• Montgomery's pair correlation conjecture: the normalized pair correlation function between pairs of zeros of the Riemann zeta function is the same as the pair correlation function of random Hermitian matrices.
• n conjecture: a generalization of the abc conjecture to more than three integers.
  • abc conjecture: for any <math>\varepsilon > 0</math>, <math>\operatorname{rad}(abc)^{1+\varepsilon} < c</math> is true for only finitely many positive <math>a, b, c</math> such that <math>a + b = c</math>.
  • Szpiro's conjecture: for any <math>\varepsilon > 0</math>, there is some constant <math>C(\varepsilon)</math> such that, for any elliptic curve <math>E</math> defined over <math>\mathbb{Q}</math> with minimal discriminant <math>\Delta</math> and conductor <math>f</math>, we have <math>|\Delta| \leq C(\varepsilon) \cdot f^{6+\varepsilon}</math>.
• Newman's conjecture: the partition function satisfies any arbitrary congruence infinitely often.
• Piltz divisor problem on bounding <math>\Delta_k(x) = D_k(x) - xP_k(\log(x))</math>
  • Dirichlet's divisor problem: the specific case of the Piltz divisor problem for <math>k = 1</math>
• Ramanujan–Petersson conjecture: a number of related conjectures that are generalizations of the original conjecture.
• Sato–Tate conjecture: also a number of related conjectures that are generalizations of the original conjecture.
• Scholz conjecture: the length of the shortest addition chain producing <math>2^n - 1</math> is at most <math>n - 1</math> plus the length of the shortest addition chain producing <math>n</math>.
• Do Siegel zeros exist?
• Singmaster's conjecture: is there a finite upper bound on the multiplicities of the entries greater than 1 in Pascal's triangle?<ref>Template:Citation.</ref>
• Vojta's conjecture on heights of points on algebraic varieties over algebraic number fields.

• Are there infinitely many perfect numbers?
• Do any odd perfect numbers exist?
• Do quasiperfect numbers exist?
• Do any non-power of 2 almost perfect numbers exist?
• Are there 65, 66, or 67 idoneal numbers?
• Are there any pairs of amicable numbers which have opposite parity?
• Are there any pairs of betrothed numbers which have same parity?
• Are there any pairs of relatively prime amicable numbers?
• Are there infinitely many amicable numbers?
• Are there infinitely many betrothed numbers?
• Are there infinitely many Giuga numbers?
• Does every rational number with an odd denominator have an odd greedy expansion?
• Do any Lychrel numbers exist?
• Do any odd noncototients exist?
• Do any odd weird numbers exist?
• Do any (2, 5)-perfect numbers exist?
• Do any Taxicab(5, 2, n) exist for n > 1?
• Is there a covering system with odd distinct moduli?<ref>Template:Citation</ref>
• Is <math>\pi</math> a normal number (i.e., is each digit 0–9 equally frequent)?<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• Are all irrational algebraic numbers normal?
• Is 10 a solitary number?
• Can a 3×3 magic square be constructed from 9 distinct perfect square numbers?<ref>Template:Cite journal</ref>
• Find the value of the De Bruijn–Newman constant.

Additive number theory

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Template:See also

• Erdős conjecture on arithmetic progressions that if the sum of the reciprocals of the members of a set of positive integers diverges, then the set contains arbitrarily long arithmetic progressions.
• Erdős–Turán conjecture on additive bases: if <math>B</math> is an additive basis of order <math>2</math>, then the number of ways that positive integers <math>n</math> can be expressed as the sum of two numbers in <math>B</math> must tend to infinity as <math>n</math> tends to infinity.
• Gilbreath's conjecture on consecutive applications of the unsigned forward difference operator to the sequence of prime numbers.
• Goldbach's conjecture: every even natural number greater than <math>2</math> is the sum of two prime numbers.
• Lander, Parkin, and Selfridge conjecture: if the sum of <math>m</math> <math>k</math>-th powers of positive integers is equal to a different sum of <math>n</math> <math>k</math>-th powers of positive integers, then <math>m + n \geq k</math>.
• Lemoine's conjecture: all odd integers greater than <math>5</math> can be represented as the sum of an odd prime number and an even semiprime.
• Minimum overlap problem of estimating the minimum possible maximum number of times a number appears in the termwise difference of two equally large sets partitioning the set <math>\{1, \ldots, 2n\}</math>
• Pollock's conjectures
• Does every nonnegative integer appear in Recamán's sequence?
• Skolem problem: can an algorithm determine if a constant-recursive sequence contains a zero?
• The values of g(k) and G(k) in Waring's problem

• Do the Ulam numbers have a positive density?

• Determine growth rate of r_k(N) (see Szemerédi's theorem)

Algebraic number theory

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Class number problem: are there infinitely many real quadratic number fields with unique factorization?
• Fontaine–Mazur conjecture: actually numerous conjectures, all proposed by Jean-Marc Fontaine and Barry Mazur.
• Gan–Gross–Prasad conjecture: a restriction problem in representation theory of real or p-adic Lie groups.
• Greenberg's conjectures
• Hermite's problem: is it possible, for any natural number <math>n</math>, to assign a sequence of natural numbers to each real number such that the sequence for <math>x</math> is eventually periodic if and only if <math>x</math> is algebraic of degree <math>n</math>?
• Kummer–Vandiver conjecture: primes <math>p</math> do not divide the class number of the maximal real subfield of the <math>p</math>-th cyclotomic field.
• Lang and Trotter's conjecture on supersingular primes that the number of supersingular primes less than a constant <math>X</math> is within a constant multiple of <math>\sqrt{X}/\ln{X}</math>
• Selberg's 1/4 conjecture: the eigenvalues of the Laplace operator on Maass wave forms of congruence subgroups are at least <math>1/4</math>.
• Stark conjectures (including Brumer–Stark conjecture)

• Characterize all algebraic number fields that have some power basis.

Computational number theory

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Can integer factorization be done in polynomial time?

Diophantine approximation and transcendental number theory

File:Gamma-area.svg

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

• Schanuel's conjecture on the transcendence degree of certain field extensions of the rational numbers.<ref name="waldschmidt">Template:Citation</ref> In particular: Are <math>\pi</math> and <math>e</math> algebraically independent? Which nontrivial combinations of transcendental numbers (such as <math>e + \pi, e\pi, \pi^e, \pi^{\pi}, e^e</math>) are themselves transcendental?<ref>Template:Cite conference</ref><ref>Template:Citation</ref>
• The four exponentials conjecture: the transcendence of at least one of four exponentials of combinations of irrationals<ref name="waldschmidt" />
• Are Euler's constant <math>\gamma</math> and Catalan's constant <math>G</math> irrational? Are they transcendental? Is Apéry's constant <math>\zeta(3)</math> transcendental?<ref>For some background on the numbers in this problem, see articles by Eric W. Weisstein at Wolfram MathWorld (all articles accessed 22 August 2024):

• Euler's Constant
• Catalan's Constant
• Apéry's Constant
• irrational numbers (Template:Webarchive)
• transcendental numbers (Template:Webarchive)
• irrationality measures (Template:Webarchive)</ref><ref name=":1">Template:Cite arXiv</ref>
• Which transcendental numbers are (exponential) periods?<ref>Template:Citation</ref>
• How well can non-quadratic irrational numbers be approximated? What is the irrationality measure of specific (suspected) transcendental numbers such as <math>\pi</math> and <math>\gamma</math>?<ref name=":1" />
• Which irrational numbers have simple continued fraction terms whose geometric mean converges to Khinchin's constant?<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

Diophantine equations

• Beal's conjecture: for all integral solutions to <math>A^x + B^y = C^z</math> where <math>x, y, z > 2</math>, all three numbers <math>A, B, C</math> must share some prime factor.
• Congruent number problem (a corollary to Birch and Swinnerton-Dyer conjecture, per Tunnell's theorem): determine precisely what rational numbers are congruent numbers.
• Erdős–Moser problem: is <math>1^1 + 2^1 = 3^1</math> the only solution to the Erdős–Moser equation?
• Erdős–Straus conjecture: for every <math>n \geq 2</math>, there are positive integers <math>x, y, z</math> such that <math>4/n = 1/x + 1/y + 1/z</math>.
• Fermat–Catalan conjecture: there are finitely many distinct solutions <math>(a^m, b^n, c^k)</math> to the equation <math>a^m + b^n = c^k</math> with <math>a, b, c</math> being positive coprime integers and <math>m, n, k</math> being positive integers satisfying <math>1/m + 1/n + 1/k < 1</math>.
• Goormaghtigh conjecture on solutions to <math>(x^m - 1)/(x - 1) = (y^n - 1)/(y - 1)</math> where <math>x > y > 1</math> and <math>m, n > 2</math>.
• The uniqueness conjecture for Markov numbers<ref>Template:Citation</ref> that every Markov number is the largest number in exactly one normalized solution to the Markov Diophantine equation.
• Pillai's conjecture: for any <math>A, B, C</math>, the equation <math>Ax^m - By^n = C</math> has finitely many solutions when <math>m, n</math> are not both <math>2</math>.
• Which integers can be written as the sum of three perfect cubes?<ref>Template:Cite arXiv</ref>
• Can every integer be written as a sum of four perfect cubes?

Prime numbers

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Template:Prime number conjectures

File:Goldbach partitions of the even integers from 4 to 50 rev4b.svg

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.

• Agoh–Giuga conjecture on the Bernoulli numbers that <math>p</math> is prime if and only if <math>pB_{p-1} \equiv -1 \pmod p</math>
• Agrawal's conjecture that given coprime positive integers <math>n</math> and <math>r</math>, if <math>(X - 1)^n \equiv X^n - 1 \pmod{n, X^r - 1}</math>, then either <math>n</math> is prime or <math>n^{2} \equiv 1 \pmod{r}</math>
• Artin's conjecture on primitive roots that if an integer is neither a perfect square nor <math>-1</math>, then it is a primitive root modulo infinitely many prime numbers <math>p</math>
• Brocard's conjecture: there are always at least <math>4</math> prime numbers between consecutive squares of prime numbers, aside from <math>2^{2}</math> and <math>3^{2}</math>.
• Bunyakovsky conjecture: if an integer-coefficient polynomial <math>f</math> has a positive leading coefficient, is irreducible over the integers, and has no common factors over all <math>f(x)</math> where <math>x</math> is a positive integer, then <math>f(x)</math> is prime infinitely often.
• Catalan's Mersenne conjecture: some Catalan–Mersenne number is composite and thus all Catalan–Mersenne numbers are composite after some point.
• Dickson's conjecture: for a finite set of linear forms <math>a_1 + b_1 n, \ldots, a_k + b_k n</math> with each <math>b_i \geq 1</math>, there are infinitely many <math>n</math> for which all forms are prime, unless there is some congruence condition preventing it.
• Dubner's conjecture: every even number greater than <math>4208</math> is the sum of two primes which both have a twin.
• Elliott–Halberstam conjecture on the distribution of prime numbers in arithmetic progressions.
• Erdős–Mollin–Walsh conjecture: no three consecutive numbers are all powerful.
• Feit–Thompson conjecture: for all distinct prime numbers <math>p</math> and <math>q</math>, <math>(p^q - 1)/(p - 1)</math> does not divide <math>(q^p - 1)/(q - 1)</math>
• Fortune's conjecture that no Fortunate number is composite.
• The Gaussian moat problem: is it possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded?
• Gillies' conjecture on the distribution of prime divisors of Mersenne numbers.
• Landau's problems
  • Goldbach conjecture: all even natural numbers greater than <math>2</math> are the sum of two prime numbers.
  • Legendre's conjecture: for every positive integer <math>n</math>, there is a prime between <math>n^{2}</math> and <math>(n+1)^{2}</math>.
  • Twin prime conjecture: there are infinitely many twin primes.
  • Are there infinitely many primes of the form <math>n^{2} + 1</math>?
• Problems associated to Linnik's theorem
• New Mersenne conjecture: for any odd natural number <math>p</math>, if any two of the three conditions <math>p = 2^k \pm 1</math> or <math>p = 4^k \pm 3</math>, <math>2^p - 1</math> is prime, and <math>(2^{p} + 1)/3</math> is prime are true, then the third condition is also true.
• Polignac's conjecture: for all positive even numbers <math>n</math>, there are infinitely many prime gaps of size <math>n</math>.
• Schinzel's hypothesis H that for every finite collection <math>\{f_1, \ldots, f_k\}</math> of nonconstant irreducible polynomials over the integers with positive leading coefficients, either there are infinitely many positive integers <math>n</math> for which <math>f_1(n), \ldots, f_k(n)</math> are all primes, or there is some fixed divisor <math>m > 1</math> which, for all <math>n</math>, divides some <math>f_i(n)</math>.
• Selfridge's conjecture: is 78,557 the lowest Sierpiński number?
• Does the converse of Wolstenholme's theorem hold for all natural numbers?
• Are all Euclid numbers square-free?
• Are all Fermat numbers square-free?
• Are all Mersenne numbers of prime index square-free?
• Are there any composite c satisfying 2^{c − 1} ≡ 1 (mod c²)?
• Are there any Wall–Sun–Sun primes?
• Are there any Wieferich primes in base 47?
• Are there infinitely many balanced primes?
• Are there infinitely many Carol primes?
• Are there infinitely many cluster primes?
• Are there infinitely many cousin primes?
• Are there infinitely many Cullen primes?
• Are there infinitely many Euclid primes?
• Are there infinitely many Fibonacci primes?
• Are there infinitely many Kummer primes?
• Are there infinitely many Kynea primes?
• Are there infinitely many Lucas primes?
• Are there infinitely many Mersenne primes (Lenstra–Pomerance–Wagstaff conjecture); equivalently, infinitely many even perfect numbers?
• Are there infinitely many Newman–Shanks–Williams primes?
• Are there infinitely many palindromic primes to every base?
• Are there infinitely many Pell primes?
• Are there infinitely many Pierpont primes?
• Are there infinitely many prime quadruplets?
• Are there infinitely many prime triplets?
• Siegel's conjecture: are there infinitely many regular primes, and if so is their natural density as a subset of all primes <math>e^{-1/2}</math>?
• Are there infinitely many sexy primes?
• Are there infinitely many safe and Sophie Germain primes?
• Are there infinitely many Wagstaff primes?
• Are there infinitely many Wieferich primes?
• Are there infinitely many Wilson primes?
• Are there infinitely many Wolstenholme primes?
• Are there infinitely many Woodall primes?
• Can a prime p satisfy <math>2^{p-1}\equiv 1\pmod{p^2}</math> and <math>3^{p-1}\equiv 1\pmod{p^2}</math> simultaneously?<ref>Template:Cite arXiv</ref>
• Does every prime number appear in the Euclid–Mullin sequence?
• What is the smallest Skewes's number?
• For any given integer a > 0, are there infinitely many Lucas–Wieferich primes associated with the pair (a, −1)? (Specially, when a = 1, this is the Fibonacci-Wieferich primes, and when a = 2, this is the Pell-Wieferich primes)
• For any given integer a > 0, are there infinitely many primes p such that a^{p − 1} ≡ 1 (mod p²)?<ref>Template:Cite book</ref>
• For any given integer b which is not a perfect power and not of the form −4k⁴ for integer k, are there infinitely many repunit primes to base b?
• For any given integers <math>k\geq 1, b\geq 2, c\neq 0</math>, with Template:Nowrap and Template:Nowrap are there infinitely many primes of the form <math>(k\times b^n+c)/\gcd(k+c,b-1)</math> with integer n ≥ 1?
• Is every Fermat number <math>2^{2^n} + 1</math> composite for <math>n > 4</math>?
• Is 509,203 the lowest Riesel number?

Set theory

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Note: These conjectures are about models of Zermelo-Frankel set theory with choice, and may not be able to be expressed in models of other set theories such as the various constructive set theories or non-wellfounded set theory.

• (Woodin) Does the generalized continuum hypothesis below a strongly compact cardinal imply the generalized continuum hypothesis everywhere?
• Does the generalized continuum hypothesis entail <math>{\diamondsuit(E^{\lambda^+}_{\operatorname{cf}(\lambda)}})</math> for every singular cardinal <math>\lambda</math>?
• Does the generalized continuum hypothesis imply the existence of an ℵ₂-Suslin tree?
• If ℵ_ω is a strong limit cardinal, is <math>2^{\aleph_\omega} < \aleph_{\omega_1}</math> (see Singular cardinals hypothesis)? The best bound, ℵ_ω4, was obtained by Shelah using his PCF theory.
• The problem of finding the ultimate core model, one that contains all large cardinals.
• Woodin's Ω-conjecture: if there is a proper class of Woodin cardinals, then Ω-logic satisfies an analogue of Gödel's completeness theorem.
• Does the consistency of the existence of a strongly compact cardinal imply the consistent existence of a supercompact cardinal?
• Does there exist a Jónsson algebra on ℵ_ω?
• Is OCA (the open coloring axiom) consistent with <math>2^{\aleph_{0}}>\aleph_{2}</math>?
• Reinhardt cardinals: Without assuming the axiom of choice, can a nontrivial elementary embedding V→V exist?

Topology

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

File:Ochiai unknot.svg

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

• Baum–Connes conjecture: the assembly map is an isomorphism.
• Berge conjecture that the only knots in the 3-sphere which admit lens space surgeries are Berge knots.
• Bing–Borsuk conjecture: every <math>n</math>-dimensional homogeneous absolute neighborhood retract is a topological manifold.
• Borel conjecture: aspherical closed manifolds are determined up to homeomorphism by their fundamental groups.
• Halperin conjecture on rational Serre spectral sequences of certain fibrations.
• Hilbert–Smith conjecture: if a locally compact topological group has a continuous, faithful group action on a topological manifold, then the group must be a Lie group.
• Mazur's conjectures<ref>Template:Citation</ref>
• Novikov conjecture on the homotopy invariance of certain polynomials in the Pontryagin classes of a manifold, arising from the fundamental group.
• Quadrisecants of wild knots: it has been conjectured that wild knots always have infinitely many quadrisecants.<ref>Template:Citation</ref>
• Telescope conjecture: the last of Ravenel's conjectures in stable homotopy theory to be resolved.Template:Efn
• Unknotting problem: can unknots be recognized in polynomial time?
• Volume conjecture relating quantum invariants of knots to the hyperbolic geometry of their knot complements.
• Whitehead conjecture: every connected subcomplex of a two-dimensional aspherical CW complex is aspherical.
• Zeeman conjecture: given a finite contractible two-dimensional CW complex <math>K</math>, is the space <math>K \times [0, 1]</math> collapsible?

Problems solved since 1995

File:Ricci flow.png

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

Algebra

• Mazur's conjecture B (Vessilin Dimitrov, Ziyang Gao, and Philipp Habegger, 2020)<ref>Template:Cite journal

</ref>

• Suita conjecture (Qi'an Guan and Xiangyu Zhou, 2015) <ref>Template:Cite journal

</ref>

• Torsion conjecture (Loïc Merel, 1996)<ref>Template:Cite journal

</ref>

• Carlitz–Wan conjecture (Hendrik Lenstra, 1995)<ref>Template:Citation

</ref>

• Serre's nonnegativity conjecture (Ofer Gabber, 1995)

Analysis

• Kadison–Singer problem (Adam Marcus, Daniel Spielman and Nikhil Srivastava, 2013)<ref name=Casazza2006>Template:Cite book</ref><ref name=SIAM02.2014>Template:Cite news</ref> (and the Feichtinger's conjecture, Anderson's paving conjectures, Weaver's discrepancy theoretic <math>KS_r</math> and <math>KS'_r</math> conjectures, Bourgain-Tzafriri conjecture and <math>R_\varepsilon</math>-conjecture)
• Ahlfors measure conjecture (Ian Agol, 2004)<ref name="Agol">Template:Cite arXiv</ref>
• Gradient conjecture (Krzysztof Kurdyka, Tadeusz Mostowski, Adam Parusinski, 1999)<ref>Template:Cite journal</ref>

Combinatorics

• Erdős sumset conjecture (Joel Moreira, Florian Richter, Donald Robertson, 2018)<ref>Template:Cite journal</ref>
• McMullen's g-conjecture on the possible numbers of faces of different dimensions in a simplicial sphere (also Grünbaum conjecture, several conjectures of Kühnel) (Karim Adiprasito, 2018)<ref>Template:Citation. See in particular p. 316.</ref><ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• Hirsch conjecture (Francisco Santos Leal, 2010)<ref>Template:Cite journal</ref><ref>Template:Cite journal</ref>
• Gessel's lattice path conjecture (Manuel Kauers, Christoph Koutschan, and Doron Zeilberger, 2009)<ref>Template:Cite journal</ref>
• Stanley–Wilf conjecture (Gábor Tardos and Adam Marcus, 2004)<ref>Template:Cite journal</ref> (and also the Alon–Friedgut conjecture)
• Kemnitz's conjecture (Christian Reiher, 2003, Carlos di Fiore, 2003)<ref>Template:Cite journal</ref>
• Cameron–Erdős conjecture (Ben J. Green, 2003, Alexander Sapozhenko, 2003)<ref>Template:Cite journal</ref><ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

Dynamical systems

• Zimmer's conjecture (Aaron Brown, David Fisher, and Sebastián Hurtado-Salazar, 2017)<ref>Template:Cite arXiv

</ref>

• Painlevé conjecture (Jinxin Xue, 2014)<ref name="Xue1">Template:Cite arXiv</ref><ref name="Xue2">Template:Cite journal</ref>

Game theory

• Existence of a non-terminating game of beggar-my-neighbour (Brayden Casella, 2024)<ref>

{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

• The angel problem (Various independent proofs, 2006)<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref><ref>Template:Cite journal</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

Geometry

21st century

• Einstein problem (David Smith, Joseph Samuel Myers, Craig S. Kaplan, Chaim Goodman-Strauss, 2024)<ref>Template:Cite journal</ref>
• Maximal rank conjecture (Eric Larson, 2018)<ref>Template:Cite arXiv</ref>
• Weibel's conjecture (Moritz Kerz, Florian Strunk, and Georg Tamme, 2018)<ref>Template:Citation

</ref>

• Yau's conjecture (Antoine Song, 2018)<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }} </ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }} </ref>

• Pentagonal tiling (Michaël Rao, 2017)<ref>Template:Citation</ref>
• Willmore conjecture (Fernando Codá Marques and André Neves, 2012)<ref>Template:Cite journal</ref>
• Erdős distinct distances problem (Larry Guth, Nets Hawk Katz, 2011)<ref>Template:Cite journal</ref>
• Heterogeneous tiling conjecture (squaring the plane) (Frederick V. Henle and James M. Henle, 2008)<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• Tameness conjecture (Ian Agol, 2004)<ref name="Agol"/>
• Ending lamination theorem (Jeffrey F. Brock, Richard D. Canary, Yair N. Minsky, 2004)<ref>Template:Cite journal</ref>
• Carpenter's rule problem (Robert Connelly, Erik Demaine, Günter Rote, 2003)<ref>Template:Citation</ref>
• Lambda g conjecture (Carel Faber and Rahul Pandharipande, 2003)<ref>Template:Citation

</ref>

• Nagata's conjecture (Ivan Shestakov, Ualbai Umirbaev, 2003)<ref>Template:Cite journal</ref>
• Double bubble conjecture (Michael Hutchings, Frank Morgan, Manuel Ritoré, Antonio Ros, 2002)<ref>Template:Cite journal</ref>

20th century

• Honeycomb theorem (Thomas Callister Hales, 1999)<ref>Template:Cite journal</ref>
• Lange's conjecture (Montserrat Teixidor i Bigas and Barbara Russo, 1999)<ref>Template:Cite journal

</ref>

• Bogomolov conjecture (Emmanuel Ullmo, 1998, Shou-Wu Zhang, 1998)<ref>Template:Cite journal</ref><ref>Template:Cite journal</ref>
• Kepler conjecture (Samuel Ferguson, Thomas Callister Hales, 1998)<ref>Template:Cite journal</ref>
• Dodecahedral conjecture (Thomas Callister Hales, Sean McLaughlin, 1998)<ref>Template:Cite journal</ref>

Graph theory

• Kahn–Kalai conjecture (Jinyoung Park and Huy Tuan Pham, 2022)<ref>Template:Cite arXiv</ref>
• Blankenship–Oporowski conjecture on the book thickness of subdivisions (Vida Dujmović, David Eppstein, Robert Hickingbotham, Pat Morin, and David Wood, 2021)<ref>Template:Cite journal</ref>
• Ringel's conjecture that the complete graph <math>K_{2n+1}</math> can be decomposed into <math>2n+1</math> copies of any tree with <math>n</math> edges (Richard Montgomery, Benny Sudakov, Alexey Pokrovskiy, 2020)<ref>Template:Cite journal.</ref><ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• Disproof of Hedetniemi's conjecture on the chromatic number of tensor products of graphs (Yaroslav Shitov, 2019)<ref>Template:Cite journal</ref>
• Kelmans–Seymour conjecture (Dawei He, Yan Wang, and Xingxing Yu, 2020)<ref>Template:Cite journal

</ref><ref>Template:Cite journal </ref><ref>Template:Cite journal </ref><ref>Template:Cite journal </ref>

• Goldberg–Seymour conjecture (Guantao Chen, Guangming Jing, and Wenan Zang, 2019)<ref>Template:Cite arXiv

</ref>

• Babai's problem (Alireza Abdollahi, Maysam Zallaghi, 2015)<ref>Template:Cite journal</ref>
• Alspach's conjecture (Darryn Bryant, Daniel Horsley, William Pettersson, 2014)
• Alon–Saks–Seymour conjecture (Hao Huang, Benny Sudakov, 2012)
• Read–Hoggar conjecture (June Huh, 2009)<ref>Template:Cite journal</ref>
• Scheinerman's conjecture (Jeremie Chalopin and Daniel Gonçalves, 2009)<ref>Template:Cite conference</ref>
• Erdős–Menger conjecture (Ron Aharoni, Eli Berger 2007)<ref>Template:Cite journal</ref>
• Road coloring conjecture (Avraham Trahtman, 2007)<ref>Template:Cite news</ref>
• Robertson–Seymour theorem (Neil Robertson, Paul Seymour, 2004)<ref>Template:Cite book</ref>
• Strong perfect graph conjecture (Maria Chudnovsky, Neil Robertson, Paul Seymour and Robin Thomas, 2002)<ref>Template:Cite journal</ref>
• Toida's conjecture (Mikhail Muzychuk, Mikhail Klin, and Reinhard Pöschel, 2001)<ref>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.</ref>
• Harary's conjecture on the integral sum number of complete graphs (Zhibo Chen, 1996)<ref>Template:Cite journal

</ref>

Group theory

• Hanna Neumann conjecture (Joel Friedman, 2011, Igor Mineyev, 2011)<ref>Template:Cite journal</ref><ref>Template:Cite journal</ref>
• Density theorem (Hossein Namazi, Juan Souto, 2010)<ref>Template:Cite journal</ref>
• Full classification of finite simple groups (Koichiro Harada, Ronald Solomon, 2008)

Number theory

21st century

• André–Oort conjecture (Jonathan Pila, Ananth Shankar, Jacob Tsimerman, 2021)<ref>Template:Cite arXiv</ref>
• Duffin–Schaeffer theorem (Dimitris Koukoulopoulos, James Maynard, 2019)
• Main conjecture in Vinogradov's mean-value theorem (Jean Bourgain, Ciprian Demeter, Larry Guth, 2015)<ref>Template:Cite journal</ref>
• Goldbach's weak conjecture (Harald Helfgott, 2013)<ref>Template:Cite arXiv</ref><ref>Template:Cite arXiv</ref><ref>Template:Cite arXiv</ref>
• Existence of bounded gaps between arbitrarily large primes (Yitang Zhang, Polymath8, James Maynard, 2013)<ref>Template:Cite journal</ref><ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref><ref>Template:Cite journal</ref>

• Sidon set problem (Javier Cilleruelo, Imre Z. Ruzsa, and Carlos Vinuesa, 2010)<ref>Template:Cite journal</ref>
• Serre's modularity conjecture (Chandrashekhar Khare and Jean-Pierre Wintenberger, 2008)<ref>Template:Citation</ref><ref>Template:Citation</ref><ref>Template:Cite journal</ref>
• Green–Tao theorem (Ben J. Green and Terence Tao, 2004)<ref>Template:Cite journal</ref>
• Catalan's conjecture (Preda Mihăilescu, 2002)<ref>Template:Cite journal</ref>
• Erdős–Graham problem (Ernest S. Croot III, 2000)<ref>Template:Cite book Template:Cite journal</ref>

20th century

• Lafforgue's theorem (Laurent Lafforgue, 1998)<ref>Template:Citation</ref>
• Fermat's Last Theorem (Andrew Wiles and Richard Taylor, 1995)<ref>Template:Cite journal</ref><ref>Template:Cite journal</ref>

Ramsey theory

• Burr–Erdős conjecture (Choongbum Lee, 2017)<ref>Template:Cite journal</ref>
• Boolean Pythagorean triples problem (Marijn Heule, Oliver Kullmann, Victor W. Marek, 2016)<ref>Template:Cite journal</ref><ref>Template:Cite book</ref>

Theoretical computer science

• Sensitivity conjecture for Boolean functions (Hao Huang, 2019)<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

Topology

• Deciding whether the Conway knot is a slice knot (Lisa Piccirillo, 2020)<ref>Template:Cite journal</ref><ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• Virtual Haken conjecture (Ian Agol, Daniel Groves, Jason Manning, 2012)<ref>Template:Cite journal</ref> (and by work of Daniel Wise also virtually fibered conjecture)
• Hsiang–Lawson's conjecture (Simon Brendle, 2012)<ref>Template:Cite journal</ref>
• Ehrenpreis conjecture (Jeremy Kahn, Vladimir Markovic, 2011)<ref>Template:Cite journal</ref>
• Atiyah conjecture for groups with finite subgroups of unbounded order (Austin, 2009)<ref>Template:Cite journal</ref>
• Cobordism hypothesis (Jacob Lurie, 2008)<ref>Template:Cite journal</ref>
• Spherical space form conjecture (Grigori Perelman, 2006)
• Poincaré conjecture (Grigori Perelman, 2002)<ref name="auto">Template:Cite press release</ref>
• Geometrization conjecture, (Grigori Perelman,<ref name="auto" /> series of preprints in 2002–2003)<ref>Template:Cite arXiv</ref>
• Nikiel's conjecture (Mary Ellen Rudin, 1999)<ref>Template:Cite journal</ref>
• Disproof of the Ganea conjecture (Iwase, 1997)<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

Uncategorised

2010s

• Erdős discrepancy problem (Terence Tao, 2015)<ref>Template:Cite arXiv</ref>
• Umbral moonshine conjecture (John F. R. Duncan, Michael J. Griffin, Ken Ono, 2015)<ref>Template:Cite journal</ref>
• Anderson conjecture on the finite number of diffeomorphism classes of the collection of 4-manifolds satisfying certain properties (Jeff Cheeger, Aaron Naber, 2014)<ref>Template:Cite journal</ref>
• Gaussian correlation inequality (Thomas Royen, 2014)<ref>Template:Cite magazine</ref>
• Beck's conjecture on discrepancies of set systems constructed from three permutations (Alantha Newman, Aleksandar Nikolov, 2011)<ref>Template:Cite arXiv</ref>
• Bloch–Kato conjecture (Vladimir Voevodsky, 2011)<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref> (and Quillen–Lichtenbaum conjecture and by work of Thomas Geisser and Marc Levine (2001) also Beilinson–Lichtenbaum conjecture<ref>Template:Cite journal</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>Template:Rp<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>)

2000s

• Kauffman–Harary conjecture (Thomas Mattman, Pablo Solis, 2009)<ref>Template:Cite journal</ref>
• Surface subgroup conjecture (Jeremy Kahn, Vladimir Markovic, 2009)<ref>Template:Cite journal</ref>
• Normal scalar curvature conjecture and the Böttcher–Wenzel conjecture (Zhiqin Lu, 2007)<ref>Template:Cite journal</ref>
• Nirenberg–Treves conjecture (Nils Dencker, 2005)<ref>Template:Citation</ref><ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• Lax conjecture (Adrian Lewis, Pablo Parrilo, Motakuri Ramana, 2005)<ref>Template:Cite journal</ref>
• The Langlands–Shelstad fundamental lemma (Ngô Bảo Châu and Gérard Laumon, 2004)<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

• Milnor conjecture (Vladimir Voevodsky, 2003)<ref>Template:Cite journal</ref>
• Kirillov's conjecture (Ehud Baruch, 2003)<ref>Template:Cite journal</ref>
• Kouchnirenko's conjecture (Bertrand Haas, 2002)<ref>Template:Cite journal</ref>
• n! conjecture (Mark Haiman, 2001)<ref>Template:Cite journal</ref> (and also Macdonald positivity conjecture)
• Kato's conjecture (Pascal Auscher, Steve Hofmann, Michael Lacey, Alan McIntosh, and Philipp Tchamitchian, 2001)<ref>Template:Cite journal</ref>
• Deligne's conjecture on 1-motives (Luca Barbieri-Viale, Andreas Rosenschon, Morihiko Saito, 2001)<ref>Template:Cite journal</ref>
• Modularity theorem (Christophe Breuil, Brian Conrad, Fred Diamond, and Richard Taylor, 2001)<ref>Template:Citation</ref>
• Erdős–Stewart conjecture (Florian Luca, 2001)<ref>Template:Cite journal</ref>
• Berry–Robbins problem (Michael Atiyah, 2000)<ref>Template:Cite book

</ref>

See also

• List of conjectures
• List of unsolved problems in statistics
• List of unsolved problems in computer science
• List of unsolved problems in physics
• Lists of unsolved problems
• Open Problems in Mathematics
• The Great Mathematical Problems
• Scottish Book

Further reading

Books discussing problems solved since 1995

• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book

Books discussing unsolved problems

• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite journal
• Template:Cite arXiv

External links

• 24 Unsolved Problems and Rewards for them
• List of links to unsolved problems in mathematics, prizes and research
• Open Problem Garden
• AIM Problem Lists
• Unsolved Problem of the Week Archive. MathPro Press.
• {{#invoke:citation/CS1|citation

|CitationClass=web }}

• {{#invoke:citation/CS1|citation

|CitationClass=web }}

• {{#invoke:citation/CS1|citation

|CitationClass=web }}

• Unsolved Problems in Number Theory, Logic and Cryptography
• 200 open problems in graph theory Template:Webarchive
• The Open Problems Project (TOPP), discrete and computational geometry problems
• Kirby's list of unsolved problems in low-dimensional topology
• Erdös' Problems on Graphs
• Unsolved Problems in Virtual Knot Theory and Combinatorial Knot Theory
• Open problems from the 12th International Conference on Fuzzy Set Theory and Its Applications
• List of open problems in inner model theory
• {{#invoke:citation/CS1|citation

|CitationClass=web }}

• Barry Simon's 15 Problems in Mathematical Physics
• Alexandre Eremenko. Unsolved problems in Function Theory
• Erdos Problems collection