Related papers: Projective toric codes
We study the functional codes $C_2(X)$ defined on projective varieties $X$, in the case where $X\subset \mathbb{P}^3$ is a 1-degenerate quadric or a non-degenerate quadric (hyperbolic or elliptic). We find the minimum distance of these…
It is shown that up to dimension four, the toric ideal of a quiver polytope is generated in degree two, with the only exception of the four-dimensional Birkhoff polytope. As a consequence, B{\o}gvad's conjecture holds for quiver polytopes…
In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares…
We describe a computationally-efficient heuristic algorithm based on a renormalization-group procedure which aims at solving the problem of finding minimal surface given its boundary (curve) in any hypercubic lattice of dimension $D>2$. We…
We present a novel error correcting code and decoding algorithm which have construction similar to expander codes. The code is based on a bipartite graph derived from the subsumption relations of finite projective geometry, and Reed-Solomon…
Let $X$ be a rationally connected smooth projective variety of dimension $n$. We show that $X$ is a toric variety if and only if $X$ admits an int-amplified endomorphism with totally invariant ramification divisor. We also show that $X\cong…
Mitigating errors in computing and communication systems has seen a great deal of research since the beginning of the widespread use of these technologies. However, as we develop new methods to do computation or communication, we also need…
We determine the Euclidean distance degree of a projective toric variety. This extends the formula of Matsui and Takeuchi for the degree of the $A$-discriminant in terms of Euler obstructions. Our primary goal is the development of reliable…
We give a recursive construction for projective Reed-Muller codes in terms of affine Reed-Muller codes and projective Reed-Muller codes in fewer variables. From this construction, we obtain the dimension of the subfield subcodes of…
This paper announces results on the behavior of some important algebraic and topological invariants --- Euler characteristic, arithmetic genus, and their intersection homology analogues; the signature, etc. --- and their associated…
We describe two different approaches to making systematic classifications of plane lattice polygons, and recover the toric codes they generate, over small fields, where these match or exceed the best known minimum distance. This includes a…
The main result of this paper is a structural theorem for projective Q-factorial toric varieties X in P^N, covered by lines. We prove that there exists a toric fibration f: X -> Z, locally trivial in the Zariski topology, with fiber a…
Convex neural codes are combinatorial structures describing the intersection pattern of a collection of convex sets. Inductively pierced codes are a particularly nice subclass of neural codes introduced in the information visualization…
We prove a combinatorial version of Thom's Isotopy Lemma for projection maps applied to any complex or real toric variety. Our results are constructive and give rise to a method for associating the Whitney strata of the projection to the…
A theorem of Delzant states that any symplectic manifold $(M,\om)$ of dimension $2n$, equipped with an effective Hamiltonian action of the standard $n$-torus $\T^n = \R^{n}/2\pi\Z^n$, is a smooth projective toric variety completely…
For a given lattice polytope $P$ in $\mathbb{R}^3$, consider the space $\mathcal{L}_P$ of trivariate polynomials over a finite field $\mathbb{F}_q$, whose Newton polytopes are contained in $P$. We give an upper bound for the maximum number…
The toric residue is a map depending on n+1 semi-ample divisors on a complete toric variety of dimension n. It appears in a variety of contexts such as sparse polynomial systems, mirror symmetry, and GKZ hypergeometric functions. In this…
Expander (Tanner) codes combine sparse graphs with local constraints, enabling linear-time decoding and asymptotically good distance--rate tradeoffs. A standard constraint-counting argument yields the global-rate lower bound $R\ge 2r-1$ for…
We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on…
Toric varieties and their associated toric codes, as well as determination of their parameters with intersection theory, are presented in the two dimensional case. Linear Secret Sharing Schemes with strong multiplication are constructed…