Related papers: Toric surface codes and Minkowski length of polygo…
We show that a Kleinian surface group, or hyperbolic 3-manifold with a cusp-preserving homotopy-equivalence to a surface, has bounded geometry if and only if there is an upper bound on an associated collection of coefficients that depend…
A toric code, introduced by Hansen to extend the Reed-Solomon code as a $k$-dimensional subspace of $\mathbb{F}_q^n$, is determined by a toric variety or its associated integral convex polytope $P \subseteq [0,q-2]^n$, where $k=|P \cap…
The lightlike geometry of codimension two spacelike submanifolds in Lorentz-Minkowski space has been developed in [Izumiya, S. and Romero Fuster, M. C. Selecta Mathematica (NS), 13 23--55 (2007)] which is a natural Lorentzian analogue of…
We obtain lower bound for the maximum distance between any three distinct points in an affine lattice which are close to a helix with small curvature and torsion.
The surface code is a two-dimensional topological code with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional locality. In three spatial dimensions an analogous simple yet…
Three dimensional (3D) toric codes are a class of stabilizer codes with local checks and come under the umbrella of topological codes. While decoding algorithms have been proposed for the 3D toric code on a cubic lattice, there have been…
We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…
A Fourier restriction estimate is obtained for a broad class of conic surfaces by adding a weight to the usual underlying measure. The new restriction estimate exhibits a certain affine-invariance and implies the sharp $L^p-L^q$ restriction…
One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice…
We present a new lower bound on the number of contingency tables, improving upon and extending previous lower bounds by Barvinok and Gurvits. As an application, we obtain new lower bounds on the volumes of flow and transportation polytopes.…
The corner polyhedron is described by minimal valid inequalities from maximal lattice-free convex sets. For the Relaxed Corner Polyhedron (RCP) with two free integer variables and any number of non-negative continuous variables, it is known…
The lattice size $\operatorname{ls}_{\Delta}(P)$ of a lattice polygon $P$ with respect to the standard simplex $\Delta$ was introduced and studied by Castryck and Cools in the context of simplification of the defining equation of an…
We introduce the Symplectic Grassmann codes as projective codes defined by symplectic Grassmannians, in analogy with the orthogonal Grassmann codes introduced in [4]. Note that the Lagrangian-Grassmannian codes are a special class of…
In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…
In the present paper we introduce and study a new notion of toric manifold in the quaternionic setting. We develop a construction with which, starting from appropriate $m$-dimensional Delzant polytopes, we obtain manifolds of real dimension…
In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…
The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum…
We give an optimal upper bound of the degree of quasi-smooth hypersurfaces which are invariant by a one-dimensional holomorphic foliation on a compact toric orbifold, i.e. on a complete simplicial toric variety. This bound depends only on…
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…