HOME

TheInfoList



OR:

Many
mathematical problems A mathematical problem is a problem that can be Representation (mathematics), represented, analyzed, and possibly solved, with the methods of mathematics. This can be a real-world problem, such as computing the Orbit#Planetary orbits, orbits of the ...
have been stated but not yet solved. These problems come from many areas of mathematics, such as
theoretical physics Theoretical physics is a branch of physics that employs mathematical models and abstractions of physical objects and systems to rationalize, explain, and predict List of natural phenomena, natural phenomena. This is in contrast to experimental p ...
,
computer science Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, ...
,
algebra Algebra is a branch of mathematics that deals with abstract systems, known as algebraic structures, and the manipulation of expressions within those systems. It is a generalization of arithmetic that introduces variables and algebraic ope ...
,
analysis Analysis (: analyses) is the process of breaking a complex topic or substance into smaller parts in order to gain a better understanding of it. The technique has been applied in the study of mathematics and logic since before Aristotle (38 ...
,
combinatorics Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many ...
, algebraic, differential,
discrete Discrete may refer to: *Discrete particle or quantum in physics, for example in quantum theory * Discrete device, an electronic component with just one circuit element, either passive or active, other than an integrated circuit * Discrete group, ...
and Euclidean geometries,
graph theory In mathematics and computer science, graph theory is the study of ''graph (discrete mathematics), graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of ''Vertex (graph ...
,
group theory In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ( ...
,
model theory In mathematical logic, model theory is the study of the relationship between theory (mathematical logic), formal theories (a collection of Sentence (mathematical logic), sentences in a formal language expressing statements about a Structure (mat ...
,
number theory Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example ...
,
set theory Set theory is the branch of mathematical logic that studies Set (mathematics), sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory – as a branch of mathema ...
,
Ramsey theory Ramsey theory, named after the British mathematician and philosopher Frank P. Ramsey, is a branch of the mathematical field of combinatorics that focuses on the appearance of order in a substructure given a structure of a known size. Problems in R ...
,
dynamical system In mathematics, a dynamical system is a system in which a Function (mathematics), function describes the time dependence of a Point (geometry), point in an ambient space, such as in a parametric curve. Examples include the mathematical models ...
s, and
partial differential equation In mathematics, a partial differential equation (PDE) is an equation which involves a multivariable function and one or more of its partial derivatives. The function is often thought of as an "unknown" that solves the equation, similar to ho ...
s. 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 The Millennium Prize Problems are seven well-known complex mathematics, mathematical problems selected by the Clay Mathematics Institute in 2000. The Clay Institute has pledged a US $1 million prize for the first correct solution to each problem ...
, 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.


Millennium Prize Problems

Of the original seven
Millennium Prize Problems The Millennium Prize Problems are seven well-known complex mathematics, mathematical problems selected by the Clay Mathematics Institute in 2000. The Clay Institute has pledged a US $1 million prize for the first correct solution to each problem ...
listed by the Clay Mathematics Institute in 2000, six remain unsolved to date: * Birch and Swinnerton-Dyer conjecture * Hodge conjecture * Navier–Stokes existence and smoothness * P versus NP *
Riemann hypothesis In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part . Many consider it to be the most important unsolved problem in pure ...
* Yang–Mills existence and mass gap 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

* The Kourovka Notebook () is a collection of unsolved problems in
group theory In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ( ...
, first published in 1965 and updated many times since. * The Sverdlovsk Notebook () is a collection of unsolved problems in semigroup theory, first published in 1965 and updated every 2 to 4 years since. * The
Dniester The Dniester ( ) is a transboundary river in Eastern Europe. It runs first through Ukraine and then through Moldova (from which it more or less separates the breakaway territory of Transnistria), finally discharging into the Black Sea on Uk ...
Notebook () lists several hundred unsolved problems in algebra, particularly ring theory and modulus theory. * The Erlagol Notebook () lists unsolved problems in algebra and
model theory In mathematical logic, model theory is the study of the relationship between theory (mathematical logic), formal theories (a collection of Sentence (mathematical logic), sentences in a formal language expressing statements about a Structure (mat ...
.


Unsolved problems


Algebra

* Birch–Tate conjecture on the relation between the order of the center of the Steinberg group of the
ring of integers In mathematics, the ring of integers of an algebraic number field K is the ring of all algebraic integers contained in K. An algebraic integer is a root of a monic polynomial with integer coefficients: x^n+c_x^+\cdots+c_0. This ring is often de ...
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 extension In mathematics, particularly in algebra, a field extension is a pair of fields K \subseteq L, such that the operations of ''K'' are those of ''L'' restricted to ''K''. In this case, ''L'' is an extension field of ''K'' and ''K'' is a subfield of ...
s. * Connes embedding problem in
Von Neumann algebra In mathematics, a von Neumann algebra or W*-algebra is a *-algebra of bounded operators on a Hilbert space that is closed in the weak operator topology and contains the identity operator. It is a special type of C*-algebra. Von Neumann al ...
theory * Crouzeix's conjecture: the
matrix norm In the field of mathematics, norms are defined for elements within a vector space. Specifically, when the vector space comprises matrices, such norms are referred to as matrix norms. Matrix norms differ from vector norms in that they must also ...
of a complex function f applied to a complex matrix A is at most twice the
supremum In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, ...
of , f(z), over the field of values of A. * Determinantal conjecture on the
determinant In mathematics, the determinant is a Scalar (mathematics), scalar-valued function (mathematics), function of the entries of a square matrix. The determinant of a matrix is commonly denoted , , or . Its value characterizes some properties of the ...
of the sum of two
normal matrices Normal(s) or The Normal(s) may refer to: Film and television * ''Normal'' (2003 film), starring Jessica Lange and Tom Wilkinson * ''Normal'' (2007 film), starring Carrie-Anne Moss, Kevin Zegers, Callum Keith Rennie, and Andrew Airlie * ''Norma ...
. * Eilenberg–Ganea conjecture: a group with cohomological dimension 2 also has a 2-dimensional Eilenberg–MacLane space K(G, 1). * 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 Algebra is a branch of mathematics that deals with abstract systems, known as algebraic structures, and the manipulation of expressions within those systems. It is a generalization of arithmetic that introduces variables and algebraic ope ...
? * Goncharov conjecture on the
cohomology In mathematics, specifically in homology theory and algebraic topology, cohomology is a general term for a sequence of abelian groups, usually one associated with a topological space, often defined from a cochain complex. Cohomology can be viewed ...
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 k, a
Hadamard matrix In mathematics, an Hadamard matrix, named after the French mathematician Jacques Hadamard, is a square matrix whose entries are either +1 or −1 and whose rows are mutually orthogonal. In geometry, geometric terms, this means that each pair of r ...
of order 4k 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 In mathematics, the determinant is a Scalar (mathematics), scalar-valued function (mathematics), function of the entries of a square matrix. The determinant of a matrix is commonly denoted , , or . Its value characterizes some properties of the ...
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 In mathematics, a Noetherian ring is a ring that satisfies the ascending chain condition on left and right ideals. If the chain condition is satisfied only for left ideals or for right ideals, then the ring is said left-Noetherian or right-Noethe ...
is precisely 0. * Kaplansky's conjectures * Köthe conjecture: if a ring has no nil ideal other than \, then it has no nil one-sided ideal other than \. * Monomial conjecture on
Noetherian In mathematics, the adjective Noetherian is used to describe objects that satisfy an ascending or descending chain condition on certain kinds of subobjects, meaning that certain ascending or descending sequences of subobjects must have finite leng ...
local ring In mathematics, more specifically in ring theory, local rings are certain rings that are comparatively simple, and serve to describe what is called "local behaviour", in the sense of functions defined on algebraic varieties or manifolds, or of ...
s * Existence of perfect cuboids and associated cuboid conjectures * Pierce–Birkhoff conjecture: every piecewise-polynomial f:\mathbb^\rightarrow\mathbb is the maximum of a finite set of minimums of finite collections of polynomials. * Rota's basis conjecture: for matroids of rank n with n disjoint bases B_, it is possible to create an n \times n matrix whose rows are B_ and whose columns are also bases. * Serre's conjecture II: if G is a
simply connected In topology, a topological space is called simply connected (or 1-connected, or 1-simply connected) if it is path-connected and every Path (topology), path between two points can be continuously transformed into any other such path while preserving ...
semisimple algebraic group over a perfect field of cohomological dimension at most 2, then the Galois cohomology set H^(F, G) is zero. * Serre's positivity conjecture that if R is a commutative regular local ring, and P, Q are
prime ideal In algebra, a prime ideal is a subset of a ring (mathematics), ring that shares many important properties of a prime number in the ring of Integer#Algebraic properties, integers. The prime ideals for the integers are the sets that contain all th ...
s of R, then \dim (R/P) + \dim (R/Q) = \dim (R) implies \chi(R/P, R/Q) > 0. * Uniform boundedness conjecture for rational points: do
algebraic curve In mathematics, an affine algebraic plane curve is the zero set of a polynomial in two variables. A projective algebraic plane curve is the zero set in a projective plane of a homogeneous polynomial in three variables. An affine algebraic plane cu ...
s of
genus Genus (; : genera ) is a taxonomic rank above species and below family (taxonomy), family as used in the biological classification of extant taxon, living and fossil organisms as well as Virus classification#ICTV classification, viruses. In bino ...
g \geq 2 over number fields K have at most some bounded number N(K, g) of K-
rational point In number theory and algebraic geometry, a rational point of an algebraic variety is a point whose coordinates belong to a given field. If the field is not mentioned, the field of rational numbers is generally understood. If the field is the fiel ...
s? * Wild problems: problems involving classification of pairs of n\times n matrices under simultaneous conjugation. * Zariski–Lipman conjecture: for a complex algebraic variety V with
coordinate ring In algebraic geometry, an affine variety or affine algebraic variety is a certain kind of algebraic variety that can be described as a subset of an affine space. More formally, an affine algebraic set is the set of the common zeros over an algeb ...
R, if the derivations of R are a
free module In mathematics, a free module is a module that has a ''basis'', that is, a generating set that is linearly independent. Every vector space is a free module, but, if the ring of the coefficients is not a division ring (not a field in the commu ...
over R, then V is smooth. * Zauner's conjecture: do SIC-POVMs exist in all dimensions? * Zilber–Pink conjecture that if X is a mixed Shimura variety or semiabelian variety defined over \mathbb, and V \subseteq X is a subvariety, then V contains only finitely many atypical subvarieties.


Group theory

* Andrews–Curtis conjecture: every balanced
presentation A presentation conveys information from a speaker to an audience. Presentations are typically demonstrations, introduction, lecture, or speech meant to inform, persuade, inspire, motivate, build goodwill, or present a new idea/product. Presenta ...
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 finite? In particular, is finite? * Guralnick–Thompson conjecture on the composition factors of groups in genus-0 systems * Herzog–Schönheim conjecture: if a finite system of left
coset In mathematics, specifically group theory, a subgroup of a group may be used to decompose the underlying set of into disjoint, equal-size subsets called cosets. There are ''left cosets'' and ''right cosets''. Cosets (both left and right) ...
s of subgroups of a group G form a partition of G, 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
subgroup In group theory, a branch of mathematics, a subset of a group G is a subgroup of G if the members of that subset form a group with respect to the group operation in G. Formally, given a group (mathematics), group under a binary operation  ...
s. * 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 In mathematics, a Lie algebra (pronounced ) is a vector space \mathfrak g together with an operation called the Lie bracket, an alternating bilinear map \mathfrak g \times \mathfrak g \rightarrow \mathfrak g, that satisfies the Jacobi identi ...
. * McKay conjecture: in a group G, the number of irreducible complex characters of degree not divisible by a
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
p is equal to the number of irreducible complex characters of the
normalizer In mathematics, especially group theory, the centralizer (also called commutant) of a subset ''S'' in a group ''G'' is the set \operatorname_G(S) of elements of ''G'' that commute with every element of ''S'', or equivalently, the set of ele ...
of any Sylow p-subgroup within G.


Analysis

* The Brennan conjecture: estimating the integral of powers of the moduli of the derivative of
conformal map In mathematics, a conformal map is a function (mathematics), function that locally preserves angles, but not necessarily lengths. More formally, let U and V be open subsets of \mathbb^n. A function f:U\to V is called conformal (or angle-prese ...
s into the open unit disk, on certain subsets of \mathbb * Fuglede's conjecture on whether nonconvex sets in \mathbb and \mathbb^ are spectral if and only if they tile by
translation Translation is the communication of the semantics, meaning of a #Source and target languages, source-language text by means of an Dynamic and formal equivalence, equivalent #Source and target languages, target-language text. The English la ...
. * Goodman's conjecture on the coefficients of multivalued functions * Invariant subspace problem – does every bounded operator on a complex
Banach space In mathematics, more specifically in functional analysis, a Banach space (, ) is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and ...
send some non-trivial closed subspace to itself? * Kung–Traub conjecture on the optimal order of a multipoint iteration without memory * Lehmer's conjecture on the Mahler measure of non-cyclotomic polynomials * The mean value problem: given a
complex Complex commonly refers to: * Complexity, the behaviour of a system whose components interact in multiple ways so possible interactions are difficult to describe ** Complex system, a system composed of many components which may interact with each ...
polynomial In mathematics, a polynomial is a Expression (mathematics), mathematical expression consisting of indeterminate (variable), indeterminates (also called variable (mathematics), variables) and coefficients, that involves only the operations of addit ...
f of degree d \ge 2 and a complex number z, is there a critical point c of f such that , f(z)-f(c), \le , f'(z), , z-c, ? * The Pompeiu problem on the topology of domains for which some nonzero function has integrals that vanish over every congruent copy * Sendov's conjecture: if a complex polynomial with degree at least 2 has all roots in the closed
unit disk In mathematics, the open unit disk (or disc) around ''P'' (where ''P'' is a given point in the plane), is the set of points whose distance from ''P'' is less than 1: :D_1(P) = \.\, The closed unit disk around ''P'' is the set of points whose d ...
, then each root is within distance 1 from some critical point. * Vitushkin's conjecture on compact subsets of \mathbb with analytic capacity 0 * What is the exact value of Landau's constants, including Bloch's constant? * Regularity of solutions of
Euler equations In mathematics and physics, many topics are eponym, named in honor of Swiss mathematician Leonhard Euler (1707–1783), who made many important discoveries and innovations. Many of these items named after Euler include their own unique function, e ...
* Convergence o
Flint Hills series
* Regularity of solutions of Vlasov–Maxwell equations


Combinatorics

* The 1/3–2/3 conjecture – does every finite
partially ordered set In mathematics, especially order theory, a partial order on a Set (mathematics), set is an arrangement such that, for certain pairs of elements, one precedes the other. The word ''partial'' is used to indicate that not every pair of elements need ...
that is not
totally ordered In mathematics, a total order or linear order is a partial order in which any two elements are comparable. That is, a total order is a binary relation \leq on some set X, which satisfies the following for all a, b and c in X: # a \leq a ( r ...
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? * The Dittert conjecture concerning the maximum achieved by a particular function of matrices with real, nonnegative entries satisfying a summation condition * Problems in Latin squares – open questions concerning Latin squares * The lonely runner conjecture – if k runners with pairwise distinct speeds run round a track of unit length, will every runner be "lonely" (that is, be at least a distance 1/k from each other runner) at some time? * Map folding – various problems in map folding and stamp folding. * No-three-in-line problem – how many points can be placed in the n \times n grid so that no three of them lie on a line? * Rudin's conjecture on the number of squares in finite arithmetic progressions * The sunflower conjecture – can the number of k size sets required for the existence of a sunflower of r sets be bounded by an exponential function in k for every fixed r>2? * Frankl's union-closed sets conjecture – for any family of sets closed under sums there exists an element (of the underlying space) belonging to half or more of the sets * Give a combinatorial interpretation of the Kronecker coefficients * The values of the Dedekind numbers M(n) for n \ge 10 * The values of the Ramsey numbers, particularly R(5, 5) * The values of the Van der Waerden numbers * Finding a function to model n-step self-avoiding walks


Dynamical systems

* 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? * Birkhoff conjecture – if a billiard table is strictly convex and integrable, is its boundary necessarily an ellipse? * Collatz conjecture (also known as the 3n + 1 conjecture) * Eden's conjecture that the
supremum In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, ...
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 In mathematics, the complex plane is the plane (geometry), plane formed by the complex numbers, with a Cartesian coordinate system such that the horizontal -axis, called the real axis, is formed by the real numbers, and the vertical -axis, call ...
to itself is hyperbolic for an open dense set of parameters. * Furstenberg conjecture – is every invariant and ergodic measure for the \times 2,\times 3 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 In mathematics, the Laplace operator or Laplacian is a differential operator given by the divergence of the gradient of a scalar function on Euclidean space. It is usually denoted by the symbols \nabla\cdot\nabla, \nabla^2 (where \nabla is th ...
on a negatively-curved
manifold In mathematics, a manifold is a topological space that locally resembles Euclidean space near each point. More precisely, an n-dimensional manifold, or ''n-manifold'' for short, is a topological space with the property that each point has a N ...
* Rokhlin's multiple mixing problem – are all strongly mixing systems also strongly 3-mixing? * Weinstein conjecture – does a regular compact contact type level set of a
Hamiltonian Hamiltonian may refer to: * Hamiltonian mechanics, a function that represents the total energy of a system * Hamiltonian (quantum mechanics), an operator corresponding to the total energy of that system ** Dyall Hamiltonian, a modified 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?


Games and puzzles


Combinatorial games

* Sudoku: ** How many puzzles have exactly one solution? ** How many puzzles with exactly one solution are minimal? ** What is the maximum number of givens for a minimal puzzle? * 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) *
Chess Chess is a board game for two players. It is an abstract strategy game that involves Perfect information, no hidden information and no elements of game of chance, chance. It is played on a square chessboard, board consisting of 64 squares arran ...
: ** 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 Rendezvous or rendez-vous may refer to: Arts and entertainment Film and television * The Rendezvous (1923 film), ''The Rendezvous'' (1923 film), a silent film adventure melodrama * Rendezvous (1930 film), ''Rendezvous'' (1930 film), a Ger ...


Geometry


Algebraic geometry

* Abundance conjecture: if the canonical bundle of a
projective variety In algebraic geometry, a projective variety is an algebraic variety that is a closed subvariety of a projective space. That is, it is the zero-locus in \mathbb^n of some finite family of homogeneous polynomials that generate a prime ideal, th ...
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 bundle In mathematics, a vector bundle is a topological construction that makes precise the idea of a family of vector spaces parameterized by another space X (for example X could be a topological space, a manifold, or an algebraic variety): to eve ...
s over a regular
Noetherian ring In mathematics, a Noetherian ring is a ring that satisfies the ascending chain condition on left and right ideals. If the chain condition is satisfied only for left ideals or for right ideals, then the ring is said left-Noetherian or right-Noethe ...
and over the
polynomial ring In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates (traditionally also called variables) with coefficients in another ring, ...
A _, \ldots, t_/math>. * Deligne conjecture: any one of numerous named for
Pierre Deligne Pierre René, Viscount Deligne (; born 3 October 1944) is a Belgian mathematician. He is best known for work on the Weil conjectures, leading to a complete proof in 1973. He is the winner of the 2013 Abel Prize, 2008 Wolf Prize, 1988 Crafoor ...
. ** 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 In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphism ...
. * Fröberg conjecture on the Hilbert functions of a set of forms. * Fujita conjecture regarding the line bundle K_ \otimes L^ constructed from a positive holomorphic line bundle L on a
compact Compact as used in politics may refer broadly to a pact or treaty; in more specific cases it may refer to: * Interstate compact, a type of agreement used by U.S. states * Blood compact, an ancient ritual of the Philippines * Compact government, a t ...
complex manifold In differential geometry and complex geometry, a complex manifold is a manifold with a ''complex structure'', that is an atlas (topology), atlas of chart (topology), charts to the open unit disc in the complex coordinate space \mathbb^n, such th ...
M and the canonical line bundle K_ of M * General elephant problem: do general elephants have at most Du Val singularities? * Hartshorne's conjectures * In spherical or
hyperbolic geometry In mathematics, hyperbolic geometry (also called Lobachevskian geometry or János Bolyai, Bolyai–Nikolai Lobachevsky, Lobachevskian geometry) is a non-Euclidean geometry. The parallel postulate of Euclidean geometry is replaced with: :For a ...
, must polyhedra with the same volume and Dehn invariant be scissors-congruent? * 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 point In number theory and algebraic geometry, a rational point of an algebraic variety is a point whose coordinates belong to a given field. If the field is not mentioned, the field of rational numbers is generally understood. If the field is the fiel ...
s of bounded
height Height is measure of vertical distance, either vertical extent (how "tall" something or someone is) or vertical position (how "high" a point is). For an example of vertical extent, "This basketball player is 7 foot 1 inches in height." For an e ...
in certain subsets of Fano varieties * Maulik–Nekrasov–Okounkov–Pandharipande conjecture on an equivalence between Gromov–Witten theory and
Donaldson–Thomas theory In mathematics, specifically algebraic geometry Algebraic geometry is a branch of mathematics which uses abstract algebraic techniques, mainly from commutative algebra, to solve geometry, geometrical problems. Classically, it studies zero of ...
* 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 X is a smooth algebraic surface and L is an ample line bundle on X of degree d, then for sufficiently large r, the Seshadri constant satisfies \varepsilon(p_1,\ldots,p_r;X,L) = d/\sqrt. * 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 In algebraic geometry, a projective variety is an algebraic variety that is a closed subvariety of a projective space. That is, it is the zero-locus in \mathbb^n of some finite family of homogeneous polynomials that generate a prime ideal, th ...
defined over a
finite field In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field (mathematics), field that contains a finite number of Element (mathematics), elements. As with any field, a finite field is a Set (mathematics), s ...
must vanish up to torsion. * Section conjecture on splittings of
group homomorphism In mathematics, given two groups, (''G'',∗) and (''H'', ·), a group homomorphism from (''G'',∗) to (''H'', ·) is a function ''h'' : ''G'' → ''H'' such that for all ''u'' and ''v'' in ''G'' it holds that : h(u*v) = h(u) \cdot h(v) whe ...
s from fundamental groups of complete smooth curves over finitely-generated fields k to the
Galois group In mathematics, in the area of abstract algebra known as Galois theory, the Galois group of a certain type of field extension is a specific group associated with the field extension. The study of field extensions and their relationship to the pol ...
of k. * 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 In algebraic geometry, a projective variety is an algebraic variety that is a closed subvariety of a projective space. That is, it is the zero-locus in \mathbb^n of some finite family of homogeneous polynomials that generate a prime ideal, th ...
is fixed by an action of half of the
Virasoro algebra In mathematics, the Virasoro algebra is a complex Lie algebra and the unique nontrivial central extension of the Witt algebra. It is widely used in two-dimensional conformal field theory and in string theory. It is named after Miguel Ángel ...
. * Zariski multiplicity conjecture on the topological equisingularity and equimultiplicity of varieties at singular points * Are infinite sequences of flips possible in dimensions greater than 3? *
Resolution of singularities In algebraic geometry, the problem of resolution of singularities asks whether every algebraic variety ''V'' has a resolution, which is a non-singular variety ''W'' with a Proper morphism, proper birational map ''W''→''V''. For varieties ov ...
in characteristic p


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? * The Erdős–Oler conjecture: when n is a triangular number, packing n-1 circles in an equilateral triangle requires a triangle of the same size as packing n circles. * The disk covering problem abount finding the smallest
real number In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
r(n) such that n disks of radius r(n) can be arranged in such a way as to cover the
unit disk In mathematics, the open unit disk (or disc) around ''P'' (where ''P'' is a given point in the plane), is the set of points whose distance from ''P'' is less than 1: :D_1(P) = \.\, The closed unit disk around ''P'' is the set of points whose d ...
. * The kissing number problem for dimensions other than 1, 2, 3, 4, 8 and 24 * Reinhardt's conjecture: the smoothed octagon has the lowest maximum packing density of all centrally-symmetric convex plane sets * 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? * Ulam's packing conjecture about the identity of the worst-packing convex solid * The Tammes problem for numbers of nodes greater than 14 (except 24).


Differential geometry

* 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 Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are ''Euclidean spaces ...
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 In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic) is a topological invariant, a number that describes a topological space's ...
of a
compact Compact as used in politics may refer broadly to a pact or treaty; in more specific cases it may refer to: * Interstate compact, a type of agreement used by U.S. states * Blood compact, an ancient ritual of the Philippines * Compact government, a t ...
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. * 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 * The Hopf conjectures relating the curvature and Euler characteristic of higher-dimensional Riemannian manifolds * Osserman conjecture: that every Osserman manifold is either flat or locally isometric to a rank-one symmetric space * Yau's conjecture on the first eigenvalue that the first
eigenvalue In linear algebra, an eigenvector ( ) or characteristic vector is a vector that has its direction unchanged (or reversed) by a given linear transformation. More precisely, an eigenvector \mathbf v of a linear transformation T is scaled by a ...
for the Laplace–Beltrami operator on an embedded minimal hypersurface of S^ is n.


Discrete geometry

* The big-line-big-clique conjecture on the existence of either many collinear points or many mutually visible points in large planar point sets * The Hadwiger conjecture on covering ''n''-dimensional convex bodies with at most 2''n'' smaller copies * Solving the happy ending problem for arbitrary n *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 In elementary geometry, a polytope is a geometric object with Flat (geometry), flat sides (''Face (geometry), faces''). Polytopes are the generalization of three-dimensional polyhedron, polyhedra to any number of dimensions. Polytopes may exist ...
.. * The Kobon triangle problem on triangles in line arrangements * The Kusner conjecture: at most 2d points can be equidistant in L^1 spaces * The McMullen problem on projectively transforming sets of points into convex position * Opaque forest problem on finding opaque sets for various planar shapes * How many unit distances can be determined by a set of points in the Euclidean plane? * Finding matching upper and lower bounds for ''k''-sets and halving lines * Tripod packing: how many tripods can have their apexes packed into a given cube?


Euclidean geometry

* The Atiyah conjecture on configurations on the invertibility of a certain n-by-n matrix depending on n points in \mathbb^ * 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 *
Borromean rings In mathematics, the Borromean rings are three simple closed curves in three-dimensional space that are link (knot theory), topologically linked and cannot be separated from each other, but that break apart into two unknotted and unlinked loops wh ...
— are there three unknotted space curves, not all three circles, which cannot be arranged to form this link? * Connelly’s blooming conjecture: Does every net of a convex polyhedron have a blooming? * Danzer's problem and Conway's dead fly problem – do Danzer sets of bounded density or bounded separation exist? *
Dissection into orthoschemes In geometry, it is an unsolved conjecture of Hugo Hadwiger that every simplex can be Dissection problem, dissected into Schläfli orthoscheme, orthoschemes, using a number of orthoschemes bounded by a function of the dimension of the simplex. If tr ...
– is it possible for simplices of every dimension? * Ehrhart's volume conjecture: a convex body K in n dimensions containing a single lattice point in its interior as its
center of mass In physics, the center of mass of a distribution of mass in space (sometimes referred to as the barycenter or balance point) is the unique point at any given time where the weight function, weighted relative position (vector), position of the d ...
cannot have volume greater than (n+1)^/n! * Falconer's conjecture: sets of Hausdorff dimension greater than d/2 in \mathbb^d must have a distance set of nonzero
Lebesgue measure In measure theory, a branch of mathematics, the Lebesgue measure, named after French mathematician Henri Lebesgue, is the standard way of assigning a measure to subsets of higher dimensional Euclidean '-spaces. For lower dimensions or , it c ...
* 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 The inscribed square problem, also known as the square peg problem or the Toeplitz conjecture, is an unsolved question in geometry: ''Does every plane simple closed curve contain all four vertices of some square?'' This is true if the curve is ...
, also known as Toeplitz' conjecture and the square peg problem – does every Jordan curve have an inscribed square? * The Kakeya conjecture – do n-dimensional sets that contain a unit line segment in every direction necessarily have Hausdorff dimension and Minkowski dimension equal to n? * 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 * Lebesgue's universal covering problem on the minimum-area convex shape in the plane that can cover any shape of diameter one * Mahler's conjecture on the product of the volumes of a centrally symmetric convex body and its polar. * 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? * Does every convex polyhedron have Rupert's property? * Shephard's problem (a.k.a. Dürer's conjecture) – does every
convex polyhedron In geometry, a polyhedron (: polyhedra or polyhedrons; ) is a three-dimensional figure with flat polygonal faces, straight edges and sharp corners or vertices. The term "polyhedron" may refer either to a solid figure or to its boundary su ...
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 n mutually-repelling particles on a unit sphere? * Convex
uniform 5-polytope In geometry, a uniform 5-polytope is a five-dimensional uniform polytope. By definition, a uniform 5-polytope is vertex-transitive and constructed from uniform 4-polytope Facet (geometry), facets. The complete set of convex uniform 5-polytopes ...
s – find and classify the complete set of these shapes


Graph theory


Algebraic graph theory

* Babai's problem: which groups are Babai invariant groups? * Brouwer's conjecture on upper bounds for sums of
eigenvalues In linear algebra, an eigenvector ( ) or characteristic vector is a vector that has its direction unchanged (or reversed) by a given linear transformation. More precisely, an eigenvector \mathbf v of a linear transformation T is scaled by a ...
of Laplacians of graphs in terms of their number of edges


Games on graphs

* Does there exist a graph G such that the dominating number \gamma(G) equals the eternal dominating number \gamma(G) of G and \gamma(G) is less than the clique covering number of G? * Graham's pebbling conjecture on the pebbling number of Cartesian products of graphs * Meyniel's conjecture that cop number is O(\sqrt n) * Suppose Alice has a winning strategy for the vertex coloring game on a graph G with k colors. Does she have one for k+1 colors?


Graph coloring and labeling

* The 1-factorization conjecture that if n is odd or even and k \geq n, n - 1 respectively, then a k- regular graph with 2n 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 * The Earth–Moon problem: what is the maximum chromatic number of biplanar graphs? * The Erdős–Faber–Lovász conjecture on coloring unions of cliques * 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 * The Hadwiger conjecture relating coloring to clique minors * The Hadwiger–Nelson problem on the chromatic number of unit distance graphs * Jaeger's Petersen-coloring conjecture: every bridgeless cubic graph has a cycle-continuous mapping to the Petersen graph * The list coloring conjecture: for every graph, the list chromatic index equals the chromatic index * The overfull conjecture that a graph with maximum degree \Delta(G) \geq n/3 is class 2 if and only if it has an overfull subgraph S satisfying \Delta(S) = \Delta(G). * The total coloring conjecture of Behzad and Vizing that the total chromatic number is at most two plus the maximum degree


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 * Conway's thrackle conjecture that thrackles cannot have more edges than vertices * The GNRS conjecture on whether minor-closed graph families have \ell_1 embeddings with bounded distortion * Harborth's conjecture: every planar graph can be drawn with integer edge lengths * Negami's conjecture on projective-plane embeddings of graphs with planar covers * The strong Papadimitriou–Ratajczak conjecture: every polyhedral graph has a convex greedy embedding * Turán's brick factory problem – Is there a drawing of any complete bipartite graph with fewer crossings than the number given by Zarankiewicz? * Universal point sets of subquadratic size for planar graphs


Restriction of graph parameters

* Conway's 99-graph problem: does there exist a strongly regular graph with parameters (99,14,1,2)? * Degree diameter problem: given two positive integers d, k, what is the largest graph of diameter k such that all vertices have degrees at most d? * Jørgensen's conjecture that every 6-vertex-connected ''K''6-minor-free graph is an apex graph * Does a Moore graph with girth 5 and degree 57 exist? * Do there exist infinitely many strongly regular geodetic graphs, or any strongly regular geodetic graphs that are not Moore graphs?


Subgraphs

* Barnette's conjecture: every cubic bipartite three-connected planar graph has a Hamiltonian cycle * Gilbert–Pollack conjecture on the Steiner ratio of the Euclidean plane that the Steiner ratio is \sqrt/2 * Chvátal's toughness conjecture, that there is a number such that every -tough graph is Hamiltonian * The cycle double cover conjecture: every bridgeless graph has a family of cycles that includes each edge twice * The Erdős–Gyárfás conjecture on cycles with power-of-two lengths in cubic graphs * The Erdős–Hajnal conjecture on large cliques or independent sets in graphs with a forbidden induced subgraph * The linear arboricity conjecture on decomposing graphs into disjoint unions of paths according to their maximum degree * The Lovász conjecture on Hamiltonian paths in symmetric graphs * 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. * What is the largest possible pathwidth of an -vertex cubic graph? * The reconstruction conjecture and new digraph reconstruction conjecture on whether a graph is uniquely determined by its vertex-deleted subgraphs. * The snake-in-the-box problem: what is the longest possible induced path in an n-dimensional
hypercube In geometry, a hypercube is an ''n''-dimensional analogue of a square ( ) and a cube ( ); the special case for is known as a ''tesseract''. It is a closed, compact, convex figure whose 1- skeleton consists of groups of opposite parallel l ...
graph? * Sumner's conjecture: does every (2n-2)-vertex tournament contain as a subgraph every n-vertex oriented tree? * Szymanski's conjecture: every
permutation In mathematics, a permutation of a set can mean one of two different things: * an arrangement of its members in a sequence or linear order, or * the act or process of changing the linear order of an ordered set. An example of the first mean ...
on the n-dimensional doubly-
directed Direct may refer to: Mathematics * Directed set, in order theory * Direct limit of (pre), sheaves * Direct sum of modules, a construction in abstract algebra which combines several vector spaces Computing * Direct access (disambiguation), a ...
hypercube graph In graph theory, the hypercube graph is the graph formed from the vertices and edges of an -dimensional hypercube. For instance, the cubical graph, cube graph is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube. has ...
can be routed with edge-disjoint paths. * Tuza's conjecture: if the maximum number of disjoint triangles is \nu, can all triangles be hit by a set of at most 2\nu edges? * Vizing's conjecture on the
domination number Domination or dominant may refer to: Society * World domination, structure where one dominant power governs the planet * Colonialism in which one group (usually a nation) invades another region for material gain or to eliminate competition * Ch ...
of cartesian products of graphs * 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? *Characterise (non-) word-representable
planar graph In graph theory, a planar graph is a graph (discrete mathematics), graph that can be graph embedding, embedded in the plane (geometry), plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. ...
s *Characterise word-representable graphs in terms of (induced) forbidden subgraphs. *Characterise word-representable near-triangulations containing the complete graph ''K''4 (such a characterisation is known for ''K''4-free planar graphs) *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 *Is it true that out of all bipartite graphs, crown graphs require longest word-representants? *Is the
line graph In the mathematics, mathematical discipline of graph theory, the line graph of an undirected graph is another graph that represents the adjacencies between edge (graph theory), edges of . is constructed in the following way: for each edge i ...
of a non- word-representable graph always non- word-representable? *Which (hard) problems on graphs can be translated to words representing them and solved on words (efficiently)?


Miscellaneous graph theory

* The implicit graph conjecture on the existence of implicit representations for slowly-growing hereditary families of graphs * 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? * Sidorenko's conjecture on homomorphism densities of graphs in graphons * Tutte's conjectures: ** every bridgeless graph has a nowhere-zero 5-flow ** every Petersen- minor-free bridgeless graph has a nowhere-zero 4-flow * 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

* The Cherlin–Zilber conjecture: A simple group whose first-order theory is stable in \aleph_0 is a simple algebraic group over an algebraically closed field. * Generalized star height problem: can all
regular language In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science (as opposed to ...
s be expressed using generalized regular expressions with limited nesting depths of
Kleene star In mathematical logic and theoretical computer science, the Kleene star (or Kleene operator or Kleene closure) is a unary operation on a Set (mathematics), set to generate a set of all finite-length strings that are composed of zero or more repe ...
s? * 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 \aleph_1-saturated models of a countable theory. * Shelah's categoricity conjecture for L_: 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 \lambda there exists a cardinal \mu(\lambda) such that if an AEC ''K'' with LS(''K'') \le \lambda is categorical in a cardinal above \mu(\lambda) then it is categorical in all cardinals above \mu(\lambda). * 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 A theory is a systematic and rational form of abstract thinking about a phenomenon, or the conclusions derived from such thinking. It involves contemplative and logical reasoning, often supported by processes such as observation, experimentation, ...
of the
real number In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
s 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 In mathematics, a Set (mathematics), set is countable if either it is finite set, finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function fro ...
models of a first-order complete theory in a countable
language Language is a structured system of communication that consists of grammar and vocabulary. It is the primary means by which humans convey meaning, both in spoken and signed language, signed forms, and may also be conveyed through writing syste ...
is either finite, \aleph_0, or 2^. * Assume ''K'' is the class of models of a countable first order theory omitting countably many
types Type may refer to: Science and technology Computing * Typing, producing text via a keyboard, typewriter, etc. * Data type, collection of values used for computations. * File type * TYPE (DOS command), a command to display contents of a file. * Ty ...
. If ''K'' has a model of cardinality \aleph_ 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 \aleph_n, 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 \mathbb_p decidable? of the field of polynomials over \mathbb? * 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.


Probability theory

* Ibragimov–Iosifescu conjecture for φ-mixing sequences


Number theory


General

* Beilinson's conjectures * Brocard's problem: are there any integer solutions to n! + 1 = m^ other than n = 4, 5, 7? * 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 In number theory, Euler's totient function counts the positive integers up to a given integer that are relatively prime to . It is written using the Greek letter phi as \varphi(n) or \phi(n), and may also be called Euler's phi function. In ot ...
have multiplicity greater than 1? * Casas-Alvero conjecture: if a polynomial of degree d defined over a field K of characteristic 0 has a factor in common with its first through d - 1-th derivative, then must f be the d-th power of a linear polynomial? * Catalan–Dickson conjecture on aliquot sequences: no
aliquot sequence In mathematics, an aliquot sequence is a sequence of positive integers in which each term is the sum of the proper divisors of the previous term. If the sequence reaches the number 1, it ends, since the sum of the proper divisors of 1 is 0. Def ...
s are infinite but non-repeating. * Erdős–Ulam problem: is there a
dense set In topology and related areas of mathematics, a subset ''A'' of a topological space ''X'' is said to be dense in ''X'' if every point of ''X'' either belongs to ''A'' or else is arbitrarily "close" to a member of ''A'' — for instance, the ...
of points in the plane all at rational distances from one-another? * Exponent pair conjecture: for all \varepsilon > 0, is the pair (\varepsilon, 1/2 + \varepsilon) 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? * Grimm's conjecture: each element of a set of consecutive
composite number A composite number is a positive integer that can be formed by multiplying two smaller positive integers. Accordingly it is a positive integer that has at least one divisor other than 1 and itself. Every positive integer is composite, prime numb ...
s can be assigned a distinct
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
that divides it. * Hall's conjecture: for any \varepsilon > 0, there is some constant c(\varepsilon) such that either y^2 = x^3 or , y^2 - x^3, > c(\varepsilon)x^. * Lehmer's totient problem: if \phi(n) divides n - 1, must n be prime? * Leopoldt's conjecture: a p-adic analogue of the regulator of an
algebraic number field In mathematics, an algebraic number field (or simply number field) is an extension field K of the field of rational numbers such that the field extension K / \mathbb has finite degree (and hence is an algebraic field extension). Thus K is a ...
does not vanish. * Mahler's 3/2 problem that no real number x has the property that the fractional parts of x(3/2)^n are less than 1/2 for all positive integers n. * ''n'' conjecture: a generalization of the ''abc'' conjecture to more than three integers. ** ''abc'' conjecture: for any \varepsilon > 0, \operatorname(abc)^ < c is true for only finitely many positive a, b, c such that a + b = c. ** Szpiro's conjecture: for any \varepsilon > 0, there is some constant C(\varepsilon) such that, for any elliptic curve E defined over \mathbb with minimal discriminant \Delta and conductor f, we have , \Delta, \leq C(\varepsilon) \cdot f^. * Newman's conjecture: the partition function satisfies any arbitrary congruence infinitely often. * 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 2^n - 1 is at most n - 1 plus the length of the shortest addition chain producing n. * Singmaster's conjecture: is there a finite upper bound on the multiplicities of the entries greater than 1 in
Pascal's triangle In mathematics, Pascal's triangle is an infinite triangular array of the binomial coefficients which play a crucial role in probability theory, combinatorics, and algebra. In much of the Western world, it is named after the French mathematician Bla ...
? * Vojta's conjecture on heights of points on algebraic varieties over
algebraic number field In mathematics, an algebraic number field (or simply number field) is an extension field K of the field of rational numbers such that the field extension K / \mathbb has finite degree (and hence is an algebraic field extension). Thus K is a ...
s. * Are there infinitely many
perfect number In number theory, a perfect number is a positive integer that is equal to the sum of its positive proper divisors, that is, divisors excluding the number itself. For instance, 6 has proper divisors 1, 2 and 3, and 1 + 2 + 3 = 6, so 6 is a perfec ...
s? *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 In mathematics, the amicable numbers are two different natural numbers related in such a way that the addition, sum of the proper divisors of each is equal to the other number. That is, ''s''(''a'')=''b'' and ''s''(''b'')=''a'', where ''s''(''n ...
which have opposite parity? * Are there any pairs of betrothed numbers which have same parity? * Are there any pairs of
relatively prime In number theory, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides does not divide , and vice versa. This is equiv ...
amicable numbers In mathematics, the amicable numbers are two different natural numbers related in such a way that the addition, sum of the proper divisors of each is equal to the other number. That is, ''s''(''a'')=''b'' and ''s''(''b'')=''a'', where ''s''(''n ...
? * Are there infinitely many
amicable numbers In mathematics, the amicable numbers are two different natural numbers related in such a way that the addition, sum of the proper divisors of each is equal to the other number. That is, ''s''(''a'')=''b'' and ''s''(''b'')=''a'', where ''s''(''n ...
? * Are there infinitely many betrothed numbers? * Are there infinitely many Giuga numbers? * Does every
rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (for example, The set of all ...
with an odd denominator have an odd greedy expansion? * Do any Lychrel numbers exist? * Do any odd
noncototient In number theory, a noncototient is a positive integer that cannot be expressed as the difference between a positive integer and the number of coprime integers below it. That is, , where stands for Euler's totient function In number theory ...
s 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? * Is \pi a normal number (i.e., is each digit 0–9 equally frequent)? * Are all irrational algebraic numbers normal? * Is 10 a solitary number? * Can a 3×3
magic square In mathematics, especially History of mathematics, historical and recreational mathematics, a square array of numbers, usually positive integers, is called a magic square if the sums of the numbers in each row, each column, and both main diago ...
be constructed from 9 distinct perfect square numbers?


Algebraic number theory

* 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 n, to assign a sequence of
natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
s to each
real number In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
such that the sequence for x is eventually periodic if and only if x is algebraic of degree n? * Hilbert's eleventh problem: classify
quadratic form In mathematics, a quadratic form is a polynomial with terms all of degree two (" form" is another name for a homogeneous polynomial). For example, 4x^2 + 2xy - 3y^2 is a quadratic form in the variables and . The coefficients usually belong t ...
s over
algebraic number field In mathematics, an algebraic number field (or simply number field) is an extension field K of the field of rational numbers such that the field extension K / \mathbb has finite degree (and hence is an algebraic field extension). Thus K is a ...
s. * Hilbert's ninth problem: find the most general reciprocity law for the norm residues of k-th order in a general
algebraic number field In mathematics, an algebraic number field (or simply number field) is an extension field K of the field of rational numbers such that the field extension K / \mathbb has finite degree (and hence is an algebraic field extension). Thus K is a ...
, where k is a power of a prime. * Hilbert's twelfth problem: extend the Kronecker–Weber theorem on Abelian extensions of \mathbb to any base number field. * Kummer–Vandiver conjecture: primes p do not divide the class number of the maximal real subfield of the p-th
cyclotomic field In algebraic number theory, a cyclotomic field is a number field obtained by adjoining a complex root of unity to \Q, the field of rational numbers. Cyclotomic fields played a crucial role in the development of modern algebra and number theory ...
. * Lang and Trotter's conjecture on supersingular primes that the number of supersingular primes less than a constant X is within a constant multiple of \sqrt/\ln * Selberg's 1/4 conjecture: the
eigenvalues In linear algebra, an eigenvector ( ) or characteristic vector is a vector that has its direction unchanged (or reversed) by a given linear transformation. More precisely, an eigenvector \mathbf v of a linear transformation T is scaled by a ...
of the
Laplace operator In mathematics, the Laplace operator or Laplacian is a differential operator given by the divergence of the gradient of a Scalar field, scalar function on Euclidean space. It is usually denoted by the symbols \nabla\cdot\nabla, \nabla^2 (where \ ...
on Maass wave forms of congruence subgroups are at least 1/4. * Stark conjectures (including Brumer–Stark conjecture) * Characterize all algebraic number fields that have some power basis.


Additive number theory

* 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 B is an additive basis of order 2, then the number of ways that positive integers n can be expressed as the sum of two numbers in B must tend to infinity as n tends to infinity. * Gilbreath's conjecture on consecutive applications of the unsigned forward difference operator to the sequence of
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
s. *
Goldbach's conjecture Goldbach's conjecture is one of the oldest and best-known list of unsolved problems in mathematics, unsolved problems in number theory and all of mathematics. It states that every even and odd numbers, even natural number greater than 2 is the ...
: every even natural number greater than 2 is the sum of two
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
s. * Lander, Parkin, and Selfridge conjecture: if the sum of m k-th powers of positive integers is equal to a different sum of n k-th powers of positive integers, then m + n \geq k. * Lemoine's conjecture: all odd integers greater than 5 can be represented as the sum of an odd
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
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 \ * 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)


Analytic number theory

* Grand Riemann hypothesis: do the nontrivial zeros of all
automorphic L-function In mathematics, an automorphic ''L''-function is a function ''L''(''s'',π,''r'') of a complex variable ''s'', associated to an automorphic representation π of a reductive group ''G'' over a global field and a finite-dimensional complex represent ...
s lie on the critical line 1/2 + it with real t? ** Generalized Riemann hypothesis: do the nontrivial zeros of all
Dirichlet L-function In mathematics, a Dirichlet L-series is a function of the form :L(s,\chi) = \sum_^\infty \frac. where \chi is a Dirichlet character and s a complex variable with real part greater than 1 . It is a special case of a Dirichlet series. By anal ...
s lie on the critical line 1/2 + it with real t? ***
Riemann hypothesis In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part . Many consider it to be the most important unsolved problem in pure ...
: do the nontrivial zeros of the Riemann zeta function lie on the critical line 1/2 + it with real t? * Hardy–Littlewood zeta function conjectures * Keating–Snaith conjecture concerning the asymptotics of an integral involving the Riemann zeta function * Hilbert–Pólya conjecture: the nontrivial zeros of the Riemann zeta function correspond to
eigenvalues In linear algebra, an eigenvector ( ) or characteristic vector is a vector that has its direction unchanged (or reversed) by a given linear transformation. More precisely, an eigenvector \mathbf v of a linear transformation T is scaled by a ...
of a self-adjoint operator. * Lindelöf hypothesis that for all \varepsilon > 0, \zeta(1/2 + it) = o(t^\varepsilon) ** The density hypothesis for zeroes of the Riemann zeta function * 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. * Piltz divisor problem on bounding \Delta_k(x) = D_k(x) - xP_k(\log(x)) ** Dirichlet's divisor problem: the specific case of the Piltz divisor problem for k = 1 * Do Siegel zeros exist? * Find the value of the
De Bruijn–Newman constant The de Bruijn–Newman constant, denoted by \Lambda and named after Nicolaas Govert de Bruijn and Charles Michael Newman, is a mathematical constant defined via the zeros of a certain function H(\lambda,z), where \lambda is a real parameter ...
.


Computational number theory

* Can
integer factorization In mathematics, integer factorization is the decomposition of a positive integer into a product of integers. Every positive integer greater than 1 is either the product of two or more integer factors greater than 1, in which case it is a comp ...
be done in polynomial time?


Diophantine approximation and transcendental number theory

* Littlewood conjecture: for any two real numbers \alpha, \beta, \liminf_ n\,\Vert n\alpha\Vert\,\Vert n\beta\Vert = 0, where \Vert x\Vert is the distance from x to the nearest integer. * Schanuel's conjecture on the transcendence degree of certain field extensions of the rational numbers. In particular: Are \pi and e algebraically independent? Which nontrivial combinations of transcendental numbers (such as e + \pi, e\pi, \pi^e, \pi^, e^e) are themselves transcendental? * The four exponentials conjecture: the transcendence of at least one of four exponentials of combinations of irrationals * Are Euler's constant \gamma and Catalan's constant G irrational? Are they transcendental? Is Apéry's constant \zeta(3) transcendental? * Which transcendental numbers are (exponential) periods? * How well can non-quadratic irrational numbers be approximated? What is the irrationality measure of specific (suspected) transcendental numbers such as \pi and \gamma? * Which irrational numbers have simple continued fraction terms whose
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
converges to Khinchin's constant?


Diophantine equations

* Beal's conjecture: for all integral solutions to A^x + B^y = C^z where x, y, z > 2, all three numbers A, B, C 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 1^1 + 2^1 = 3^1 the only solution to the Erdős–Moser equation? * Erdős–Straus conjecture: for every n \geq 2, there are positive integers x, y, z such that 4/n = 1/x + 1/y + 1/z. * Fermat–Catalan conjecture: there are finitely many distinct solutions (a^m, b^n, c^k) to the equation a^m + b^n = c^k with a, b, c being positive
coprime integers In number theory, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides does not divide , and vice versa. This is equiva ...
and m, n, k being positive integers satisfying 1/m + 1/n + 1/k < 1. * Goormaghtigh conjecture on solutions to (x^m - 1)/(x - 1) = (y^n - 1)/(y - 1) where x > y > 1 and m, n > 2. * The uniqueness conjecture for Markov numbers that every Markov number is the largest number in exactly one normalized solution to the Markov
Diophantine equation ''Diophantine'' means pertaining to the ancient Greek mathematician Diophantus. A number of concepts bear this name: *Diophantine approximation In number theory, the study of Diophantine approximation deals with the approximation of real n ...
. * Pillai's conjecture: for any A, B, C, the equation Ax^m - By^n = C has finitely many solutions when m, n are not both 2. * Which integers can be written as the sum of three perfect cubes? * Can every integer be written as a sum of four perfect cubes?


Prime numbers

* Agoh–Giuga conjecture on the Bernoulli numbers that p is prime if and only if pB_ \equiv -1 \pmod p * Agrawal's conjecture that given coprime positive integers n and r, if (X - 1)^n \equiv X^n - 1 \pmod, then either n is prime or n^ \equiv 1 \pmod * Artin's conjecture on primitive roots that if an integer is neither a perfect square nor -1, then it is a primitive root modulo infinitely many
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
s p * Brocard's conjecture: there are always at least 4
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
s between consecutive squares of prime numbers, aside from 2^ and 3^. * Bunyakovsky conjecture: if an integer-coefficient polynomial f has a positive leading coefficient, is irreducible over the integers, and has no common factors over all f(x) where x is a positive integer, then f(x) 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 a_1 + b_1 n, \ldots, a_k + b_k n with each b_i \geq 1, there are infinitely many n for which all forms are prime, unless there is some congruence condition preventing it. * Dubner's conjecture: every even number greater than 4208 is the sum of two primes which both have a
twin Twins are two offspring produced by the same pregnancy.MedicineNet > Definition of Twin Last Editorial Review: 19 June 2000 Twins can be either ''monozygotic'' ('identical'), meaning that they develop from one zygote, which splits and forms two ...
. * Elliott–Halberstam conjecture on the distribution of
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
s in arithmetic progressions. * Erdős–Mollin–Walsh conjecture: no three consecutive numbers are all powerful. * Feit–Thompson conjecture: for all distinct
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
s p and q, (p^q - 1)/(p - 1) does not divide (q^p - 1)/(q - 1) * 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 number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
s greater than 2 are the sum of two
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
s. ** Legendre's conjecture: for every positive integer n, there is a prime between n^ and (n+1)^. ** Twin prime#Twin prime conjecture, Twin prime conjecture: there are infinitely many twin primes. ** Are there infinitely many primes of the form n^ + 1? * Problems associated to Linnik's theorem * Mersenne conjectures#New Mersenne conjecture, New Mersenne conjecture: for any odd
natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
p, if any two of the three conditions p = 2^k \pm 1 or p = 4^k \pm 3, 2^p - 1 is prime, and (2^ + 1)/3 is prime are true, then the third condition is also true. * Polignac's conjecture: for all positive even numbers n, there are infinitely many prime gaps of size n. * Schinzel's hypothesis H that for every finite collection \ of nonconstant irreducible polynomials over the integers with positive leading coefficients, either there are infinitely many positive integers n for which f_1(n), \ldots, f_k(n) are all primes, or there is some fixed divisor m > 1 which, for all n, divides some f_i(n). * Sierpiński number, Selfridge's conjecture: is 78,557 the lowest Sierpiński number? * Does the Wolstenholme's theorem#The converse as a conjecture, converse of Wolstenholme's theorem hold for all natural numbers? * Are all Euclid numbers Square-free integer, square-free? * Are all Fermat numbers Square-free integer, square-free? * Are all Mersenne numbers of prime index Square-free integer, square-free? * Are there any composite ''c'' satisfying 2''c'' − 1 ≡ 1 (mod ''c''2)? * 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 number, Cullen primes? * Are there infinitely many Euclid number, Euclid primes? * Are there infinitely many Fibonacci primes? * Are there infinitely many Euclid number#Generalization, Kummer primes? * Are there infinitely many Kynea primes? * Are there infinitely many Lucas number#Lucas primes, Lucas primes? * Are there infinitely many Mersenne primes (Lenstra–Pomerance–Wagstaff conjecture); equivalently, infinitely many even
perfect number In number theory, a perfect number is a positive integer that is equal to the sum of its positive proper divisors, that is, divisors excluding the number itself. For instance, 6 has proper divisors 1, 2 and 3, and 1 + 2 + 3 = 6, so 6 is a perfec ...
s? * Are there infinitely many Newman–Shanks–Williams primes? * Are there infinitely many palindromic primes to every base? * Are there infinitely many Pell number, Pell primes? * Are there infinitely many Pierpont primes? * Are there infinitely many prime quadruplets? * Are there infinitely many prime triplets? * Regular prime, Siegel's conjecture: are there infinitely many regular primes, and if so is their natural density as a subset of all primes e^? * 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 number#Woodall primes, Woodall primes? * Can a prime ''p'' satisfy 2^\equiv 1\pmod and 3^\equiv 1\pmod simultaneously? * 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''2)? * For any given integer ''b'' which is not a perfect power and not of the form −4''k''4 for integer ''k'', are there infinitely many repunit primes to base ''b''? * For any given integers k\geq 1, b\geq 2, c\neq 0, with and are there infinitely many primes of the form (k\times b^n+c)/\gcd(k+c,b-1) with integer ''n'' ≥ 1? * Is every Fermat number 2^ + 1 composite for n > 4? * Is 509,203 the lowest Riesel number?


Set theory

Note: These conjectures are about model theory, models of Zermelo-Frankel set theory with axiom of choice, choice, and may not be able to be expressed in models of other set theories such as the various constructive set theory, constructive set theories or non-wellfounded set theory. * (W. Hugh Woodin, Woodin) Does the generalized continuum hypothesis below a strongly compact cardinal imply the generalized continuum hypothesis everywhere? * Does the generalized continuum hypothesis entail Diamondsuit, ) for every singular cardinal \lambda? * Does the generalized continuum hypothesis imply the existence of an Suslin tree, ℵ2-Suslin tree? * If ℵω is a strong limit cardinal, is 2^ < \aleph_ (see Singular cardinals hypothesis)? The best bound, ℵω4, was obtained by Saharon Shelah, Shelah using his PCF theory. * The problem of finding the ultimate core model, one that contains all Large cardinal property, large cardinals. * W. Hugh Woodin, Woodin's Ω-logic, Ω-conjecture: if there is a Class (set theory), 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 cardinal, Jónsson algebra on ℵω? * Is OCA (the open coloring axiom) consistent with 2^>\aleph_? * Reinhardt cardinals: Without assuming the axiom of choice, can a Reinhardt cardinal, nontrivial elementary embedding ''V''→''V'' exist?


Topology

* Baum–Connes conjecture: the Baum–Connes conjecture#Formulation, assembly map is an isomorphism. * Berge knot, Berge conjecture that the only Knot (mathematics), knots in the 3-sphere which admit lens space Dehn surgery, surgeries are Berge knots. * Bing–Borsuk conjecture: every n-dimensional Homogeneous space, homogeneous Retraction (topology), absolute neighborhood retract is a topological manifold. * Borel conjecture: Aspherical space, 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 space, locally compact topological group has a Continuous function, continuous, Group action#Remarkable properties of actions, faithful group action on a topological manifold, then the group must be a Lie group. * Mazur's conjectures * Novikov conjecture on the Homotopy#Invariance, homotopy invariance of certain
polynomial In mathematics, a polynomial is a Expression (mathematics), mathematical expression consisting of indeterminate (variable), indeterminates (also called variable (mathematics), variables) and coefficients, that involves only the operations of addit ...
s in the Pontryagin classes of a
manifold In mathematics, a manifold is a topological space that locally resembles Euclidean space near each point. More precisely, an n-dimensional manifold, or ''n-manifold'' for short, is a topological space with the property that each point has a N ...
, arising from the fundamental group. * Quadrisecants of wild knots: it has been conjectured that wild knots always have infinitely many quadrisecants. * Ravenel conjectures, Telescope conjecture: the last of Ravenel's conjectures in stable homotopy theory to be resolved. * Unknotting problem: can unknots be recognized in Time complexity#Polynomial time, polynomial time? * Volume conjecture relating quantum invariants of Knot (mathematics), knots to the
hyperbolic geometry In mathematics, hyperbolic geometry (also called Lobachevskian geometry or János Bolyai, Bolyai–Nikolai Lobachevsky, Lobachevskian geometry) is a non-Euclidean geometry. The parallel postulate of Euclidean geometry is replaced with: :For a ...
of their knot complements. * Whitehead conjecture: every Connectedness, connected CW complex#Inductive construction of CW complexes, subcomplex of a two-dimensional Aspherical space, aspherical CW complex is aspherical. * Zeeman conjecture: given a finite Contractible space, contractible two-dimensional CW complex K, is the space K \times [0, 1] Collapse (topology), collapsible? * Nearby Lagrangian conjecture: prove or find a counter-example to the statement: Any closed exact Lagrangian submanifold of the cotangent bundle of a closed manifold is Symplectomorphism#Flows, Hamiltonian isotopic to the Vector_bundle#Sections_and_locally_free_sheaves, zero section.


Problems solved since 1995


Algebra

* Uniform boundedness conjecture for rational points#Mazur's conjecture B, Mazur's conjecture B (Vessilin Dimitrov, Ziyang Gao, and Philipp Habegger, 2020) * Suita conjecture (Qi'an Guan and Xiangyu Zhou, 2015) * Torsion conjecture (Loïc Merel, 1996) * Carlitz–Wan conjecture (Hendrik Lenstra, 1995) * Serre's multiplicity conjectures#Nonnegativity, Serre's nonnegativity conjecture (Ofer Gabber, 1995)


Analysis

* Kadison–Singer problem (Adam Marcus (mathematician), Adam Marcus, Daniel Spielman and Nikhil Srivastava, 2013) (and the Hans Georg Feichtinger#Feichtinger's conjecture, Feichtinger's conjecture, Anderson's paving conjectures, Weaver's discrepancy theoretic KS_r and KS'_r conjectures, Bourgain-Tzafriri conjecture and R_\varepsilon-conjecture) * Ahlfors measure conjecture (Ian Agol, 2004) * Gradient conjecture (Krzysztof Kurdyka, Tadeusz Mostowski, Adam Parusinski, 1999)


Combinatorics

* Erdős sumset conjecture (Joel Moreira, Florian Richter, Donald Robertson, 2018) * Simplicial sphere, 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) * Hirsch conjecture (Francisco Santos Leal, 2010) * Ira Gessel#Gessel's lattice path conjecture, Gessel's lattice path conjecture (Manuel Kauers, Christoph Koutschan, and Doron Zeilberger, 2009) * Stanley–Wilf conjecture (Gábor Tardos and Adam Marcus (mathematician), Adam Marcus, 2004) (and also the Alon–Friedgut conjecture) * Kemnitz's conjecture (Christian Reiher, 2003, Carlos di Fiore, 2003) * Cameron–Erdős conjecture (Ben J. Green, 2003, Alexander Sapozhenko, 2003)


Dynamical systems

* Zimmer's conjecture (Aaron Brown, David Fisher, and Sebastián Hurtado-Salazar, 2017) * Painlevé conjecture (Jinxin Xue, 2014)


Game theory

* Existence of a non-terminating game of beggar-my-neighbour (Brayden Casella, 2024) * The angel problem (Various independent proofs, 2006)


Geometry


21st century

* Einstein problem (David Smith, Joseph Samuel Myers, Craig S. Kaplan, Chaim Goodman-Strauss, 2024) * Maximal rank conjecture (Eric Larson, 2018) * Weibel's conjecture (Moritz Kerz, Florian Strunk, and Georg Tamme, 2018) * Yau's conjecture (Antoine Song, 2018) * Pentagonal tiling (Michaël Rao, 2017) * Willmore conjecture (Fernando Codá Marques and André Neves, 2012) * Erdős distinct distances problem (Larry Guth, Nets Katz, Nets Hawk Katz, 2011) * Squaring the plane, Heterogeneous tiling conjecture (squaring the plane) (Frederick V. Henle and James M. Henle, 2008) * Tameness conjecture (Ian Agol, 2004) * Ending lamination theorem (Jeffrey Brock, Jeffrey F. Brock, Richard Canary, Richard D. Canary, Yair Minsky, Yair N. Minsky, 2004) * Carpenter's rule problem (Robert Connelly, Erik Demaine, Günter Rote, 2003) * Lambda g conjecture (Carel Faber and Rahul Pandharipande, 2003) * Nagata's conjecture (Ivan Shestakov, Ualbai Umirbaev, 2003) * Double bubble conjecture (Michael Hutchings (mathematician), Michael Hutchings, Frank Morgan (mathematician), Frank Morgan, Manuel Ritoré, Antonio Ros, 2002)


20th century

* Honeycomb theorem (Thomas Callister Hales, 1999) * Lange's conjecture (Montserrat Teixidor i Bigas and Barbara Russo, 1999) * Bogomolov conjecture (Emmanuel Ullmo, 1998, Shou-Wu Zhang, 1998) * Kepler conjecture (Samuel Ferguson, Thomas Callister Hales, 1998) * Dodecahedral conjecture (Thomas Callister Hales, Sean McLaughlin, 1998)


Graph theory

* Kahn–Kalai conjecture (Jinyoung Park (mathematician), Jinyoung Park and Huy Tuan Pham, 2022) * Blankenship–Oporowski conjecture on the book thickness of subdivisions (Vida Dujmović, David Eppstein, Robert Hickingbotham, Pat Morin, and David Wood (mathematician), David Wood, 2021) *Graceful labeling, Ringel's conjecture that the complete graph K_ can be decomposed into 2n+1 copies of any tree with n edges (Richard Montgomery, Benny Sudakov, Alexey Pokrovskiy, 2020) *Disproof of Hedetniemi's conjecture on the chromatic number of tensor products of graphs (Yaroslav Shitov, 2019) * Kelmans–Seymour conjecture (Dawei He, Yan Wang, and Xingxing Yu, 2020) * Goldberg–Seymour conjecture (Guantao Chen, Guangming Jing, and Wenan Zang, 2019) * Babai's problem (Alireza Abdollahi, Maysam Zallaghi, 2015) * Alspach's conjecture (Darryn Bryant, Daniel Horsley, William Pettersson, 2014) * Alon–Saks–Seymour conjecture (Hao Huang, Benny Sudakov, 2012) * Read's conjecture, Read–Hoggar conjecture (June Huh, 2009) * Scheinerman's conjecture (Jeremie Chalopin and Daniel Gonçalves, 2009) * Erdős–Menger conjecture (Ron Aharoni, Eli Berger 2007) * Road coloring conjecture (Avraham Trahtman, 2007) * Robertson–Seymour theorem (Neil Robertson (mathematician), Neil Robertson, Paul Seymour (mathematician), Paul Seymour, 2004) * Strong perfect graph conjecture (Maria Chudnovsky, Neil Robertson (mathematician), Neil Robertson, Paul Seymour (mathematician), Paul Seymour and Robin Thomas (mathematician), Robin Thomas, 2002) * Toida's conjecture (Mikhail Muzychuk, Mikhail Klin, and Reinhard Pöschel, 2001) * Harary's conjecture on the integral sum number of complete graphs (Zhibo Chen, 1996)


Group theory

* Hanna Neumann conjecture (Joel Friedman, 2011, Igor Mineyev, 2011) * Density theorem for Kleinian groups, Density theorem (Hossein Namazi, Juan Souto, 2010) * 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) *Duffin–Schaeffer theorem (Dimitris Koukoulopoulos, James Maynard (mathematician), James Maynard, 2019) * Vinogradov's mean-value theorem#The conjectured form, Main conjecture in Vinogradov's mean-value theorem (Jean Bourgain, Ciprian Demeter, Larry Guth, 2015) * Goldbach's weak conjecture (Harald Helfgott, 2013) *Prime gap#Further results, Existence of bounded gaps between arbitrarily large primes (Yitang Zhang, Polymath Project, Polymath8, James Maynard (mathematician), James Maynard, 2013) * Sidon sequence, Sidon set problem (Javier Cilleruelo, Imre Z. Ruzsa, and Carlos Vinuesa, 2010) * Serre's modularity conjecture (Chandrashekhar Khare and Jean-Pierre Wintenberger, 2008) * Green–Tao theorem (Ben J. Green and Terence Tao, 2004) * Mihăilescu's theorem, Catalan's conjecture (Preda Mihăilescu, 2002) * Erdős–Graham problem (Ernest S. Croot III, 2000)


20th century

* Lafforgue's theorem (Laurent Lafforgue, 1998) * Fermat's Last Theorem (Andrew Wiles and Richard Taylor (mathematician), Richard Taylor, 1995)


Ramsey theory

* Burr–Erdős conjecture (Choongbum Lee, 2017) * Boolean Pythagorean triples problem (Marijn Heule, Oliver Kullmann, Victor W. Marek, 2016)


Theoretical computer science

*Decision tree model#Sensitivity conjecture, Sensitivity conjecture for Boolean functions (Hao Huang (mathematician), Hao Huang, 2019)


Topology

*Deciding whether the Conway knot is a slice knot (Lisa Piccirillo, 2020) * Virtual Haken conjecture (Ian Agol, Daniel Groves, Jason Manning, 2012) (and by work of Daniel Wise (mathematician), Daniel Wise also virtually fibered conjecture) * Hsiang–Lawson's conjecture (Simon Brendle, 2012) * Ehrenpreis conjecture (Jeremy Kahn, Vladimir Markovic, 2011) * Atiyah conjecture for groups with finite subgroups of unbounded order (Austin, 2009) * Cobordism hypothesis (Jacob Lurie, 2008) * Spherical space form conjecture ( Grigori Perelman, 2006) * Poincaré conjecture ( Grigori Perelman, 2002) * Geometrization conjecture, ( Grigori Perelman, series of preprints in 2002–2003) * Nikiel's conjecture (Mary Ellen Rudin, 1999) * Disproof of the Ganea conjecture (Iwase, 1997)


Uncategorised


2010s

* Erdős discrepancy problem (Terence Tao, 2015) * Umbral moonshine conjecture (John F. R. Duncan, Michael J. Griffin, Ken Ono, 2015) * Anderson conjecture on the finite number of diffeomorphism classes of the collection of 4-manifolds satisfying certain properties (Jeff Cheeger, Aaron Naber, 2014) * Gaussian correlation inequality (Thomas Royen, 2014) * Beck's conjecture on discrepancies of set systems constructed from three permutations (Alantha Newman, Aleksandar Nikolov (computer scientist), Aleksandar Nikolov, 2011) * Bloch–Kato conjecture (Vladimir Voevodsky, 2011) (and Quillen–Lichtenbaum conjecture and by work of Thomas Geisser (mathematician), Thomas Geisser and Marc Levine (mathematician), Marc Levine (2001) also Norm residue isomorphism theorem#Beilinson–Lichtenbaum conjecture, Beilinson–Lichtenbaum conjecture)


2000s

* Kauffman–Harary conjecture (Thomas Mattman, Pablo Solis, 2009) * Surface subgroup conjecture (Jeremy Kahn, Vladimir Markovic, 2009) * Normal scalar curvature conjecture and the Böttcher–Wenzel conjecture (Zhiqin Lu, 2007) * Nirenberg–Treves conjecture (Nils Dencker, 2005) * Peter Lax, Lax conjecture (Adrian Lewis (mathematician), Adrian Lewis, Pablo Parrilo, Motakuri Ramana, 2005) * The Langlands–Shelstad fundamental lemma (Ngô Bảo Châu and Gérard Laumon, 2004) * Milnor conjecture (K-theory), Milnor conjecture (Vladimir Voevodsky, 2003) * Kirillov's conjecture (Ehud Baruch, 2003) * Kouchnirenko's conjecture (Bertrand Haas, 2002) * n! conjecture, ''n''! conjecture (Mark Haiman, 2001) (and also Macdonald polynomials#The Macdonald positivity conjecture, Macdonald positivity conjecture) * Kato's conjecture (Pascal Auscher, Steve Hofmann, Michael Lacey (mathematician), Michael Lacey, Alan Gaius Ramsay McIntosh, Alan McIntosh, and Philipp Tchamitchian, 2001) * Deligne's conjecture on 1-motives (Luca Barbieri-Viale, Andreas Rosenschon, Morihiko Saito, 2001) * Modularity theorem (Christophe Breuil, Brian Conrad, Fred Diamond, and Richard Taylor (mathematician), Richard Taylor, 2001) * Erdős–Stewart conjecture (Florian Luca, 2001) * Berry–Robbins problem (Michael Atiyah, 2000)


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


Notes


References


Further reading


Books discussing problems solved since 1995

* * * *


Books discussing unsolved problems

* * * * * * * * * * *


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


MathPro Press. * * *
Unsolved Problems in Number Theory, Logic and Cryptography



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


* * Barry Simon'
15 Problems in Mathematical Physics
* Alexandre Eremenko
Unsolved problems in Function Theory

Erdos Problems collection
{{DEFAULTSORT:Unsolved problems in mathematics Unsolved problems in mathematics, Conjectures, Lists of unsolved problems, Mathematics Lists of problems