Geometry of Curves and Surfaces — Problem 2.2
v1.3 research notesDoes connectedness of the shadows imply that f(M) is convex?...
Geometry of Curves and Surfaces — Problem 2.4
v1.3 research notesLetP, P′⊂ R3 be polyhedral surfaces. Suppose that the faces of P and P′ are parallel and have the same area. Does it follow then that P and P′ are con...
Geometry of Curves and Surfaces — Problem 3.1
v1.3 research notesIs every convex polytope unfoldable?...
Geometry of Curves and Surfaces — Problem 3.2
v1.3 research notesDoes there exist a reasonably simple algorithm for detecting the edges of a convex polyhedron intrinsically?...
Geometry of Curves and Surfaces — Problem 4.1
v1.3 research notesOf all convex surfaces with a fixed intrinsic diameter, is the one with the greatest area a doubled disk?...
Geometry of Curves and Surfaces — Problem 4.2
v1.3 research notesLet S ⊂ R3 be a closed surface of constant width and fixed area. How small can the volume of S be?...
Geometry of Curves and Surfaces — Problem 4.3
v1.3 research notesLetS⊂ R3 be a closed surface of diameter d. Suppose that there exists a constant h < dso that whenever a pair of planes separated by a distance of h i...
Geometry of Curves and Surfaces — Problem 5.1
v1.3 research notesWhat is the shortest curve in R3 with a given width or inradius?...
Geometry of Curves and Surfaces — Problem 5.3
v1.3 research notesLet $\Gamma$ be a closed curve of fixed length $L$ in $\mathbb{R}^3$, and let $A$ be the area of its convex hull. Prove that $A$ is maximized when $\G...
Geometry of Curves and Surfaces — Problem 8.3
v1.3 research notesLet M be a complete noncompact convex surface in R3, with principal curvatures k1, k2, then show that inf M|k1−k2| = 0....
The covering problem of Rado
v1.3 research notesThe covering problem of Rado: if the union of finitely many axis-parallel squares has unit area, how small can the largest area covered by a disjoint ...
The Erdős–Oler conjecture
v1.3 research notesThe Erdős–Oler conjecture: when $n$ is a triangular number, packing $n-1$ circles in an equilateral triangle requires a triangle of the same size as p...
Wikipedia geometry item 27: The disk covering problem about finding the smallest real number $r(n)$ such that $n$ disks of…
v1.3 research notesThe disk covering problem about finding the smallest real number $r(n)$ such that $n$ disks of radius $r(n)$ can be arranged in such a way as to cover...
Reinhardt's conjecture
v1.3 research notesReinhardt's conjecture: the smoothed octagon has the lowest maximum packing density of all centrally-symmetric convex plane sets...
Square packing in a square
v1.3 research notesSquare packing in a square: what is the asymptotic growth rate of wasted space?...
The Kobon triangle problem on triangles in line arrangements
v1.3 research notesThe Kobon triangle problem on triangles in line arrangements...
The Kusner conjecture
v1.3 research notesThe Kusner conjecture: at most $2d$ points can be equidistant in $L^1$ spaces...
The McMullen problem on projectively transforming sets of points into convex position
v1.3 research notesThe McMullen problem on projectively transforming sets of points into convex position...
Opaque forest problem on finding opaque sets for various planar shapes
v1.3 research notesOpaque forest problem on finding opaque sets for various planar shapes...
For each arrangement of points in which the rectilinear crossing number is minimized, is the number of halving lines maximized
v1.3 research notesFor each arrangement of points in which the rectilinear crossing number is minimized, is the number of halving lines maximized?...
Tripod packing
v1.3 research notesTripod packing: how many tripods can have their apexes packed into a given cube?...
The Atiyah conjecture on configurations on the invertibility of a certain $n$-by-$n$ matrix depending on $n$ points in $\mathbb{R}^{3}$
v1.3 research notesThe Atiyah conjecture on configurations on the invertibility of a certain $n$-by-$n$ matrix depending on $n$ points in $\mathbb{R}^{3}$...
Connelly’s blooming conjecture
v1.3 research notesConnelly’s blooming conjecture: Does every net of a convex polyhedron have a blooming?...
Dissection into orthoschemes
v1.3 research notesDissection into orthoschemes – is it possible for simplices of every dimension?...
The values of the Hermite constants for dimensions other than 1–8 and 24
v1.3 research notesThe values of the Hermite constants for dimensions other than 1–8 and 24...
What is the lowest number of faces possible for a holyhedron
v1.3 research notesWhat is the lowest number of faces possible for a holyhedron?...
Wikipedia geometry item 71: The Kelvin problem on minimum-surface-area partitions of space into equal-volume cells, and the…
v1.3 research notesThe Kelvin problem on minimum-surface-area partitions of space into equal-volume cells, and the optimality of the Weaire–Phelan structure as a solutio...
Lebesgue's universal covering problem on the minimum-area convex shape in the plane that can cover any shape of diameter one
v1.3 research notesLebesgue's universal covering problem on the minimum-area convex shape in the plane that can cover any shape of diameter one...
Moser's worm problem
v1.3 research notesMoser's worm problem – what is the smallest area of a shape that can cover every unit-length curve in the plane?...
Wikipedia geometry item 78: Can every spherical non-convex polyhedron that tiles space by translation have its faces groupe…
v1.3 research notesCan every spherical non-convex polyhedron that tiles space by translation have its faces grouped into patches with the same combinatorial structure as...
Does every higher-dimensional tiling by translations of convex polytope tiles have an affine transformation taking it to a Voronoi diagram
v1.3 research notesDoes every higher-dimensional tiling by translations of convex polytope tiles have an affine transformation taking it to a Voronoi diagram?...
Is there a general expression for the minimum ropelength of an arbitrary closed knot
v1.3 research notesIs there a general expression for the minimum ropelength of an arbitrary closed knot?...
What constant $1.1 < a \leq 10.76$ governs the lower bound of a closed knot $K$'s minimum ropelength $L(K) \geq a\operatorname{Cr}(K)^{3/4}$
v1.3 research notesWhat constant $1.1 < a \leq 10.76$ governs the lower bound of a closed knot $K$'s minimum ropelength $L(K) \geq a\operatorname{Cr}(K)^{3/4}$?...
Is the upper bound of a closed knot's minimum ropelength linear to its crossing number
v1.3 research notesIs the upper bound of a closed knot's minimum ropelength linear to its crossing number?...
Is there a general expression for how much the ends of a long rope of radius 1 get closer when a tight open knot is tied into it
v1.3 research notesIs there a general expression for how much the ends of a long rope of radius 1 get closer when a tight open knot is tied into it?...
Does every convex polyhedron have Rupert's property
v1.3 research notesDoes every convex polyhedron have Rupert's property?...
Is there a non-convex polyhedron without self-intersections with more than seven faces, all of which share an edge with each other
v1.3 research notesIs there a non-convex polyhedron without self-intersections with more than seven faces, all of which share an edge with each other?...
The Thomson problem
v1.3 research notesThe Thomson problem – what is the minimum energy configuration of $n$ mutually-repelling particles on a unit sphere?...
Rational distances from the vertices of a square
v1.3 research notesGiven a unit square, does there exist a point in its plane, inside or outside the square, whose distances from all four vertices are rational? Equival...
Explicit bound for symmetric point configurations on the sphere
v1.3 research notesCall a finite subset $X\subset S^2$ symmetric if a finite group acts transitively on $X$ by isometries. Determine an explicit universal upper bound fo...
Three-dimensional sphere packing from a planar height function
v1.3 research notesLet $G$ be a planar graph circle-packed in $\mathbb{R}^2$ and let $f:V(G)\to\mathbb{Z}$ change by at most one across every edge. Add from each vertex ...
Closest finite vertex-transitive graph to the round sphere
v1.3 research notesAmong all finite connected vertex-transitive graphs rescaled by their diameters, which one minimizes Gromov–Hausdorff distance to the round sphere $S^...
Local metric homogeneity forcing periodic triangulations
v1.3 research notesLet the Euclidean plane or hyperbolic plane have a triangulation whose triangles have diameter at most $r$. Suppose that for every pair of radius-$r$ ...
Nerve graphs of Euclidean sphere packings
v1.3 research notesCharacterize the graphs that occur as tangency, or nerve, graphs of sphere packings with disjoint interiors in $\mathbb{R}^d$....
Accumulation points of packings of $\mathbb{Z}^3$
v1.3 research notesProve that every sphere packing in $\mathbb{R}^3$ whose tangency graph is $\mathbb{Z}^3$ has at most one accumulation point in the one-point compactif...
1.1 (Agol) — Strictly convex projective manifolds and cubulation
v1.3 research notesIf $M^n$ is a closed manifold with a strictly convex projective structure, is it cubulated?...
1.2 (Choi) — Convex projective deformations from a CR structure
v1.3 research notesSuppose a hyperbolic $3$-manifold $M$ admits a CR structure, not necessarily a spherical one. Can the deformation theory of convex real projective str...
1.3 (Cooper) — Convexity of projective structures on hyperbolic 3-manifolds
v1.3 research notesIf $M$ is a closed hyperbolic $3$-manifold, is every projective structure on $M$ convex?...
1.4 (Danciger) — Convex projective structures on glued figure-eight complements
v1.3 research notesLet $N$ be the closed $3$-manifold obtained by gluing two copies of the figure-eight knot complement along their torus boundaries by a homeomorphism. ...
1.5 (Danciger) — Convex projective structures and hyperbolic JSJ pieces
v1.3 research notesLet $N$ be a closed $3$-manifold whose JSJ decomposition contains only hyperbolic pieces. Does $N$ admit a convex projective structure?...