Mathematics Problem Archive

Consider two nested convex plane domains, and let $T_1,T_2$ be their billiard ball maps on the oriented lines intersecting both domains. If $T_1\circ ...

Are there smooth convex curves, other than ellipses, simultaneously admitting one-parameter families of $p$- and $q$-periodic billiard trajectories fo...

For billiards inside an oval in the Lorentz plane with metric $ds^2=dx^2-dy^2$, is there an analogue of Birkhoff's theorem, with separate existence st...

Does every polygonal outer billiard in the hyperbolic plane have periodic orbits, possibly lying on the circle at infinity?...

Describe the polygonal outer billiard tables in the hyperbolic plane for which every orbit is periodic....

For a smooth strictly convex hypersurface $M\subset\mathbb{R}^{2n}$, find lower bounds for the number of $p$-periodic outer-billiard orbits for values...

Let $f(x,y)$ be a polynomial for which $0$ is a nonsingular value, let $\gamma$ be an oval component of $f(x,y)=0$, and assume that $\gamma_\varepsilo...

For the ellipsoid $x^2/a+y^2/b+z^2/c=1$ in Minkowski space with metric $dx^2+dy^2-dz^2$, find conditions on $a,b,c>0$ ensuring the existence of an $(n...

Assume the origami hyperbolic-paraboloid pattern has invisible straight folds along a chosen diagonal of each elementary trapezoid. What is the shape ...

Let $\gamma$ be a smooth arc agreeing to all orders with the $x$-axis at endpoints $(0,0)$ and $(1,0)$, and iterate $T(\gamma)=\gamma+\gamma'$. Unless...

Given an oriented oval $\gamma$, let $\gamma_1$ be the locus of endpoints of its oriented unit tangent segments, and iterate this construction. If eve...

Extend the known results on projectively self-dual polygons and curves to projectively self-dual polyhedra and to projectively self-dual polygons in m...

Find conceptual proofs and possible generalizations of the new projective-geometry configuration theorems described in the source. In particular, prov...

Does there exist a totally skew embedded $3$-disc in $\mathbb{R}^7$?...

For a fixed combinatorial dissection of a square into $n$ triangles, the ordered triangle areas satisfy a polynomial relation depending only on the co...

Let $m,p\ge 2$, put $d=m+p-1$, and let $F(x)=(1,x,\ldots,x^d)$ be the rational normal curve. For $j=1,\ldots,mp$, let $X_j$ be the $p$-plane spanned b...

Find an integer cosine rule for integer triangles in integer trigonometry....

{\bf(IKEA problem.)} Classify all $n$-tuples of LLS-sequences for the angles that form integer $n$-gons....

Classify all combinatorial possible types of faces....

Classify all empty simplices of dimension $n$ up to lattice congruence....

Which $n$-gons are realizable as faces of an $m$-dimensional continued fraction? Here are two essentially geometrically different subcases: ; {\bf Fac...

Describe all finite two-dimensional sails (and the corresponding continued fractions)....

{\bf (Multidimensional IKEA problem.)} Describe the collections of the sails of the cones for all polytopes of a given combinatorial type....

{\bf (V. Arnold.)} Does there exist an algorithm to decide whether a given type of fundamental domain is realizable by a periodic continued fraction?...

{\bf (V. Arnold.)} Torus decompositions of integer noncongruent Klein sails are distinct....

{\bf (V. Arnold.)} Describe all torus decompositions that are realized by periodic two-dimensional continued fractions....

{\bf (V. Arnold.)} Classify continued fractions that correspond to the same cubic extension of the field of rational numbers....

Prove the existence of a cone for a single non-periodic combinatorial structure ($n\ge 3$)....

Find frequencies on $n$-dimensional continued fractions with the highest relative frequencies....

For every positive integer constant $C$ there exist only finitely many pairwise integer non-congruent faces with frequencies exceeding $C$....

Is that true that sum of all relative frequencies for all possible faces is finite for higher dimensions $(n\ge 3)$?...

In case of positive answer to the above question find the generalization of the Gauss map and compare the corresponding frequencies of faces with the ...

Find a natural generalization of the Farey tessellation to higher-dimensional hyperbolic geometry....

{\bf (Jacobi's last theorem.)} Let $K$ be a totally real cubic number field. Consider arbitrary elements $y$ and $z$ of $K$ such that $0<y,z<1$ (here ...

Study geometric properties of Markov spectrum....

Generalize continued fractions to describe 3-bridge knots....

A spherical quadrilateral is a disk with four marked boundary vertices, curvature-one metric, geodesic sides, and interior angles $\pi\alpha_j>0$. Cla...

Does every three-dimensional convex polytope have a non-self-intersecting edge unfolding? Does a minimum spanning tree of the dual edge graph, with a ...

Does the three-dimensional cube admit a triangulation into tetrahedra all of whose dihedral angles are acute?...

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

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

Given $n$ points and $m$ hyperplanes in $\mathbb R^d$ whose incidence graph contains no $K_{s,t}$, determine the maximum number of incidences. Of spec...

For an $n$-point planar set, determine the maximum number of halving lines. More generally, determine the maximum number of $k$-sets, subsets obtained...

For $n$ pseudocircles in general position, determine the maximum number of tangent pairs and the maximum number of digon cells. Determine whether the ...

Determine the worst-case complexity of the medial surface and of an offset surface of an $n$-feature polyhedron, and of the Voronoi diagram of $n$ lin...

Determine the exact Erdős–Szekeres number $f(n)$, the least number of planar points in general position forcing a convex $n$-gon. Also determine sharp...

Determine the combinatorial complexity of the visibility complex of $n$ pairwise disjoint unit spheres in three-dimensional space....

Given $n$ planar points, find a subquadratic algorithm for the minimum-area triangle or prove a quadratic lower bound in a suitable computation model....

Given $n$ points in $\mathbb C^2$, determine in quadratic time whether three lie on a complex line, or prove a quadratic lower bound; the known algori...

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