Related papers: Projective toric codes

This paper is devoted to the general problem of projection onto a polyhedral convex cone generated by a finite set of generators.This problem is reformulated into projection onto the polytope obtained by simple truncation of the original…

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

Let $X$ be a finite-dimensional normed space and let $Y \subseteq X$ be its proper linear subspace. The set of all minimal projections from $X$ to $Y$ is a convex subset of the space all linear operators from $X$ to $X$ and we can consider…

In pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using…

We describe the Minimal Model Program in the family of $\mathbb{Q}$-Gorenstein projective horospherical varieties, by studying a family of polytopes defined from the moment polytope of a Cartier divisor of the variety we begin with. In…

We present a unifying framework for generating extended formulations for the polyhedral outer approximations used in algorithms for mixed-integer convex programming (MICP). Extended formulations lead to fewer iterations of outer…

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

We present a geometrical analysis on the completely positive programming reformulation of quadratic optimization problems and its extension to polynomial optimization problems with a class of geometrically defined nonconvex conic programs…

This paper is a study of the interaction between the combinatorics of boundaries of convex polytopes in arbitrary dimension and their metric geometry. Let S be the boundary of a convex polytope of dimension d+1, or more generally let S be a…

The matrix completion problem provides a unifying lens through which many fundamental problems in coding theory can be viewed. In this paper, we investigate Locally Recoverable Codes (LRCs) with Maximal Recoverability (MR) and Maximum…

We totally classify the projective toric varieties whose canonical divisors are divisible by their dimensions. In Appendix, we show that Reid's toric Mori theory implies Mabuchi's characterization of the projective space for toric…

To find all two-dimensional equivariant symplectic submanifolds in symplectic toric manifolds, we combine the convex geometry of Delzant polytopes with local equivariant symplectic models and obtain a criterion for determining when a…

In this paper, we develop a toric analog of the theory of adelic divisors on quasi-projective arithmetic varieties introduced by Yuan and Zhang, and extend the convex-analytic descriptions of the Arakelov geometry of projective toric…

Projection methods aim to reduce the dimensionality of the optimization instance, thereby improving the scalability of high-dimensional problems. Recently, Sakaue and Oki proposed a data-driven approach for linear programs (LPs), where the…

We present a computational method for reconstructing a vector field on a convex polytope $\mathcal{P} \subset \mathbb{R}^d$ of arbitrary dimension from discrete samples. We specifically address the scenario where the vector field is subject…

We consider geometric methods of ``rotating" the toric code in higher dimensions to reduce the qubit count. These geometric methods can be used to prepare higher dimensional toric code states using single shot techniques, and in turn these…

We prove the Manin--Peyre equidistribution principle for smooth projective split toric varieties over the rational numbers. That is, rational points of bounded anticanonical height outside of the boundary divisors are equidistributed with…

Let $X$ be a 3-dimensional affine variety with a faithful action of a 2-dimensional torus $T$. Then the space of first order infinitesimal deformations $T^1(X)$ is graded by the characters of $T$, and the zeroth graded component $T^1(X)_0$…

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that…