Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Question: I'm asking for a big list of not especially famous, long open problems that anyone can understand. Community wiki, so one problem per answer, please.

Motivation: I plan to use this list in my teaching, to motivate general education undergraduates, and early year majors, suggesting to them an idea of what research mathematicians do.

Meaning of "not too famous" Examples of problems that are too famous might be the Goldbach conjecture, the $3x+1$-problem, the twin-prime conjecture, or the chromatic number of the unit-distance graph on ${\Bbb R}^2$. Roughly, if there exists a whole monograph already dedicated to the problem (or narrow circle of problems), no need to mention it again here. I'm looking for problems that, with high probability, a mathematician working outside the particular area has never encountered.

Meaning of: anyone can understand The statement (in some appropriate, but reasonably terse formulation) shouldn't involve concepts beyond (American) K-12 mathematics. For example, if it weren't already too famous, I would say that the conjecture that "finite projective planes have prime power order" does have barely acceptable articulations.

Meaning of: long open The problem should occur in the literature or have a solid history as folklore. So I do not mean to call here for the invention of new problems or to collect everybody's laundry list of private-research-impeding unproved elementary technical lemmas. There should already exist at least of small community of mathematicians who will care if one of these problems gets solved.

I hope I have reduced subjectivity to a minimum, but I can't eliminate all fuzziness -- so if in doubt please don't hesitate to post!

To get started, here's a problem that I only learned of recently and that I've actually enjoyed describing to general education students.

http://en.wikipedia.org/wiki/Union-closed_sets_conjecture

Edit: I'm primarily interested in conjectures - yes-no questions, rather than classification problems, quests for algorithms, etc.

share|improve this question
1  
You might get more success if you sampled certain open problem lists and indicated which ones fit your list and which ones did not. I could mention various combinatorial problems such as integer complexity, determinant spectrum, covering design optimization, but I can't tell from your description if they would be suitable for you. Gerhard "They Are Suitable For Me" Paseman, 2012.06.21 –  Gerhard Paseman Jun 21 '12 at 19:11
2  
Here is some collection of some other "collect open problems" quests. on MO: mathoverflow.net/questions/96202/… PS Nice question ! PSPS may be add tag "open-problems" –  Alexander Chervov Jun 21 '12 at 20:53
1  
Nice question!! –  Suvrit Jun 22 '12 at 3:25
13  
To save the search for explanation of cryptic acronyms for those of us outside US, K-12 means high school. @Mahmud: You are using a wrong meaning of the word “problem”. The TSP is not an unproved mathematical statement, it is a computational task. –  Emil Jeřábek Jun 22 '12 at 12:05
10  
More precisely, K-12 means anything up to high school (K = Kindergarten, 12 = 12th grade, and K-12 covers this range). –  Henry Cohn Jun 22 '12 at 13:05

89 Answers 89

Does every nonseparating planar continuum have the fixed point property?

share|improve this answer
14  
For those of us whose general topology is rusty: what is the K-12 level formulation of this question? –  Yemon Choi Jun 21 '12 at 22:50
2  
Uniform continuity is a K-12 concept now? –  Douglas Zare Jun 22 '12 at 14:25
1  
Thanks Yemon. I agree with Doug that uniform continuity is not a stand alone K-12 concept. I mentioned it in order to avoid trying to decode its meaning in K-12 terms in this context, as follows: –  Paul Fabel Jun 22 '12 at 17:56
3  
f is a set of 4-tuples (x1,y1,x2,y2) so that each point (x1,y,1) in K appears precisely once as the 1st two coordinates of some point in f, and we also require that the last two coordinates of each point of f is a point of K. For each positive radius R we can find a smaller positive radius r(R) so that if (x1,y1,x2,y2) is in f, then if (w1,z1) is both in K and also in the disk of radius r(R) centered at (x1,y1), and if (w1,z1,w2,z2) is in f, then (w2,z2) is in the disk of radius R centered at (x2,y2). –  Paul Fabel Jun 22 '12 at 17:56

I think you could give an accessible K-12 formulation of the definition of a group (as a group of permutations, for instance) and of an integral group ring. The Zero Divisor Conjecture (Kaplansky, 1940) then states, in one version, that if $G$ is a torsion-free group then the group ring $\mathbb{Z}[G]$ has no zero divisors besides the number $0$.

share|improve this answer
1  
>I think you could give an accessible K-12 formulation of the definition of a group ... In any case this is perfect for my follow-up question which the net gods decided to close for the time being. –  David Feldman Jul 13 '12 at 5:36
1  
@David just wanted to write the same :) mathoverflow.net/questions/101169/… –  Alexander Chervov Jul 13 '12 at 6:18

From Rick Kenyon's open problem list:

What are the minimal number of squares needed to tile an $a \times b$ rectangle?

Kenyon showed the correct order is $\log a$ assuming $a/b$ is bounded with $b \leq a$. However, there is plenty of room for improvement in the constant factor, and an exact formula seems far, far away.

share|improve this answer

Is there such $n\in\mathbb{N}$ that ${^n\pi}\in\mathbb{N}$? (see tetration)

share|improve this answer
  • Is Hilbert's tenth problem for Diophantine equations in rational numbers decidable?
  • Is Hilbert's tenth problem for Diophantine equations of power $3$ decidable?
  • Is there a universal Diophantine equation of power $3$?
  • Is there a universal Diophantine equation containing less than $9$ variables? If so, what is the minimal number of variables? What minimal power can be achieved for that number of variables?
  • Is there a universal Diophantine equation that can be written using less than $100$ arithmetic operations (additions or multiplications)? If so, what is the minimal number of operations?
share|improve this answer

More than ten years ago I posed the following problem in a couple of math-related mailing lists:

Let $G_n$ be the graph with vertex set $\{1, 2, \dots, 2n\}$ such that $\{i,j\}$ is an edge if and only if $i+j$ is a prime number. Is it true that $G_n$ is eulerian for every $n \geq 2$?

It is a simple consequence of Bertrand's Postulate (there is always a prime between $k$ and $2k$) that $G_n$ is connected and has a perfect matching for every $n$.

The problem turned out to be an old one. I believe that some variation of it appears in Richard K. Guy's "Unsolved Problems in Number Theory" and according to this article, it was originally posed in the Journal of Recreational Mathematics in 1982.

Michael A. Jones and Leslie Cheteyan, "Two observation on unsolved problem #1046 on prime circles of $\{1, 2, . . . , 2m\}$", J. Recreational Mathematics Vol.35(1) (2006), 15--19.

The whole issue can be downloaded here:

http://www.baywood.com/comppdf/0022-412x.pdf

share|improve this answer

For integers $a_1, a_2, \ldots$, let $[a_1,a_2,\ldots]$ denote a continued fraction expansion $a_1 + \frac{1}{a_2 + \frac{1}{\ddots}}$.

Zaremba conjectured in 1972 that there must exist some constant $A > 1$ such that given any integer integer $d > 1$, you can always find some coprime $b$ such that if we write out the continued fraction expansion $b/d = [a_1, a_2, \ldots, a_k]$, all of the coefficients $a_i \leq A$.

Everyone seems to believe that $A = 5$, but we still don't know if such a constant exists. The current best known result (of Bourgain and Kontorovich) is that almost all integers $d$ permit a $b$ such that $b/d$ has the desired property (in their paper, they took $A = 50$, but I think that has been improved slightly since).

share|improve this answer

Alexander's Conjecture, and by extension a lot of open problems about combinatorial subdivision, are as easy to understand as they are maddening. To quote Melikhov:

Alexander's 80-year old problem of whether any two triangulations of a [3-dimensional] polyhedron have a common iterated-stellar subdivision. They are known to be related by a sequence of stellar subdivisions and inverse operations (Alexander), and to have a common subdivision (Whitehead). However the notion of an arbitrary subdivision is an affine, and not a purely combinatorial notion. It would be great if one could show at least that for some family of subdivisions definable in purely combinatorial terms (e.g. replacing a simplex by a simplicially collapsible or consructible ball), common subdivisions exist...

Stellar subdivision (and arbitrary subdivisions) can be explained to a K-12 student with a picture. For a stellar subdivision, choose a face F, take its midpoint, and connect it to all vertices of tetrahedra of which F is a face. For arbitrary subdivision, invent some silly triangulation of a simplex, and just plug it inside. refining heighbouring simplexes as needed.

share|improve this answer

The continuum hypothesis. Of course it's extremely famous, but everyone thinks it's resolved. I was astonished to find out that some serious set theorists apparently consider it (I mean in the present, decades past Cohen's proof) to be an important open problem that people should be working on solving (for some meaning of "solve").

P. Koellner ( http://logic.harvard.edu/EFI_CH.pdf ) describes some current approaches.

share|improve this answer
1  
You seem to allude that it has not been resolved yet. But in that case you should explain what you mean by that. On the other hand, the continuum hypothesis is so well-known that it does not fit to the question. –  Martin Brandenburg Jul 19 '12 at 12:17
5  
By the way, I think your statement that "everyone thinks it's resolved" is a little misleading. Maybe it would be better to say it this way: "most people think there's nothing left to say about it, because it's been proven independent of ZFC." –  Vectornaut Jul 22 '12 at 18:26

The following problem is very well-known among algebraic geometers:

Does there exist a cubic 4-fold that is not rational?

It's probably not well-known outside of algebraic geometry, even though it can easily be explained in every elementary terms:

Does there exist a polynomial equation $F$ of degree three in five variables with the following property: Let $X \subset \mathbb C^5$ be the solution set of $F = 0$. Then there exists no chart $U \subset \mathbb C^4, \phi \colon U \to X$ such that $\phi$ is defined by rational functions (i.e., quotients of polynomials).

share|improve this answer
1  
Cool ! what are the references for current state of art ? –  Alexander Chervov Jul 24 '12 at 9:57
1  
Basically nothing is known. On the other hand, it is easy to construct cubics that are rationals - e.g. cubics containing two planes. There are two conjectural descriptions of the locus of rational cubics inside the moduli space of cubics: one is due to Hassett and Harris; math.sunysb.edu/Videos/AGNES/video.php?f=04-Harris is video of a talk by Harris on the question; for Hassett's related results search "Hassett cubic fourfolds" on google scholar. Kuznetsov has a conjecture in terms of derived categories, the reference is: front.math.ucdavis.edu/0808.3351. –  Arend Bayer Jul 24 '12 at 22:03

The following conjecture by Carsten Thomassen:

If $G$ is a 3-connected graph, every longest cycle in $G$ has a chord.

Thomassen has proven the conjecture true for 3-connected cubic graphs.

share|improve this answer

Is there a positive integer which is both triangular and factorial except these obvious examples: $1, 6, 120$? (Tomaszewski conjecture, http://oeis.org/A000217)

share|improve this answer

Is the density of $1$s in the Kolakoski sequence $122112122122112112212112\dots$ (Wikipedia, OEIS) equal to $1/2$? Also, does every consecutive block, which occurs at all in the Kolakoski sequence, occur infinitely often?

share|improve this answer

The Littlewood conjecture:

For any $\alpha, \beta \in \mathbb{R}$ we have $$\lim\textrm{inf}_{n\to\infty} (n\cdot||n\alpha||\cdot||n\beta||) = 0$$

where $||\cdot||$ denotes the distance to the nearest integer.

share|improve this answer

The Kurepa problem: Show that for all primes $p>3$ we have that $$ 0!+1!+2!+\dots+(p-1)! $$ is not divisible by $p$. Kurepa posed this problem in 1971. For an overview see the article by Ivic and Mijajlovic (http://arxiv.org/abs/math/0312202).

share|improve this answer
2  
Already on this list: see mathoverflow.net/a/114639/763 –  Yemon Choi Dec 17 at 16:18
2  
@Stefan Kohl: Ivic told me that the Barsky-Benzaghou-proof is philosophically correct in the sense that although it does not prove the conjecture, it gives a reason why the conjecture should be true. I haven't looked at the paper itself, though. –  Jan-Christoph Schlage-Puchta Dec 18 at 14:08

Here is another problem on equilibrium points of potentials: suppose that we have infinitely many point masses in $R^3$ (the points do not accumulate). Must there exist a point where the gravitational force created by these masses is zero?

If the masses $m_k>0$ are placed at $x_k\to\infty$ then the force is $$\sum_{k=1}^\infty m_k\frac{x-x_k}{|x-x_k|^3},\quad \mbox{where}\quad\sum_{k=1}^\infty m_k|x_k|^{-2}<\infty.$$ Does every such function have a zero?

This is a version of the problem proposed by Lee Rubel in 1980-th. For some partial results see http://www.math.purdue.edu/~eremenko/dvi/equil.pdf This question can be easily modified for any dimension $n\geq2$, using Newtonian ($n\geq 3$) or logarithmic potential ($n=2$). The question is substantially easier in dimension $2$, but even for $n=2$ it is not solved in full generality.

share|improve this answer

I get the feeling that you will enjoy reading about the Simonyi and Chvatal conjectures described here by some guy called Gil Kalai. Anyone know who that is? ;)

share|improve this answer

http://en.wikipedia.org/wiki/Keller%27s_conjecture

From Wikipedia:

Keller's conjecture is the conjecture introduced by Ott-Heinrich Keller (1930) that in any tiling of Euclidean space by identical hypercubes there are two cubes that meet face to face.

Keller's original cube-tiling conjecture remains open in dimension 7.

Conjecture was shown to be true in dimensions at most 6 by Perron (1940a, 1940b). However, for higher dimensions it is false, as was shown in dimensions at least 10 by Lagarias and Shor (1992) and in dimensions at least 8 by Mackey (2002), using a reformulation of the problem in terms of the clique number of certain graphs now known as Keller graphs. Although this graph-theoretic version of the conjecture is now resolved for all dimensions, Keller's original cube-tiling conjecture remains open in dimension 7.

The related Minkowski lattice cube-tiling conjecture states that, whenever a tiling of space by identical cubes has the additional property that the cube centers form a lattice, some cubes must meet face to face. It was proved by György Hajós in 1942.

Szabó (1993), Shor (2004), and Zong (2005) give surveys of work on Keller's conjecture and related problems.

share|improve this answer

What is the least $V$ such that any convex body of unit volume can be fit into a tetrahedron of volume $V$? It is known that $V \ge 9/2$ and conjectured that $V = 9/2$.

share|improve this answer

What is the least $S$ (if any) such that any subset of a plane of area $S$ contains $3$ vertices of a triangle of unit area?

share|improve this answer

The list coloring conjecture: A list of colors is assigned to each edge of a finite graph $G$. A "list coloring" of $G$ is an edge-coloring such that (1) each edge is colored with a color from its list, and (2) edges that meet at a vertex have different colors. Suppose the graph $G$ admits a list coloring when the list $\{1,2,\dots,n\}$ is assigned to every edge; does it still admit a list coloring when an arbitrary list of $n$ colors is assigned to each edge?

share|improve this answer

I like the Montesinos-Nakanishi 3-move conjecture from knot theory. A 3-move on a link is the replacement of two parallel strands by three half twists. The conjecture is that any link can be turned into the trivial link by a sequence of such moves. (If you think of this as a conjecture on diagrams, then you also need to allow Reidemeister moves.) According to an Encyclopedia of Mathematics article:

The conjecture has been proved for links up to 12 crossings, 4-bridge links and five-braid links except one family represented by the square of the centre of the 5-braid group. This link, which can be reduced by 3-moves to a 20-crossings link, is the smallest known link for which the conjecture is open (as of 2001).

share|improve this answer

The Alon-Tarsi Conjecture:

A latin square of order $n$ is a filling of an $n\times n$ matrix with the numbers $1, 2,\ldots,n$ such that each row or column gives a permutation of $1,2,\ldots,n$. Take the product of the signs of these $2n$ permutations and call it the sign of the latin square. Let $EVEN(n)$ be the number of latin squares with sign $+1$ and let $ODD(n)$ be the number of latin squares with sign $-1$. The conjecture says:

If $n$ is even then $EVEN(n)\neq ODD(n)$.

The original reference is: N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica 12 (1992), 125-134. See also this preprint by Landsberg and Kumar for a recent update.

share|improve this answer

Is there a triangle that can be cut into $7$ congruent triangles? (no)

share|improve this answer
1  
Nice problems but what are the sources? –  Alexander Chervov Jul 24 '12 at 20:23
2  
I heard this in a personal communication. But it turns out this is already settled negatively in 2008: michaelbeeson.com/research/papers/SevenTriangles.pdf –  Vladimir Reshetnikov Jul 28 '12 at 20:34

Ore's odd Harmonic number conjecture

share|improve this answer
2  
Well, now it's so obscure that it requires a context/explanation. –  Victor Protsak Jan 6 at 20:45

Is there any odd perfect number?

share|improve this answer
7  
Methinks this one is both pretty famous and long open... –  J. H. S. Jun 14 '13 at 15:21

Can a disk be dissected into two or more pieces, with its centre lying within one of the pieces?

share|improve this answer
4  
Surely there is a missing condition here. Maybe the pieces are required to be congruent? –  zeb Mar 11 at 11:50
1  
Thank you, zeb - that is what I meant. –  maproom Mar 11 at 16:55
  • Is the Ring of Periods actually a field? (most likely, no)
  • Is the equality of periods decidable? (hopefully, yes)
share|improve this answer
8  
problems which anyone can understand ? Uhhh –  Denis Serre Sep 25 '12 at 7:50

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.