Mathematics Problem Archive

Showing 1-50 of 273 problems (Page 1 of 6)

Previous
123...6
Next
AMR-005-0004
Open

Baker's Dozen — Periodic hyperbolic outer billiards

v1.3 research notes

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

L3
Geometry
AMR-005-0005
Open

Baker's Dozen — Completely periodic hyperbolic outer billiards

v1.3 research notes

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

L3
Geometry
AMR-005-0014
Open

Baker's Dozen — A totally skew disc

v1.3 research notes

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

L3
Geometry
AMR-018-0001
Open

Geometry of Continued Fractions — Integer trigonometry and IKEA problem

v1.3 research notes

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

L3
Geometry
AMR-018-0002
Open

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

L3
Geometry
AMR-018-0003
Open

Geometry of Continued Fractions — Faces of sails

v1.3 research notes

Classify all combinatorial possible types of faces....

L3
Geometry
AMR-018-0005
Open

Geometry of Continued Fractions — Faces of sails

v1.3 research notes

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

L3
Geometry
AMR-018-0007
Open

Geometry of Continued Fractions — Combinatorial structure of sails

v1.3 research notes

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

L3
Geometry
AMR-018-0008
Open

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

L3
Geometry
AMR-018-0009
Open

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

L3
Geometry
AMR-018-0010
Open

Geometry of Continued Fractions — Combinatorial structure of sails

v1.3 research notes

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

L3
Geometry
AMR-018-0011
Open

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

L3
Geometry
AMR-018-0013
Open

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

L3
Geometry
AMR-018-0014
Open

Geometry of Continued Fractions — Combinatorial structure of sails

v1.3 research notes

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

L3
Geometry
AMR-018-0015
Open

Geometry of Continued Fractions — Sail statistics

v1.3 research notes

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

L3
Geometry
AMR-018-0016
Open

Geometry of Continued Fractions — Sail statistics

v1.3 research notes

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

L3
Geometry
AMR-018-0017
Open

Geometry of Continued Fractions — Sail statistics

v1.3 research notes

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

L3
Geometry
AMR-018-0018
Open

Geometry of Continued Fractions — Sail statistics

v1.3 research notes

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

L3
Geometry
AMR-018-0021
Open

Geometry of Continued Fractions — Further open questions

v1.3 research notes

Study geometric properties of Markov spectrum....

L4
Geometry
AMR-037-0003
Open

Degenerate facets of polytopes

v1.3 research notes

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

L3
Geometry
AMR-037-0004
Open

Faces of intricate polytopes

v1.3 research notes

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

L3
Geometry
AMR-037-0013
Open

Extreme points

v1.3 research notes

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

L3
Geometry
AMR-037-0014
Open

A dynamic-programming interval problem

v1.3 research notes

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

L3
Geometry
AMR-037-0015
Open

Shortest paths in line arrangements

v1.3 research notes

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

L3
Geometry
AMR-038-0002
Open

Bounded-degree triangulations

v1.3 research notes

Can every convex polytope be triangulated so that every vertex degree, or every edge degree, is bounded by a constant or by a polylogarithmic function...

L3
Geometry
AMR-038-0003
Open

Chromatic number of the plane

v1.3 research notes

Determine the least number of colors needed to color the Euclidean plane so that points at unit distance receive different colors....

L4
Geometry
AMR-038-0004
Open

Covering points by congruent rectangles

v1.3 research notes

Given a finite planar point set and a prescribed rectangle, approximate efficiently the minimum number of congruent copies of the rectangle needed to ...

L4
Geometry
AMR-038-0008
Open

Integer-distance point sets

v1.3 research notes

Do there exist seven planar points in general position—no three collinear and no four concyclic—such that every pairwise distance is an integer?...

L2
Geometry
AMR-038-0010
Open

Odd rep-tiling by a 14-omino

v1.3 research notes

Can the $3\times6$ rectangle with a $2\times2$ corner removed tile a rectangle using an odd number of congruent copies?...

L4
Geometry
AMR-038-0014
Open

Comparing sums of square roots

v1.3 research notes

Can sums of square roots of integers be compared in polynomial time on a Turing machine? Equivalently, obtain effective polynomial bit bounds for a no...

L4
Geometry
AMR-038-0016
Open

Triangulations with many distinct areas

v1.3 research notes

Find the largest function $t(n)$ such that every convex $n$-gon has a triangulation containing at least $t(n)$ distinct triangle areas; also determine...

L4
Geometry
AMR-040-0001
Open

Classification of Finite Metric Spaces and Combinatorics of Convex Polytopes

v1.3 research notes

Let $(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...

L3
Geometry
AMR-046-0023
Open

An extended Poncelet problem I

v1.3 research notes

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

L3
Geometry
AMR-046-0024
Open

An extended Poncelet problem II

v1.3 research notes

Let $\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...

L3
Geometry
AMR-049-0007
Open

Short geodesics on the regular dodecahedron

v1.3 research notes

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

L3
Geometry
AMR-054-0003
Open

Voronoi Diagram of Lines in 3D

v1.3 research notes

What is the combinatorial complexity of the Voronoi diagram of a set of lines (or line segments) in three dimensions?...

L3
Geometry
AMR-054-0016
Open

Simple Polygonalizations

v1.3 research notes

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

L4
Geometry
AMR-054-0022
Open

Minimum-Link Path in 2D

v1.3 research notes

Can a minimum-link path among polygonal obstacles be found in subquadratic time?...

L3
Geometry
AMR-054-0024
Open

Polygonal Curve Simplification

v1.3 research notes

Can an $n$-vertex polygonal curve be simplified in time nearly linear in $n$?...

L3
Geometry
AMR-054-0025
Open

Polyhedral Surface Approximation

v1.3 research notes

How efficiently can one compute a polyhedral surface that is an $\epsilon$-approximation of a given triangulated surface in $\mathbb{R}^3$?...

L3
Geometry
AMR-054-0031
Open

Trapping Light Rays with Segment Mirrors

v1.3 research notes

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

L3
Geometry
AMR-054-0042
Open

Vertex-Unfolding Polyhedra

v1.3 research notes

Consider a polyhedron with simply connected facets (no holes on a facet) and without boundary (every edge is incident to exactly two facets). Can the ...

L3
Geometry
AMR-054-0043
Open

General Unfoldings of Nonconvex Polyhedra

v1.3 research notes

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

L3
Geometry
AMR-054-0049
Open

Planar Euclidean Maximum TSP

v1.3 research notes

What is the complexity of finding a tour of maximum Euclidean length for a planar point set?...

L3
Geometry
AMR-054-0054
Open

Traveling Salesman Problem in Solid Grid Graphs

v1.3 research notes

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

L3
Geometry
AMR-054-0055
Open

Pallet Loading

v1.3 research notes

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

L3
Geometry
AMR-054-0059
Open

Most Circular Partition of a Square

v1.3 research notes

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

L3
Geometry
AMR-054-0060
Open

Transforming Polygons via Vertex-Centroid Moves

v1.3 research notes

Given an arbitrary polygon, transform it by a finite sequence of ``vertex-centroid'' moves to a regular polygon. A vertex-centroid move is a translati...

L3
Geometry
AMR-054-0062
Open

Volume Maximizing Convex Shape

v1.3 research notes

Let $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...

L3
Geometry
AMR-054-0064
Open

Edge-Unfolding Polycubes

v1.3 research notes

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

L3
Geometry
Previous
123...6
Next