Unsolved Problems
Showing 1-29 of 29 problems
A conjecture on iterated circumcentres
Conjecture Let $p_1,p_2,p_3,\ldots$ be a sequence of points in ${\mathbb R}^d$ with the property that for every $i \ge d+2$, the points $p_{i-1}, p_{i...
Big Line or Big Clique in Planar Point Sets
Let $S$ be a set of points in the plane. Two points $v$ and $w$ in $S$ are visible with respect to $S$ if the line segment between $v$ and $w$ contain...
Average diameter of a bounded cell of a simple arrangement
Conjecture The average diameter of a bounded cell of a simple arrangement defined by $n$ hyperplanes in dimension $d$ is not greater than $d$....
Convex 'Fair' Partitions Of Convex Polygons
Basic Question: Given any positive integer n, can any convex polygon be partitioned into n convex pieces so that all pieces have the same area and sam...
Dense rational distance sets in the plane
Problem Does there exist a dense set $S \subseteq {\mathbb R}^2$ so that all pairwise distances between points in $S$ are rational?...
Simplexity of the n-cube
Question What is the minimum cardinality of a decomposition of the $n$-cube into $n$-simplices?...
Kneser–Poulsen conjecture
Conjecture If a finite set of unit balls in $\mathbb{R}^n$ is rearranged so that the distance between each pair of centers does not decrease, then the...
Erdös-Szekeres conjecture
Conjecture Every set of $2^{n-2} + 1$ points in the plane in general position contains a subset of $n$ points which form a convex $n$-gon....
Monochromatic empty triangles
If $X \subseteq {\mathbb R}^2$ is a finite set of points which is 2-colored, an empty triangle is a set $T \subseteq X$ with $|T|=3$ so that the conve...
Inequality of the means
Question Is is possible to pack $n^n$ rectangular $n$-dimensional boxes each of which has side lengths $a_1,a_2,\ldots,a_n$ inside an $n$-dimensional ...
Edge-Colouring Geometric Complete Graphs
Question What is the minimum number of colours such that every complete geometric graph on $n$ vertices has an edge colouring such that: \item[Varian...
Partition of Complete Geometric Graph into Plane Trees
Conjecture Every complete geometric graph with an even number of vertices has a partition of its edge set into plane (i.e. non-crossing) spanning tree...
Point sets with no empty pentagon
Problem Classify the point sets with no empty pentagon....
Covering a square with unit squares
Conjecture For any integer $n \geq 1$, it is impossible to cover a square of side greater than $n$ with $n^2+1$ unit squares....
Convex uniform 5-polytopes
Problem Enumerate all convex uniform 5-polytopes....
Partitioning the Projective Plane
Throughout this post, by projective plane we mean the set of all lines through the origin in $\mathbb{R}^3$. Definition Say that a subset $S$ of the ...
Dirac's Conjecture
Conjecture For every set $P$ of $n$ points in the plane, not all collinear, there is a point in $P$ contained in at least $\frac{n}{2}-c$ lines determ...
General position subsets
Question What is the least integer $f(n)$ such that every set of at least $f(n)$ points in the plane contains $n$ collinear points or a subset of $n$ ...
Generalised Empty Hexagon Conjecture
Conjecture For each $\ell\geq3$ there is an integer $f(\ell)$ such that every set of at least $f(\ell)$ points in the plane contains $\ell$ collinear ...
Chromatic number of associahedron
Conjecture Associahedra have unbounded chromatic number....
Convex Equipartitions with Extreme Perimeter
To divide a given 2D convex region C into a specified number n of convex pieces all of equal area (perimeters could be different) such that the total ...
Edge-Unfolding Convex Polyhedra
Conjecture Every convex polyhedron has a (nonoverlapping) edge unfolding....
Jacobian Conjecture
Conjecture Let $k$ be a field of characteristic zero. A collection $f_1,\ldots,f_n$ of polynomials in variables $x_1,\ldots,x_n$ defines an automorphi...
The Hodge Conjecture
Conjecture Let $X$ be a complex projective variety. Then every Hodge class is a rational linear combination of the cohomology classes of complex subva...
Fat 4-polytopes
The fatness of a 4-polytope $P$ is defined to be $(f_1 + f_2)/(f_0 + f_3)$ where $f_i$ is the number of faces of $P$ of dimension $i$. Question Does ...
Continous analogue of Hirsch conjecture
Conjecture The order of the largest total curvature of the primal central path over all polytopes defined by $n$ inequalities in dimension $d$ is $n$....
Cube-Simplex conjecture
Conjecture For every positive integer $k$, there exists an integer $d$ so that every polytope of dimension $\ge d$ has a $k$-dimensional face which is...
Extension complexity of (convex) polygons
The extension complexity of a polytope $P$ is the minimum number $q$ for which there exists a polytope $Q$ with $q$ facets and an affine mapping $\pi$...
Durer's Conjecture
Conjecture Every convex polytope has a non-overlapping edge unfolding....