Unsolved Problems

Showing 51-100 of 117 problems (Page 2 of 3)

GEO-028
Open

Ehrhart's Volume Conjecture

Does a convex body in $\mathbb{R}^n$ with one interior lattice point at its center of mass have volume at most $(n+1)^n/n!$?...

L4
Geometry
GEO-029
Open

Borsuk's Conjecture

Can every bounded set in $\mathbb{R}^n$ be partitioned into $n+1$ sets of smaller diameter?...

L4
Geometry
GEO-030
Open

The Kissing Number Problem

What is the maximum number of non-overlapping unit spheres that can touch a central unit sphere in $n$ dimensions?...

L4
Geometry
GEO-031
Open

Ulam's Packing Conjecture

Is the sphere the worst-packing convex solid?...

L4
Geometry
GEO-032
Open

Sphere Packing in High Dimensions

What is the densest packing of unit spheres in dimensions other than 1, 2, 3, 8, and 24?...

L5
Geometry
GEO-033
Open

Erdős-Ulam Problem

Is there a dense set of points in the plane with all pairwise distances rational?...

L4
Geometry
GEOM-007
Open

Kakeya Conjecture

Must a Kakeya set in $\mathbb{R}^n$ have Hausdorff and Minkowski dimension $n$?...

L5
Geometry
GEOM-008
Open

Illumination Problem

Can every convex body in $\mathbb{R}^n$ be illuminated by $2^n$ light sources?...

L4
Geometry
GEOM-009
Open

Yang-Mills Existence and Mass Gap

Does Yang-Mills theory exist mathematically and exhibit a mass gap in 4D?...

L5
Geometry
GEOM-010
Open

Kissing Number Problem

What is the kissing number (maximum number of non-overlapping unit spheres that can touch a central unit sphere) in dimensions other than 1, 2, 3, 4, ...

L4
Geometry
GEOM-013
Open

Tammes Problem

For n > 14 points (except n=24), what is the maximum minimum distance between points on a unit sphere?...

L3
Geometry
GEOM-014
Open

Carathéodory Conjecture

Does every convex, closed, twice-differentiable surface in 3D Euclidean space have at least two umbilical points?...

L4
Geometry
GEOM-015
Open

Cartan-Hadamard Conjecture

Does the isoperimetric inequality extend to Cartan-Hadamard manifolds (complete simply-connected manifolds of nonpositive curvature)?...

L4
Geometry
GEOM-016
Open

Chern's Conjecture (Affine Geometry)

Does the Euler characteristic of a compact affine manifold vanish?...

L4
Geometry
GEOM-017
Open

Hopf Conjectures

What are the relationships between curvature and Euler characteristic for higher-dimensional Riemannian manifolds?...

L5
Geometry
GEOM-018
Open

Yau's Conjecture on First Eigenvalue

Is the first eigenvalue of the Laplace-Beltrami operator on an embedded minimal hypersurface of $S^{n+1}$ equal to $n$?...

L5
Geometry
GEOM-019
Open

Hadwiger Conjecture (Covering)

Can every $n$-dimensional convex body be covered by at most $2^n$ smaller positively homothetic copies?...

L4
Geometry
GEOM-020
Open

Happy Ending Problem

What is the minimum number $g(n)$ of points in general position in the plane guaranteeing a convex $n$-gon?...

L4
Geometry
GEOM-021
Open

Heilbronn Triangle Problem

What configuration of $n$ points in the unit square maximizes the area of the smallest triangle they determine?...

L4
Geometry
GEOM-022
Open

Kalai's 3^d Conjecture

Does every centrally symmetric $d$-dimensional polytope have at least $3^d$ faces?...

L4
Geometry
GEOM-023
Open

Orchard-Planting Problem

What is the maximum number of 3-point lines attainable by a configuration of $n$ points in the plane?...

L3
Geometry
GEOM-024
Open

Unit Distance Problem

How many pairs of points at unit distance can be determined by $n$ points in the Euclidean plane?...

L4
Geometry
GEOM-025
Open

Bellman's Lost-in-a-Forest Problem

What is the shortest path that guarantees reaching the boundary of a given shape, starting from an unknown point with unknown orientation?...

L3
Geometry
GEOM-026
Open

Borromean Rings Question

Can three unknotted space curves (not all circles) be arranged as Borromean rings?...

L3
Geometry
GEOM-027
Open

Danzer's Problem

Do Danzer sets of bounded density or bounded separation exist?...

L4
Geometry
GEOM-001
Open

Sphere Packing Problem Higher Dimensions

What is the optimal sphere packing density in dimensions >3?...

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