my-server
← Wiki Redirected from Open problem in mathematics

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, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations. Some problems belong to more than one discipline and are studied using techniques from different areas. Prizes are often awarded for the solution to a long-standing problem, and some lists of unsolved problems, such as the Millennium Prize Problems, receive considerable attention.

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

Notable lists

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

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

Group theory

Representation theory

Analysis

Combinatorics

Dynamical systems

Games and puzzles

Combinatorial games

Games with imperfect information

Geometry

Algebraic geometry

Covering and packing

Differential geometry

Discrete geometry

Euclidean geometry

* Are the two Meissner tetrahedra the minimum-volume three-dimensional shapes of constant width?
  • Moser's worm problem – what is the smallest area of a shape that can cover every unit-length curve in the plane?
  • The moving sofa problem – what is the largest area of a shape that can be maneuvered through a unit-width L-shaped corridor?
  • 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?
  • What constant governs the lower bound of a closed knot 's minimum ropelength ?
  • 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 – what is the minimum energy configuration of 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

Graph drawing and embedding

Restriction of graph parameters

Subgraphs

Word-representation of graphs

Miscellaneous graph theory

Model theory and formal languages

  • The Cherlin–Zilber conjecture: A simple group whose first-order theory is stable in 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, and for -saturated models of a countable theory.
  • Shelah's categoricity conjecture for : If a sentence is categorical above the Hanf number then it is categorical in all cardinals above the Hanf number.
  • Shelah's eventual categoricity conjecture: For every cardinal there exists a cardinal such that if an AEC K with LS(K) is categorical in a cardinal above then it is categorical in all cardinals above .
  • 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 is either finite, , or .
  • Assume K is the class of models of a countable first order theory omitting countably many types. If K has a model of cardinality 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 in the , 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?
  • Is the theory of the field of Laurent series over decidable? of the field of polynomials over ?
  • Is there a logic L which satisfies both the Beth property and Δ-interpolation, is compact but does not satisfy the interpolation property?
  • 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

Arithmetic geometry

Computational number theory

Diophantine approximation and transcendental number theory

Diophantine equations

Prime numbers

Set theory

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

Topology

Problems solved since 1995

Algebra

Analysis

Combinatorics

Dynamical systems

Game theory

Geometry

21st century

20th century

Graph theory

Group theory

Number theory

21st century

20th century

Ramsey theory

Theoretical computer science

Topology

Uncategorised

2010s

2000s

See also

Notes

References

Further reading

Books discussing problems solved since 1995

Books discussing unsolved problems

External links