English
Related papers

Related papers: Projective toric codes

200 papers

It is demonstrated how the software system polymake can be used for computations in toric geometry. More precisely, counter-examples to conjectures related to A-determinants and defect polytopes are constructed.

Combinatorics · Mathematics 2011-05-26 Michael Joswig , Andreas Paffenholz

Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for…

Information Theory · Computer Science 2017-02-23 Johan P. Hansen

We show how the theory of affine geometries over the ring ${\mathbb Z}/\langle q - 1\rangle$ can be used to understand the properties of toric and generalized toric codes over ${\mathbb F}_q$. The minimum distance of these codes is strongly…

Information Theory · Computer Science 2017-03-08 John B. Little

Let $W$ be a finite group generated by reflections of a lattice $M$. If a lattice polytope $P \subset M \otimes_{\mathbb Z}\mathbb R$ is preserved by $W$, then we show that the quotient of the projective toric variety $X_P$ by $W$ is…

Combinatorics · Mathematics 2026-01-29 Colin Crowley , Tao Gong , Connor Simpson

Toric quiver varieties (moduli spaces of quiver representations) are studied. Given a quiver and a weight there is an associated quasiprojective toric variety together with a canonical embedding into projective space. It is shown that for a…

Representation Theory · Mathematics 2014-02-21 M. Domokos , Dániel Joó

Toric codes and color codes are two important classes of topological codes. Kubica, Yoshida, and Pastawski showed that any $D$-dimensional color code can be mapped to a finite number of toric codes in $D$-dimensions. In this paper we…

Quantum Physics · Physics 2018-07-11 Arun B. Aloshious , Pradeep Kiran Sarvepalli

This is a tutorial on some aspects of toric varieties related to their potential use in geometric modeling. We discuss projective toric varieties and their ideals, as well as real toric varieties and the algebraic moment map. In particular,…

Algebraic Geometry · Mathematics 2008-04-18 Frank Sottile

For every complete toric variety, there exists a projective toric variety which is isomorphic to it in codimension one. In this paper, we show that every smooth non-projective complete toric threefold of Picard number at most five becomes…

Algebraic Geometry · Mathematics 2025-07-15 Osamu Fujino , Hiroshi Sato

In this article, we give a survey of Geometric Invariant Theory for Toric Varieties, and present an application to the Einstein-Weyl Geometry. We compute the image of the Minitwistor space of the Honda metrics as a categorical quotient…

Algebraic Geometry · Mathematics 2011-08-17 Mustafa Kalafat

Let A be an ample line bundle on a projective toric variety X of dimension n. We show that if l>=n-1+p, then A^l satisfies the property N_p. Applying similar methods, we obtain a combinatorial theorem: For a given lattice polytope P we give…

Algebraic Geometry · Mathematics 2007-05-23 Milena Hering

We study the general integer programming (IP) problem of optimizing a separable convex function over the integer points of a polytope: $\min \{f(\mathbf{x}) \mid A\mathbf{x} = \mathbf{b}, \, \mathbf{l} \leq \mathbf{x} \leq \mathbf{u}, \,…

Data Structures and Algorithms · Computer Science 2025-05-29 Christoph Hunkenschröder , Martin Koutecký , Asaf Levin , Tung Anh Vu

In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert…

Information Theory · Computer Science 2011-12-16 Manuel Gonzalez Sarabia , Carlos Renteria Marquez , Eliseo Sarmiento Rosales

To any graph $G$ one can associate a toric variety $X(\mathcal{P}G)$, obtained as a blowup of projective space along coordinate subspaces corresponding to connected subgraphs of $G$. The polytope of this toric variety is the graph…

Algebraic Geometry · Mathematics 2017-06-06 Rodrigo Ferreira da Rosa , David Jensen , Dhruv Ranganathan

These notes are based on a series of lectures given by the author at the Max Planck Institute for Mathematics in the Sciences in Leipzig. Addressed topics include affine and projective toric varieties, abstract normal toric varieties from…

Algebraic Geometry · Mathematics 2022-03-04 Simon Telen

We study how geometric properties of tropical convex sets and polytopes, which are of interest in many application areas, manifest themselves in their algebraic structure as modules over the tropical semiring. Our main results establish a…

Rings and Algebras · Mathematics 2016-10-04 Zur Izhakian , Marianne Johnson , Mark Kambites

We study polynomial systems with prescribed monomial supports in the Cox rings of toric varieties built from complete polyhedral fans. We present combinatorial formulas for the dimensions of their associated subvarieties under genericity…

Symbolic Computation · Computer Science 2024-02-21 Matías Bender , Pierre-Jean Spaenlehauer

In this note we gather and review some facts about existence of toric spaces over 3-dimensional simple polytopes. First, over every combinatorial 3-polytope there exists a quasitoric manifold. Second, there exist combinatorial 3-polytopes,…

Algebraic Topology · Mathematics 2026-02-10 Anton Ayzenberg

Given a smooth projective variety $X$ over a number field $k$ and $P\in X(k)$, the first author conjectured that in a precise sense, any sequence that approximates $P$ sufficiently well must lie on a rational curve. We prove this conjecture…

Algebraic Geometry · Mathematics 2020-04-14 David McKinnon , Matthew Satriano

Let $A$ be an $(m \times n)$ integral matrix, and let $P=\{ x : A x \leq b\}$ be an $n$-dimensional polytope. The width of $P$ is defined as $ w(P)=min\{ x\in \mathbb{Z}^n\setminus\{0\} :\: max_{x \in P} x^\top u - min_{x \in P} x^\top v…

Computational Geometry · Computer Science 2022-11-30 Dmitry Gribanov , Sergey Veselov

We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can…

Computational Complexity · Computer Science 2015-11-25 John Kim , Swastik Kopparty