Related papers: On parameterised toric codes
It has been recently shown that the iteration of Nash modification on not necessarily normal toric varieties corresponds to a purely combinatorial algorithm on the generators of the semigroup associated to the toric variety. We will show…
In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…
A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…
We present SU(3) lattice Yang-Mills data for hybrid static potentials from five ensembles with different small lattice spacings and the corresponding parametrizations for quark-antiquark separations $0.08\,\text{fm} \le r \le…
Curve singularities are classical objects of study in algebraic geometry. The key player in their combinatorial structure is the {\it value semigroup}, or its compactification, the {\it value semiring}. One natural problem is to explicitly…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
The toric Hilbert scheme parametrizes all algebras isomorphic to a given semigroup algebra as a multigraded vectorspace. All components of the scheme are toric varieties, and among them, there is a fairly well understood coherent component.…
The study of linear codes over a finite field of odd cardinality, derived from determinantal varieties obtained from symmetric matrices of bounded rank, was initiated in a recent paper by the authors. There, one found the minimum distance…
A new approach to bound the minimum distance of $q$-ary cyclic codes is presented. The connection to the BCH and the Hartmann--Tzeng bound is formulated and it is shown that for several cases an improvement is achieved. We associate a…
We construct an infinite series of simply transitive irreducible lattices in PGL_2(F_q((t))) \times PGL_2(F_q((t))) by means of a quaternion algebra over F_q(t). The lattices depend on an odd prime power q = p^r and a parameter \tau\ in…
Given a smooth projective toric variety $X$ of Picard rank 2, we resolve the diagonal sheaf on $X \times X$ by a linear complex of length $\dim{X}$ consisting of finite direct sums of line bundles. As applications, we prove a new case of a…
Building on work of Kapouleas and Yang, we construct sequences of minimal surfaces embedded in the round 3-sphere which converge to the Clifford torus counted with multiplicity two and have second fundamental form blowing up at every point…
The Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation. However, direct methods to increase its logical dimensions, such as lattice surgery or introducing…
We generalize methods to compute various kinds of rank to the case of a toric variety $X$ embedded into projective space using a very ample line bundle $\mathcal{L}$. We find an upper bound on the cactus rank. We use this to compute rank,…
We present and expand some existing results on the Zariski closure of cyclic groups and semigroups of matrices. We show that, with the exclusion of isolated points, their irreducible components are toric varieties. Additionally, we…
We provide a combinatorial criterion for the finite generation of a valuation semigroup associated with an ample divisor on a smooth toric surface and a non-toric valuation of maximal rank. As an application, we construct a lattice polytope…
We study the topology of toric maps. We show that if $f\colon X\to Y$ is a proper toric morphism, with $X$ simplicial, then the cohomology of every fiber of $f$ is pure and of Hodge-Tate type. When the map is a fibration, we give an…
Let $X \subset {\mathbb R}^m$ be a spherical code (i.e., a finite subset of the unit sphere) and consider the ideal of all polynomials in $m$ variables which vanish on $X$. Motivated by a study of cometric ($Q$-polynomial) association…
Linear constraints for a matrix polytope with no fractional vertex are investigated as intersecting research among permutation codes, rank modulations, and linear programming methods. By focusing the discussion to the block structure of…
We obtain conditions for a trigonometric polynomial t of one variable to equal or be approximated by |p|^2 where p has frequencies in a Bohr set of integers obtained by projecting lattice points in the open planar region bounded by the…