Related papers: The surface code on the rhombic dodecahedron
In this paper we propose a heuristic technique for distributing points on the surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so called cyclic group codes.…
Geodesic loops on polyhedra were studied only for Euclidean space and it was known that there are no simple geodesic loops on regular tetrahedra. Here we prove that: 1) On the spherical space, there are no simple geodesic loops on…
This short note is the extended abstract of a seminar I have delivered on several occasions over the past few months on canonical threefolds whose canonical volume is "close" to the lower bound 4/3p_g - 10/3. This is a project in…
A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…
The paper is devoted to finding the colorings of the edges of the 1-skeleton of triangulations of the 2-sphere in three colors so that for each face all three of its sides have different colors. First, by the method of adding one vertex…
We produce a family of numerical Campedelli surfaces with \Z/6 torsion by constructing the (Gorenstein codimension 5) canonical ring of the \'{e}tale six to one cover using serial unprojection. In Section 2 we develop the necessary…
There are several examples in which algebraic properties of Jacobian algebras from (unpunctured) Riemann surfaces can be computed from the geometry of the Riemann surface. In this work, we compute the dimension of the Hochschild cohomology…
We prove that exactly 6 out of the 29 rational homology 3-spheres tessellated by four or less right-angled hyperbolic dodecahedra are L-spaces. The algorithm used is based on the L-space census provided by Dunfield in arXiv:1904.04628, and…
We give coordinate-minimal geometric realizations in general position for 17 of the 20 vertex-minimal triangulations of the orientable surface of genus 3 in the 5x5x5-cube.
In this article, we construct codes with hierarchical locality using natural geometric structures in Artin-Schreier surfaces of the form $y^p-y=f(x,z)$. Our main theorem describes the codes, their hierarchical structure and recovery…
Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for…
We present an improved low-overhead implementation of surface code logical H. We describe in full detail logical H applied to a single distance 7 double-defect logical qubit in an otherwise idle scalable array such qubits. Our goal is to…
We define an invariant, which we call surface-complexity, of closed 3-manifolds by means of Dehn surfaces. The surface-complexity of a manifold is a natural number measuring how much the manifold is complicated. We prove that it fulfils…
We construct a sphere-homeomorphic flexible self-intersection free polyhedron in Euclidean 3-space such that all its dihedral angles change during some flex of this polyhedron. The constructed polyhedron has 26 vertices, 72 edges and 48…
The aim of this article is to give a concise algebraic treatment of the modular symbols formalism, generalised from modular curves to Hecke triangle surfaces. A sketch is included of how the modular symbols formalism gives rise to the…
This paper proves the following statement: If a convex body can form a three or fourfold translative tiling in the three-dimensional space, it must be a parallelohedron. In other words, it must be a parallelotope, a hexagonal prism, a…
A method is developed here for building differentiable three-dimensional manifolds on multicube structures. This method constructs a sequence of reference metrics that determine differentiable structures on the cubic regions that serve as…
In this article, we define homological quantum codes in arbitrary qudit dimensions $D\geq 2$ by directly defining CSS operators on a 2-Complex $\Sigma$. If the 2-Complex is constructed from a surface, we obtain a qudit surface code. We then…
Deciding realizability of a given polyhedral map on a (compact, connected) surface belongs to the hard problems in discrete geometry, from the theoretical, the algorithmic, and the practical point of view. In this paper, we present a…
It is proposed a new code for contours of plane images. This code was applied for optical character recognition of printed and handwritten characters. One can apply it to recognition of any visual images.