Related papers: The surface code on the rhombic dodecahedron

In a previous work arXiv:physics/0611108v2, it was shown that the volume spanned by a molecular system in its conformational space can be effectively bounded by a polyhedral cone, this cone is described by means of a simple combinatorial…

There exists a surface of a convex polyhedron P and a partition L of P into geodesic convex polygons such that there are no connected "edge" unfoldings of P without self-intersections (whose spanning tree is a subset of the edge skeleton of…

A classical question in geometry is whether surfaces with given geometric features can be realized as embedded surfaces in Euclidean space. In this paper, we construct an immersed, but not embedded, infinite $\{3,7\}$-surface in…

3D-facets of the Delone cells representing the deep and shallow holes of the root lattice D6 which tile the six-dimensional Euclidean space in an alternating order are projected into three-dimensional space. They are classified into six…

A rational triangle has rational edge-lengths and area; a rational tetrahedron has rational faces and volume; either is Heronian when its edge-lengths are integer, and proper when its content is nonzero. A variant proof is given, via…

We propose a new strategy to decode color codes, which is based on the projection of the error onto three surface codes. This provides a method to transform every decoding algorithm of surface codes into a decoding algorithm of color codes.…

We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…

This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…

Surfaces of general type with canonical map of degree d bigger than 8 have bounded geometric genus and irregularity. In particular the irregularity is at most 2 if d>= 10. In the present paper, the existence of surfaces with d=10 and all…

We compute the number of rhombus tilings of a hexagon with side lengths a,b,c,a,b,c which contain the central rhombus and the number of rhombus tilings of a hexagon with side lengths a,b,c,a,b,c which contain the `almost central` rhombus…

We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of…

Given a trivalent graph in the 3-dimensional Euclidean space, we call it a discrete surface because it has a tangent space at each vertex determined by its neighbor vertices. To abstract a continuum object hidden in the discrete surface, we…

A locally recoverable code is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. Building on work of Barg, Tamo, and…

We prove that there exists a geodesic trajectory on the dodecahedron from a vertex to itself that does not pass through any other vertex.

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

This paper presents a novel space-filling polyhedron (SFPH), here named the Josehedron, derived from the extremal points of the Fischer-Koch S triply periodic minimal surface (TPMS). The Josehedron is a plesiohedron with 12 faces (4…

The landscapes of a polyhedron are subsets of its nets one must consider to identify all shortest paths. Landscapes of cubes and tetrahedra have been used to identify coordinate based formulas for the lengths of the shortest paths between…

The theory of the isoptic curves is widely studied in the Euclidean plane $\bE^2$ (see \cite{CMM91} and \cite{Wi} and the references given there). The analogous question was investigated by the authors in the hyperbolic $\bH^2$ and elliptic…

Topological subsystem codes can combine the advantages of both topological codes and subsystem codes. Suchara et al. proposed a framework based on hypergraphs for construction of such codes. They also studied the performance of some…

In a recent work, Bombin, Duclos-Cianci, and Poulin showed that every local translationally invariant 2D topological stabilizer code is locally equivalent to a finite number of copies of Kitaev's toric code. For 2D color codes, Delfosse…