Unsolved Problems

Showing 1-29 of 29 problems

OPG-357
Open

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

L1
Geometry
OPG-588
Open

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

L1
Geometry
OPG-605
Open

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$....

L1
Geometry
OPG-720
Open

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

L1
Geometry
OPG-1761
Open

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?...

L2
Geometry
OPG-1820
Open

Simplexity of the n-cube

Question What is the minimum cardinality of a decomposition of the $n$-cube into $n$-simplices?...

L2
Geometry
OPG-2089
Open

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

L2
Geometry
OPG-2400
Open

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

L2
Geometry
OPG-2435
Open

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

L2
Geometry
OPG-36901
Open

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

L2
Geometry
OPG-37084
Open

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

L1
Geometry
OPG-37086
Open

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

L1
Geometry
OPG-37286
Open

Point sets with no empty pentagon

Problem Classify the point sets with no empty pentagon....

L1
Geometry
OPG-37327
Open

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

L1
Geometry
OPG-37456
Open

Convex uniform 5-polytopes

Problem Enumerate all convex uniform 5-polytopes....

L1
Geometry
OPG-56328
Open

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

L1
Geometry
OPG-59888
Open

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

L1
Geometry
OPG-59914
Open

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$ ...

L1
Geometry
OPG-59923
Open

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

L1
Geometry
OPG-59984
Open

Chromatic number of associahedron

Conjecture Associahedra have unbounded chromatic number....

L1
Geometry
OPG-60010
Open

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

L1
Geometry
OPG-60037
Open

Edge-Unfolding Convex Polyhedra

Conjecture Every convex polyhedron has a (nonoverlapping) edge unfolding....

L1
Geometry
OPG-1768
Open

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

L3
Geometry
OPG-1803
Open

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

L3
Geometry
OPG-316
Open

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

L2
Geometry
OPG-610
Open

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$....

L1
Geometry
OPG-778
Open

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

L2
Geometry
OPG-37341
Open

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$...

L1
Geometry
OPG-37459
Open

Durer's Conjecture

Conjecture Every convex polytope has a non-overlapping edge unfolding....

L2
Geometry