相关论文: The surface code on the rhombic dodecahedron
A polyhedron $\textbf{P} \subset \mathbb{R}^3$ has Rupert's property if a hole can be cut into it, such that a copy of $\textbf{P}$ can pass through this hole. There are several works investigating this property for some specific polyhedra:…
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps.…
In the first part of this article, we consider ruled surfaces defined over a finite field; we introduce invariants for them, and describe some explicit contructions that illustrate possible behaviour of these invariants. In the second part,…
Finding Hemisystems is a challenging problem and just few examples arising from the Hermitian surface are known. A recent method to obtain Hemisystems is based on using maximal curves. Along this side of research, we provide new examples of…
I introduce a method to generate families of CSS codes with interesting code parameters. The object of study is Coxeter groups, both finite and infinite (reducible or not), and a geometrically motivated partial order of Coxeter group…
We analyze the properties of a 2D topological code derived by concatenating the [[4, 2, 2]] code with the toric/surface code, or alternatively by removing check operators from the 2D square-octagon or 4.8.8 color code. We show that the…
Linear complementary dual codes (LCD) intersect trivially with their dual. In this paper, we develop a new characterization for LCD codes, which allows us to judge the complementary duality of linear codes from the codeword level. Further,…
In this article, we found all simple closed geodesics on regular spherical octahedra and spherical cubes. In addition, we estimate the number of simple closed geodesics on regular spherical tetrahedra.
A general method for the determination of the harmonics of quotients of the 3-sphere is given. They can all be deduced from three objects already known from Klein. We further show explicitly how these harmonics can be organized in…
Triple linking numbers were defined for 3-component oriented surface-links in 4-space using signed triple points on projections in 3-space. In this paper we give an algebraic formulation using intersections of homology classes (or cup…
An orthogonal coloring of the two-dimensional unit sphere $\mathbb{S}^2$, is a partition of $\mathbb{S}^2$ into parts such that no part contains a pair of orthogonal points, that is, a pair of points at spherical distance $\pi/2$ apart. It…
Recently I have proposed the Roman Dodecahedra as ancient coincidence rangefinders. Here I discuss several data and references freely available on the Web. After analysis, the common features of these artifacts allow to tell that a Roman…
We construct a complex algebraic surface with geometric genus $p_g=3$, irregularity $q=0$, self-intersection of the canonical divisor $K^2=24$ and canonical map of degree $24$ onto $\mathbb P^2$.
All edge-to-edge tilings of the sphere by congruent regular triangles and congruent rhombi are classified as: (1) a $1$-parameter family of protosets each admitting a unique $(2a^3,3a^4)$-tiling like a triangular prism; (2) a $1$-parameter…
We construct a canonical basis of two-cycles, on a $K3$ surface, in which the intersection form takes the canonical form $2E_8(-1) \oplus 3H$. The basic elements are realized by formal sums of smooth submanifolds.
3D printing of surfaces has become an established method for prototyping and visualisation. However, surfaces often contain certain degenerations, such as self-intersecting faces or non-manifold parts, which pose problems in obtaining a 3D…
The maximum possible number of non-overlapping unit spheres that can touch a unit sphere in $n$ dimensions is called kissing number. The problem for finding kissing numbers is closely connected to the more general problems of finding bounds…
We recall the theory of linear discrete Riemann surfaces and show how to use it in order to interpret a surface embedded in R^3 as a discrete Riemann surface and compute its basis of holomorphic forms on it. We present numerical examples,…
We propose a simple decoding algorithm for CSS codes taking into account the correlations between the X part and the Z part of the error. Applying this idea to surface codes, we derive an improved version of the perfect matching decoding…
In this note we present a computational approach to the construction of ovoids of the Hermitian surface and show some related experimental results.