Related papers: Classifying toric 3-fold codes of dimensions 4 and…
A fundamental idea in toric topology is that classes of manifolds with well-behaved torus actions (simply, toric spaces) are classified by pairs of simplicial complexes and (non-singular) characteristic maps. The authors in their previous…
Quantum error correction (QEC) is critical for scalable fault-tolerant quantum computing. Topological codes, such as the toric code, offer hardware-efficient architectures but their Tanner graphs contain many girth-4 cycles that degrade the…
Let $X$ be a complete simplicial toric variety over a finite field $\mathbb{F}_q$ with homogeneous coordinate ring $S=\mathbb{F}_q[x_1,\dots,x_r]$ and split torus $T_X\cong (\mathbb{F}^*_q)^n$. We prove that vanishing ideal of a subset $Y$…
We show that a proper algebraic n-dimensional scheme Y admits nontrivial vector bundles of rank n, even if Y is non-projective, provided that there is a modification containing a projective Cartier divisor that intersects the exceptional…
Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives. This small augmentation confers upon them better local decoding,…
Convex neural codes are combinatorial structures describing the intersection pattern of a collection of convex sets. Inductively pierced codes are a particularly nice subclass of neural codes introduced in the information visualization…
We describe classes of toric varieties of codimension 2 which are either minimally defined by 3 binomial equations over any algebraically closed field, or are set-theoretic complete intersections in exactly one positive characteristic.
An influential result of McDuff and Schlenk asserts that the function that encodes when a four-dimensional symplectic ellipsoid can be embedded into a four-dimensional ball has a remarkable structure: the function has infinitely many…
We define and study a class of Reed-Muller type error-correcting codes obtained from elementary symmetric functions in finitely many variables. We determine the code parameters and higher weight spectra in the simplest cases.
The problem of classifying high-dimensional shapes in real-world data grows in complexity as the dimension of the space increases. For the case of identifying convex shapes of different geometries, a new classification framework has…
We propose some problems on the classification of toric manifolds from the viewpoint of topology and survey related results.
We study the error threshold of color codes, a class of topological quantum codes that allow a direct implementation of quantum Clifford gates suitable for entanglement distillation, teleportation and fault-tolerant quantum computation. We…
It's well-known that maximum distance separable codes (in short, MDS) and linear complementary dual (in short, LCD) codes are very important in coding theory and practice. In 2023, Yue et al. [25] constructed three classes of LCD MDS codes…
We still do not have perfect decoders for topological codes that can satisfy all needs of different experimental setups. Recently, a few neural network based decoders have been studied, with the motivation that they can adapt to a wide…
We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with code distance being the linear system size, is decomposed by a local Clifford…
The cohomological rigidity problem for toric orbifolds asks when an integral cohomology isomorphism implies a homotopy equivalence. In this paper we reformulate the cohomological rigidity problem in the context of $4$-dimensional toric…
Neural codes, represented as collections of binary strings called codewords, are used to encode neural activity. A code is called convex if its codewords are represented as an arrangement of convex open sets in Euclidean space. Previous…
Surface codes are a promising method of quantum error correction and the basis of many proposed quantum computation implementations. However, their efficient decoding is still not fully explored. Recently, approaches based on machine…
Linear codes and $t$-designs are interactive with each other. It is well known that some $t$-designs have been constructed by using certain linear codes in recent years. However, only a small number of infinite families of the extended…
We present an algorithm for the classification of triples of lattice polytopes with a given mixed volume $m$ in dimension 3. It is known that the classification can be reduced to the enumeration of so-called irreducible triples, the number…