↑ arvau

Wikipedia / List of unsolved problems in mathematics

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, mathematical logic, 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

For over a century, 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, with the Millennium Prize Problems each containing a reward of one million dollars.

Millennium Prize Problems

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

The seventh problem, the Poincaré conjecture, was solved by Grigori Perelman in 2003. 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.

Notebooks

Unsolved problems

Algebra

Farrell–Jones conjecture on whether certain assembly maps are isomorphisms.

Hadamard conjecture, a Hadamard matrix exists.

  • Williamson conjecture: the problem of finding Williamson matrices, which can be used to construct Hadamard matrices.

  • Lander's conjecture-subgroup be non-cyclic? This implies Ryser's cyclic difference-set conjecture, and hence the circulant Hadamard conjecture.

Ryser's conjecture on circulant Hadamard matrices: no real circulant Hadamard matrix has order greater than 4.

Group theory

Representation theory

Analysis

Combinatorics

Dynamical systems

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)

Chess:

Go:

  • What is the perfect value of Komi?

Set:

Games with imperfect information

Geometry

Algebraic geometry

Deligne conjecture: any one of numerous named for Pierre Deligne.

Covering and packing

Differential geometry

Discrete geometry

Finding matching upper and lower bounds for k-sets and halving lines

  • For each arrangement of points in which the rectilinear crossing number is minimized, is the number of halving lines maximized?

  • Tripod packing: how many tripods can have their apexes packed into a given cube?

Euclidean geometry

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?

  • Does every higher-dimensional tiling by translations of convex polytope tiles have an affine transformation taking it to a Voronoi diagram?

Ropelength problems:

  • Is there a general expression for the minimum ropelength of an arbitrary closed knot?

  • ?

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

  • Shephard's problem (a.k.a. Dürer's conjecture) – does every convex polyhedron have a net, or simple edge-unfolding?

  • 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 mutually-repelling particles on a unit sphere?

  • Convex uniform 5-polytopes – find and classify the complete set of these shapes

Non-Euclidean geometry

Graph theory

Algebraic graph theory

Games on graphs

Graph coloring and labeling

The 1-factorization conjecture-regular graph vertices is 1-factorable.

The graceful tree conjecture that every tree admits a graceful labeling

Graph drawing and embedding

Restriction of graph parameters

Subgraphs

Word-representation of graphs

Miscellaneous graph theory

Tutte's conjectures:

Model theory and formal languages

  • The Cherlin–Zilber conjecture: A simple group whose first-order theory is stable 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

  • The main gap conjecture, e.g. for uncountable first order theories, for AECs-saturated models of a countable theory.

  • : If a sentence is categorical above the Hanf number then it is categorical in all cardinals above the Hanf number.

  • such that if an AEC K with LS(K.

  • The stable field conjecture: every infinite field with a stable first-order theory is separably closed.

  • The stable forking conjecture for simple theories

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

  • The universality spectrum problem: Is there a first-order theory whose universality spectrum is minimum?

  • Vaught conjecture: the number of countable models of a first-order complete theory in a countable language.

  • Assume K is the class of models of a countable first order theory omitting countably many types. If K does it have a model of cardinality continuum?

  • 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, is it categorical in every cardinal?

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

  • decidable?

  • Is there a logic L which satisfies both the Beth property and Δ-interpolation, is compact but does not satisfy the interpolation property?

  • Determine the structure of Keisler's order.

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

Probability theory

Number theory

General

Additive number theory

Algebraic number theory

Analytic number theory

Lindelöf hypothesis

Location of nontrivial zeros of L-functions, especially conjectures concerning their critical lines:

Piltz divisor problem

Arithmetic geometry

In Unit square:

n conjecture: a generalization of the abc conjecture to more than three integers.

Computational number theory

Can a discrete logarithm be computed in polynomial time?

Diophantine approximation and transcendental number theory

Diophantine equations

Prime numbers

Landau's problems

Set theory

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

Problems solved since 2015

Algebra

Jacobian conjecture for more than 2 dimensions (Levent Alpöge, 2026 using Claude Fable 5).

Group theory

  • Existence of a non-sofic, discrete, countable group (solution in an anonymized paper published by OpenAI, 2026).

  • Umbral moonshine conjecture (John F. R. Duncan, Michael J. Griffin, Ken Ono, 2015).

Analysis

Combinatorics

Dynamical systems

Game theory

Geometry

Graph theory

Number theory

Ramsey theory

Theoretical computer science

Topology

See also

Notes

References

Further reading

Books discussing problems solved since 1995

Books discussing unsolved problems