Related papers: Vertex-Minimal Paper Tori
A paper torus is a piecewise linear isometric embedding of a flat torus into $\R^3$. Following up on the $8$-vertex paper tori discovered by the second author, we prove universality and collapsibility results about these objects. One…
We give explicit realizations with small integer coordinates for all triangulated tori with up to 12 vertices. In particular, we provide coordinate-minimal realizations in general position for all triangulations of the torus with 7, 8, 9,…
For every knot K with stick number k there is a knotted polyhedral torus of knot type K with 3k vertices. We prove that at least 3k-2 vertices are necessary.
We develop a method to find a set of diminimal polyhedral maps on the torus from which all other polyhedral maps on the torus may be generated by face splitting and vertex splitting. We employ this method, though not to its completion, to…
We describe tools for the study of minimal surfaces in $\mathbb{R}^4$; some are classical (the Gauss maps) and some are newer (the link/braid/writhe at infinity). Then we look for complete proper non holomorphic minimal tori with total…
Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensional braid) can be described by using a chart. Also, a chart represents an oriented closed surface embedded in 4-space. In this paper, we investigate embedded…
A flat torus is the quotient of the Euclidean plane over a lattice generated by a basis, and an axis-aligned rectangular tiling of a flat torus is a partition into finitely many rectangles whose sides are axis-aligned. We provide the…
We show that there exists a geodesic triangulation $T$ of a hyperbolic genus 2 surface $\Sigma_2$ with 10 vertices and an isometric polyhedral embedding $S: \Sigma_2 \hookrightarrow \mathbb{H}^3$ that sends the triangles in $T$ to geodesic…
We prove that every homogeneous convex polyhedron with only one unstable equilibrium (known as a mono-unstable convex polyhedron) has at least $7$ vertices. Although it has been long known that no mono-unstable tetrahedra exist, and…
Work of Glover and Huneke shows that a cubic graph embeds into the real projective plane if and only if it does not contain one of six topological minors called cubic projective plane obstructions. Here we classify up to equivalence the…
We study a polyhedron with $n$ vertices of fixed volume having minimum surface area. Completing the proof of Fejes Toth, we show that all faces of a minimum polyhedron are triangles, and further prove that a minimum polyhedron does not…
The embeddability of graphs into surfaces has been studied for nearly a century. While the complete set of topological obstructions is known for the sphere and the real projective plane, there are only partial results for the torus. Here we…
We prove existence results that give information about the space of minimal immersions of 2-tori into $ S ^ 3 $. More specifically, we show that \begin{enumerate} \item For every positive integer $ n $, there are countably many real $n…
We show that all nontrivial embeddings of planar graphs on the torus contain a nontrivial knot or a nonsplit link. This is equivalent to showing that no minimally knotted planar spatial graphs on the torus exist that contain neither a…
Start with Gott (2019)'s envelope polyhedron (Squares-4 around a point): a unit cube missing its top and bottom faces. Stretch by a factor of 2 in the vertical direction so its sides become (2x1 unit) rectangles. This has 8 faces (4…
It is well-known that 1-planar graphs have minimum degree at most 7, and not hard to see that some 1-planar graphs have minimum degree exactly 7. In this note we show that any such 1-planar graph has at least 24 vertices, and this is tight.
If the face-cycles at all the vertices in a map on a surface are of same type then the map is called semi-equivelar. There are eleven types of Archimedean tilings on the plane. All the Archimedean tilings are semi-equivelar maps. If a map…
We investigate minimal charts with loops, a simple closed curve consisting of edges of label $m$ containing exactly one white vertex. We shall show that there does not exist any loop in a minimal chart with exactly seven white vertices in…
In this paper, we study the minimum rank among positive semidefinite matrices with a given graph of at most seven vertices (msr) by giving vector representations.
A vertex-transitive map $X$ is a map on a closed surface on which the automorphism group ${\rm Aut}(X)$ acts transitively on the set of vertices. If the face-cycles at all the vertices in a map are of same type then the map is said to be a…