Unsolved Problems

Showing 1-37 of 37 problems

GREEN-043
Open

Erdős-Szekeres with Visibility

Fix integers $k, \ell$. Given $n \geq n_0(k, \ell)$ points in $\mathbb{R}^2$, is there either a line containing $k$ of them, or $\ell$ of them that ar...

L1
Geometry
GREEN-044
Open

Collinear 4-tuples Force Collinear 5-tuples

Suppose $A \subset \mathbb{R}^2$ is a set of size $n$ with $cn^2$ collinear 4-tuples. Does it contain 5 points on a line?...

L1
Geometry
GREEN-047
Open

No 5 Points on 2-plane in [N]^d

What is the largest subset of $[N]^d$ with no 5 points on a 2-plane?...

L1
Geometry
GREEN-048
Open

Balanced Ham Sandwich Line

Let $X \subset \mathbb{R}^2$ be a set of $n$ points. Does there exist a line $\ell$ through at least two points of $X$ such that the numbers of points...

L1
Geometry
GREEN-049
Open

Sparse Hitting Set for Rectangles

Let $A$ be a set of $n$ points in the plane. Can one select $A' \subset A$ of size $n/2$ such that any axis-parallel rectangle containing 1000 points ...

L1
Geometry
GREEN-051
Open

Axis-Parallel Rectangles in Dense Sets

Suppose $A$ is an open subset of $[0, 1]^2$ with measure $\alpha$. Are there four points in $A$ determining an axis-parallel rectangle with area $\geq...

L1
Geometry
GREEN-083
Open

Pyjama Set Covering

How many rotated (about the origin) copies of the "pyjama set" $\{(x, y) \in \mathbb{R}^2 : \operatorname{dist}(x, \mathbb{Z}) \leq \varepsilon\}$ are...

L1
Geometry
EP-98
Open

Erdős Problem #98

Let $h(n)$ be such that any $n$ points in $\mathbb{R}^2$, with no three on a line and no four on a circle, determine at least $h(n)$ distinct distance...

L1
Geometry
EP-100
Open

Erdős Problem #100

Let $A$ be a set of $n$ points in $\mathbb{R}^2$ such that all pairwise distances are at least $1$ and if two distinct distances differ then they diff...

L1
Geometry
EP-103
Open

Erdős Problem #103

Let $h(n)$ count the number of incongruent sets of $n$ points in $\mathbb{R}^2$ which minimise the diameter subject to the constraint that $d(x,y)\geq...

L1
Geometry
EP-507
Open

Erdős Problem #507

Let $\alpha(n)$ be such that every set of $n$ points in the unit disk contains three points which determine a triangle of area at most $\alpha(n)$. Es...

L1
Geometry
EP-652
Open

Erdős Problem #652

Let $x_1,\ldots,x_n\in \mathbb{R}^2$ and let $R(x_i)=\#\{ \lvert x_j-x_i\rvert : j eq i\}$, where the points are ordered such that $ R(x_1)\leq \cdots...

L1
Geometry
EP-653
Open

Erdős Problem #653

Let $x_1,\ldots,x_n\in \mathbb{R}^2$ and let $R(x_i)=\#\{ \lvert x_j-x_i\rvert : j eq i\}$, where the points are ordered such that $ R(x_1)\leq \cdots...

L1
Geometry
EP-655
Open

Erdős Problem #655

Let $x_1,\ldots,x_n\in \mathbb{R}^2$ be such that no circle whose centre is one of the $x_i$ contains three other points. Are there at least $ (1+c)\f...

L1
Geometry
EP-661
Open

Erdős Problem #661

Are there, for all large $n$, some points $x_1,\ldots,x_n,y_1,\ldots,y_n\in \mathbb{R}^2$ such that the number of distinct distances $d(x_i,y_j)$ is $...

L1
Geometry
EP-662
Open

Erdős Problem #662

Consider the triangular lattice with minimal distance between two points $1$. Denote by $f(t)$ the number of distances from any points $\leq t$. For e...

L1
Geometry
EP-669
Open

Erdős Problem #669

Let $F_k(n)$ be minimal such that for any $n$ points in $\mathbb{R}^2$ there exist at most $F_k(n)$ many distinct lines passing through at least $k$ o...

L1
Geometry
EP-831
Open

Erdős Problem #831

Let $h(n)$ be maximal such that in any $n$ points in $\mathbb{R}^2$ (with no three on a line and no four on a circle) there are at least $h(n)$ many c...

L1
Geometry
EP-1129
Open

Erdős Problem #1129

For $x_1,\ldots,x_n\in [-1,1]$ let $ l_k(x)=\frac{\prod_{i eq k}(x-x_i)}{\prod_{i eq k}(x_k-x_i)}, $ which are such that $l_k(x_k)=1$ and $l_k(x_i)=0$...

L1
Geometry
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-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-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-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