Baker's Dozen — Periodic hyperbolic outer billiards
v1.3 research notesDoes every polygonal outer billiard in the hyperbolic plane have periodic orbits, possibly lying on the circle at infinity?...
Baker's Dozen — Completely periodic hyperbolic outer billiards
v1.3 research notesDescribe the polygonal outer billiard tables in the hyperbolic plane for which every orbit is periodic....
Baker's Dozen — A totally skew disc
v1.3 research notesDoes there exist a totally skew embedded $3$-disc in $\mathbb{R}^7$?...
Geometry of Continued Fractions — Integer trigonometry and IKEA problem
v1.3 research notesFind an integer cosine rule for integer triangles in integer trigonometry....
Geometry of Continued Fractions — Integer trigonometry and IKEA problem
v1.3 research notes{\bf(IKEA problem.)} Classify all $n$-tuples of LLS-sequences for the angles that form integer $n$-gons....
Geometry of Continued Fractions — Faces of sails
v1.3 research notesClassify all combinatorial possible types of faces....
Geometry of Continued Fractions — Faces of sails
v1.3 research notesWhich $n$-gons are realizable as faces of an $m$-dimensional continued fraction? Here are two essentially geometrically different subcases: ; {\bf Fac...
Geometry of Continued Fractions — Combinatorial structure of sails
v1.3 research notesDescribe all finite two-dimensional sails (and the corresponding continued fractions)....
Geometry of Continued Fractions — Combinatorial structure of sails
v1.3 research notes{\bf (Multidimensional IKEA problem.)} Describe the collections of the sails of the cones for all polytopes of a given combinatorial type....
Geometry of Continued Fractions — Combinatorial structure of sails
v1.3 research notes{\bf (V. Arnold.)} Does there exist an algorithm to decide whether a given type of fundamental domain is realizable by a periodic continued fraction?...
Geometry of Continued Fractions — Combinatorial structure of sails
v1.3 research notes{\bf (V. Arnold.)} Torus decompositions of integer noncongruent Klein sails are distinct....
Geometry of Continued Fractions — Combinatorial structure of sails
v1.3 research notes{\bf (V. Arnold.)} Describe all torus decompositions that are realized by periodic two-dimensional continued fractions....
Geometry of Continued Fractions — Combinatorial structure of sails
v1.3 research notes{\bf (V. Arnold.)} Classify continued fractions that correspond to the same cubic extension of the field of rational numbers....
Geometry of Continued Fractions — Combinatorial structure of sails
v1.3 research notesProve the existence of a cone for a single non-periodic combinatorial structure ($n\ge 3$)....
Geometry of Continued Fractions — Sail statistics
v1.3 research notesFind frequencies on $n$-dimensional continued fractions with the highest relative frequencies....
Geometry of Continued Fractions — Sail statistics
v1.3 research notesFor every positive integer constant $C$ there exist only finitely many pairwise integer non-congruent faces with frequencies exceeding $C$....
Geometry of Continued Fractions — Sail statistics
v1.3 research notesIs that true that sum of all relative frequencies for all possible faces is finite for higher dimensions $(n\ge 3)$?...
Geometry of Continued Fractions — Sail statistics
v1.3 research notesIn case of positive answer to the above question find the generalization of the Gauss map and compare the corresponding frequencies of faces with the ...
Geometry of Continued Fractions — Further open questions
v1.3 research notesStudy geometric properties of Markov spectrum....
Degenerate facets of polytopes
v1.3 research notesA facet of a $d$-polytope is degenerate if it has more than $d$ vertices. Determine the maximum number of degenerate facets of an $n$-vertex $d$-polyt...
Faces of intricate polytopes
v1.3 research notesDetermine the maximum total number of faces of a $d$-dimensional convex polytope with $n$ vertices and $n$ facets. In dimension four, do such fat-latt...
Extreme points
v1.3 research notesFor fixed $d>3$, determine whether every point of an $n$-point set in $\mathbb R^d$ is a convex-hull vertex faster than the best known near-$n^{2\lflo...
A dynamic-programming interval problem
v1.3 research notesGiven a sorted list of $n$ real numbers, find for every $1\le k\le n$ the shortest interval containing exactly $k$ entries. Find a subquadratic algori...
Shortest paths in line arrangements
v1.3 research notesGiven lines in the plane and two vertices $s,t$ of their arrangement, find a subquadratic algorithm for the shortest $s$-$t$ path along arrangement ed...
Bounded-degree triangulations
v1.3 research notesCan every convex polytope be triangulated so that every vertex degree, or every edge degree, is bounded by a constant or by a polylogarithmic function...
Chromatic number of the plane
v1.3 research notesDetermine the least number of colors needed to color the Euclidean plane so that points at unit distance receive different colors....
Covering points by congruent rectangles
v1.3 research notesGiven a finite planar point set and a prescribed rectangle, approximate efficiently the minimum number of congruent copies of the rectangle needed to ...
Integer-distance point sets
v1.3 research notesDo there exist seven planar points in general position—no three collinear and no four concyclic—such that every pairwise distance is an integer?...
Odd rep-tiling by a 14-omino
v1.3 research notesCan the $3\times6$ rectangle with a $2\times2$ corner removed tile a rectangle using an odd number of congruent copies?...
Comparing sums of square roots
v1.3 research notesCan sums of square roots of integers be compared in polynomial time on a Turing machine? Equivalently, obtain effective polynomial bit bounds for a no...
Triangulations with many distinct areas
v1.3 research notesFind the largest function $t(n)$ such that every convex $n$-gon has a triangulation containing at least $t(n)$ distinct triangle areas; also determine...
Classification of Finite Metric Spaces and Combinatorics of Convex Polytopes
v1.3 research notesLet $(X,\rho)$ be a finite metric space. Its fundamental polytope $R_{X,\rho}$ is the convex hull of the vectors $e_{x,y}=(\delta_x-\delta_y)/\rho(x,y...
An extended Poncelet problem I
v1.3 research notesDo there exist two irreducible algebraic curves of degrees $n$ and $m$, with $n+m>4$, each having an oval, for which the Poncelet map is well defined ...
An extended Poncelet problem II
v1.3 research notesLet $\gamma=\{x^2+y^2-1=0\}$ and $\Gamma_\varepsilon=\{p_2(x,y)+\varepsilon p_m(x,y)=0\}$, where $\Gamma_0$ is an ellipse surrounding $\gamma$, the cu...
Short geodesics on the regular dodecahedron
v1.3 research notesOn a regular dodecahedron, unfold a geodesic beginning at a vertex $v$ through successive faces. Call it short if it ends at a vertex and meets no ver...
Voronoi Diagram of Lines in 3D
v1.3 research notesWhat is the combinatorial complexity of the Voronoi diagram of a set of lines (or line segments) in three dimensions?...
Simple Polygonalizations
v1.3 research notesCan the number of simple polygonalizations of a set of $n$ points in the plane be computed in polynomial time? A simple polygonalization is a simple p...
Minimum-Link Path in 2D
v1.3 research notesCan a minimum-link path among polygonal obstacles be found in subquadratic time?...
Polygonal Curve Simplification
v1.3 research notesCan an $n$-vertex polygonal curve be simplified in time nearly linear in $n$?...
Polyhedral Surface Approximation
v1.3 research notesHow efficiently can one compute a polyhedral surface that is an $\epsilon$-approximation of a given triangulated surface in $\mathbb{R}^3$?...
Trapping Light Rays with Segment Mirrors
v1.3 research notesIs it possible to trap all the light from one point source by a finite collection of two-sided disjoint segment mirrors? A light ray is trapped if it ...
Vertex-Unfolding Polyhedra
v1.3 research notesConsider a polyhedron with simply connected facets (no holes on a facet) and without boundary (every edge is incident to exactly two facets). Can the ...
General Unfoldings of Nonconvex Polyhedra
v1.3 research notesCan every closed polyhedron be cut along its surface and unfolded into one piece in the plane without overlap? Such an unfolding is called a general u...
Planar Euclidean Maximum TSP
v1.3 research notesWhat is the complexity of finding a tour of maximum Euclidean length for a planar point set?...
Traveling Salesman Problem in Solid Grid Graphs
v1.3 research notesWhat is the complexity of finding a shortest tour in a solid planar grid graph? A planar grid graph is a graph whose vertices are any set of points on...
Pallet Loading
v1.3 research notesWhat is the complexity of the pallet loading problem? Given two pairs of numbers, $(A,B)$ and $(a,b)$, and a number $n$, decide whether $n$ small rect...
Most Circular Partition of a Square
v1.3 research notesWhat is the optimal partition of a square into convex pieces such that the circularity of the pieces is optimized? The circularity of a polygon is the...
Transforming Polygons via Vertex-Centroid Moves
v1.3 research notesGiven an arbitrary polygon, transform it by a finite sequence of ``vertex-centroid'' moves to a regular polygon. A vertex-centroid move is a translati...
Volume Maximizing Convex Shape
v1.3 research notesLet $C$ be a convex piece of paper; its boundary may be a smooth curve, or a polygon. A perimeter halving folding is a folding of $C$ obtained by iden...
Edge-Unfolding Polycubes
v1.3 research notesIs there any genus-zero orthogonal polyhedron $P$ built by gluing together cubes face-to-face that cannot be edge-unfolded, where all cube edges on th...