List of unsolved problems in mathematics

From Vero - Wikipedia
Jump to navigation Jump to search

Template:Short description Template:CS1 config Template:Dynamic list

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 13 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 6<ref name="auto1">Template:Cite web</ref> Clay Mathematics Institute 2000
Simon problems 15 < 12<ref>Template:Cite web</ref><ref name="guardian">Template:Cite web</ref> Barry Simon 2000
DARPA's math challenges<ref>Template:Cite web</ref><ref>Template:Cite web</ref> 23 DARPA 2007
Erdős's problems<ref>Template:Cite web</ref> > 1108 687 Paul Erdős Over six decades of Erdős' career, from the 1930s to 1990s
The Riemann zeta function, subject of the Riemann hypothesis<ref>Template:Cite 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"/>

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

Notebooks

Unsolved problems

Algebra

Template:Main

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

Group theory

Template:Main

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.

Representation theory

Analysis

Template:Main

Combinatorics

Template:Main

Dynamical systems

Template:Main

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

Games and puzzles

Template:Main

Combinatorial games

Template:Main

Games with imperfect information

Geometry

Template:Main

Algebraic geometry

Template:Main

Covering and packing

Differential geometry

Template:Main

Discrete geometry

Template:Main

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

Euclidean geometry

Template:Main

Graph theory

Template:Main

Algebraic graph theory

Games on graphs

Graph coloring and labeling

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

Graph drawing and embedding

Restriction of graph parameters

</ref>

Subgraphs

</ref>

Word-representation of graphs

Miscellaneous graph theory

Model theory and formal languages

Template:Main

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

Probability theory

Template:Main

Number theory

Template:Main articles Template:See also

General

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

Additive number theory

Template:Main Template:See also

Algebraic number theory

Template:Main

Analytic number theory

Template:Main article

Arithmetic geometry

Template:Main article

  • Bombieri–Lang conjecture: K-rational points on a variety of general type over number field K are not dense set in Zariski topology.
  • Erdős–Ulam problem: is there a dense set of points in the plane all at rational distances from one-another?
  • Manin conjecture: if K-rational points on Fano variety are Zariski-dense subset, then the distribution of points of height: <math display=inline>H(x)\leq B</math> in any Zariski-open subset <math display=inline>U</math> is proportional to <math display=inline>B \log (B)^{r-1}</math>, where <math display=inline>r</math> is rank of Picard group of that variety.
  • Sato–Tate conjecture: also a number of related conjectures that are generalizations of the original conjecture.
  • Vojta's conjecture: points on non-singular algebraic variety over algebraic number field that not satisfy certain height inequality are contained in some Zariski-closed set.
  • 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>.

Computational number theory

Template:Main

Diophantine approximation and transcendental number theory

Template:Further

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

Diophantine equations

Template:Further

Prime numbers

Template:Main Template:Prime number conjectures

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

Set theory

Template:Main

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.

Topology

Template:Main

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

Problems solved since 1995

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

Algebra

</ref>

</ref>

</ref>

</ref>

Analysis

Combinatorics

Dynamical systems

Template:Cite arXiv </ref>

</ref>

Game theory

Template:Cite web</ref>

Geometry

21st century

</ref>

</ref><ref>Template:Cite web </ref>

</ref>

20th century

</ref>

Graph theory

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

</ref>

</ref>

Group theory

Number theory

21st century

20th century

Ramsey theory

Theoretical computer science

Topology

Uncategorised

2010s

2000s

</ref>

See also

Notes

Template:Notelist

References

Template:Reflist

Further reading

Books discussing problems solved since 1995

Books discussing unsolved problems

Template:Unsolved problems