Related papers: Projective toric codes
This paper proves that every projective toric variety is the fine moduli space for stable representations of an appropriate bound quiver. To accomplish this, we study the quiver $Q$ with relations $R$ corresponding to the finite-dimensional…
This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…
We define weighted projective Reed-Muller codes over a subset of weighted projective space over a finite field. We focus on the case when the set X is a projective weighted torus. We show that the vanishing ideal of X is a lattice ideal and…
We describe our package PALP of C programs for calculations with lattice polytopes and applications to toric geometry, which is freely available on the internet. It contains routines for vertex and facet enumeration, computation of…
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…
In this article we investigate a class of linear error correcting codes in relation with the order polytopes. In particular we consider the order polytopes of tree posets and bipartite posets. We calculate the parameters of the associated…
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we…
A projective Reed-Muller (PRM) code, obtained by modifying a (classical) Reed-Muller code with respect to a projective space, is a doubly extended Reed-Solomon code when the dimension of the related projective space is equal to 1. The…
The aim of this article is to give lower bounds on the parameters of algebraic geometric error-correcting codes constructed from projective bundles over Deligne--Lusztig surfaces. The methods based on an intensive use of the intersection…
Toric codes are a type of evaluation code introduced by J.P. Hansen in 2000. They are produced by evaluating (a vector space composed by) polynomials at the points of $(\mathbb{F}_q^*)^s$, the monomials of these polynomials being related to…
Multivariate multiplicity codes (Kopparty, Saraf, and Yekhanin, J. ACM 2014) are linear codes where the codewords are described by evaluations of multivariate polynomials (with a degree bound) and their derivatives up to a fixed order, on a…
We give an explicit geometric way to build mixed-integer programming (MIP) formulations for unions of polyhedra. The construction is simply described in terms of spanning hyperplanes in an r-dimensional linear space. The resulting MIP…
We study embedded rational curves in projective toric varieties. Generalizing results of the first author and Zotine for the case of lines, we show that any degree $d$ rational curve in a toric variety $X$ can be constructed from a special…
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 expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
We discuss an experimental approach to open problems in toric geometry: are smooth projective toric varieties (i) projectively normal and (ii) defined by degree 2 equations? We discuss the creation of lattice polytopes defining smooth toric…
We show that the height of a toric variety with respect to a toric metrized line bundle can be expressed as the integral over a polytope of a certain adelic family of concave functions. To state and prove this result, we study the Arakelov…
This paper presents an algebraic construction of Euler-Maclaurin formulas for polytopes. The formulas obtained generalize and unite the previous lattice point formulas of Morelli and Pommersheim-Thomas, and the Euler-Maclaurin formulas of…
Navigating rigid body objects through crowded environments can be challenging, especially when narrow passages are presented. Existing sampling-based planners and optimization-based methods like mixed integer linear programming (MILP)…
Weighted projective spaces are natural generalizations of projective spaces with a rich structure. Projective Reed-Muller codes are error-correcting codes that played an important role in reliably transmitting information on digital…