Related papers: On parameterised toric codes
The theorem of Barth-Lefschetz is a statement about the cohomology of a submanifold X of some projective space, in a range depending on the codimension of the embedding. Here this is generalized to the case of a submanifold X of a smooth…
We adapt the conjectural local Langlands parameterization to split metaplectic groups over local fields. When $\tilde G$ is a central extension of a split connected reductive group over a local field (arising from the framework of Brylinski…
In this paper, we investigate the numerous parameters choices for linear lattice Boltzmann schemes according to the definition of the isotropic order given in \cite{ADG11}. This property---written in a general framework including all of the…
Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…
We consider the problem of computing homogeneous coordinates of points in a zero-dimensional subscheme of a compact, complex toric variety $X$. Our starting point is a homogeneous ideal $I$ in the Cox ring of $X$, which in practice might…
Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…
The color code model is a crucial instance of a Calderbank--Shor--Steane (CSS)-type topological quantum error-correcting code, which notably supports transversal implementation of the full Clifford group. Its robustness against local noise…
It is now widely recognized that the toric code is a pure gauge-theory model governed by a projective Hamiltonian with topological orders. In this work, we extend the interplay between quantum information system and gauge-theory model from…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of…
We propose an empirical formula for the problem of local distribution of rational points of bounded height. This is a local version of the Batyrev-Manin-Peyre principle. We verify this for a toric surface, on which cuspidal rational curves…
Given an open set $T\subset [-1,1)$, we introduce the concepts of $T$-avoiding spherical codes and designs, that is, spherical codes that have no inner products in the set $T$. We show that certain codes found in the minimal vectors of the…
We study a 3D generalization of the toric code model introduced recently by Chamon. This is an exactly solvable spin model with six-qubit nearest neighbor interactions on an FCC lattice whose ground space exhibits topological quantum order.…
We give new constructions of two classes of algebraic code families which are efficiently list decodable with small output list size from a fraction $1-R-\epsilon$ of adversarial errors where $R$ is the rate of the code, for any desired…
We give a computable lower bound on the distance between two distinct periods of a given quartic surface defined over the algebraic numbers. The main ingredient is the determination of height bounds on components of the Noether--Lefschetz…
Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…
We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…
The Pearson distance has been advocated for improving the error performance of noisy channels with unknown gain and offset. The Pearson distance can only fruitfully be used for sets of $q$-ary codewords, called Pearson codes, that satisfy…
We show that the number of lattice points in the boundary of a positive integer dilate of a Delzant integral polytope is a polynomial in the dilation parameter, analogous to the Ehrhart polynomial giving the number of lattice points in a…
This paper presents a 55-line code written in python for 2D and 3D topology optimization (TO) based on the open-source finite element computing software (FEniCS), equipped with various finite element tools and solvers. PETSc is used as the…
Given a lattice polytope $Q\subset \mathbb{R}^n$, we can consider the cone $\sigma=C(Q)=\{\lambda(q,1)\in \mathbb{R}^{n+1}|\lambda \in \mathbb{R}_{\geq0}, q\in Q\} \subset \mathbb{R}^{n+1}$, and the affine toric variety $Y_{\sigma}$…