Related papers: Geodesic complexity of a tetrahedron

We prove a bound for the geodesic diameter of a subset of the unit ball in $\mathbb{R}^n$ described by a fixed number of quadratic equations and inequalities, which is polynomial in $n$, whereas the known bound for general degree is…

The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed…

A surface in the Teichm\"uller space, where the systole function attains its maximum, is called a maximal surface. For genus two there exists a unique maximal surface which is called the Bolza surface. In this article, we study the…

An \emph{obstacle representation} of a graph $G$ is a straight-line drawing of $G$ in the plane together with a collection of connected subsets of the plane, called \emph{obstacles}, that block all non-edges of $G$ while not blocking any of…

The Thurston norm is a seminorm on the second real homology group of a compact orientable 3-manifold. The unit ball of this norm is a convex polyhedron, whose shape's data (e.g. number of vertices, regularity) measures the complexity of the…

We study the abstract regular polyhedra with automorphism groups that act faithfully on their vertices, and show that each non-flat abstract regular polyhedron covers a "vertex-faithful" polyhedron with the same number of vertices. We then…

We define and study complex structures and generalizations on spaces consisting of geodesics or harmonic maps that are compatible with the symmetries of these spaces. The main results are about existence and uniqueness of such structures.

We prove that there are thirteen Archimedean/semiregular polyhedra by using Euler's polyhedral formula.

In this note, we prove the existence of a closed geodesic of positive length on any compact developable orbifold of dimension 3, 5, or 7. The argument uses the stratification of the singular locus, and reduces the problem of existence of a…

In this paper, we study trigonal minimal surfaces in flat tori. First, we show a topological obstruction similar to that of hyperelliptic minimal surfaces. Actually, the genus of trigonal minimal surface in 3-dimensional flat torus must be…

We study the model theoretic strength of various lattices that occur naturally in topology, like closed (semi-linear or semi-algebraic or convex) sets. The method is based on weak monadic second order logic and sharpens previous results by…

A polyhedron in Euclidean 3-space is called a regular polyhedron of index 2 if it is combinatorially regular but "fails geometric regularity by a factor of 2"; its combinatorial automorphism group is flag-transitive but its geometric…

The dynamical system on T^2 which is a group extension over an irrational rotation on T^1 is investigated. The criterion when the extension is minimal, a system of order 2 and when the maximal equicontinuous factor is the irrational…

We prove that the topological complexity of every symplectically atoroidal manifold is equal to twice its dimension. This is the analogue for topological complexity of a result of Rudyak and Oprea, who showed that the…

The two-dimensional surface of a bi-axial ellipsoid is characterized by the lengths of its major and minor axes. Longitude and latitude span an angular coordinate system across. We consider the egg-shaped surface of constant altitude above…

We construct families of trivial $2$-knots $K_i$ in $\mathbb{R}^4$ such that the maximal complexity of $2$-knots in any isotopy connecting $K_i$ with the standard unknot grows faster than a tower of exponentials of any fixed height of the…

A measure of complexity based on a probabilistic description of physical systems is proposed. This measure incorporates the main features of the intuitive notion of such a magnitude. It can be applied to many physical situations and to…

By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…

For a 3-dimensional manifold $M^3$, its complexity $c(M^3)$, introduced by S.Matveev, is the minimal number of vertices of an almost simple spine of $M^3$; in many cases it is equal to the minimal number of tetrahedra in a singular…

We study the general rational trigonometry of a tetrahedron, based on quadrances, spreads and solid spreads, using vector products associated to an arbitrary symmetric bilinear form over a general field, not of characteristic two. This…