Related papers: On the Parameters of r-dimensional Toric Codes
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…
This paper is devoted to some rotationally symmetric classes of graphs denoted in literature as convex polytope graphs. Exact value of equidistant dimension is found for $T_n$. Next, for even $n$ exact values are found for $R''_n$ and…
We give an explicit formula for the rational category of an elliptic space whose minimal model has a homogeneous-length differential. We also show that for such a space, there are no gaps in the sequence of integers realized as the rational…
We show that the loop spaces of real projective spaces are topologically approximated by the spaces of rational maps from RP(1) to RP(n). As a byproduct of our constructions we obtain an interpretation of the Kronecker characteristic…
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…
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…
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 identify a combinatorial quantity (the alternating sum of the h-vector) defined for any simple polytope as the signature of a toric variety. This quantity was introduced by Charney and Davis in their work, which in particular showed that…
A convex polyhedron, that is, a compact convex subset of $\mathbb{R}^3$ which is the intersection of finitely many closed half-spaces, can be rectified by taking the convex hull of the midpoints of the edges of the polyhedron. We derive…
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect…
We are concerned with the computational problem of determining the covering radius of a rational polytope. This parameter is defined as the minimal dilation factor that is needed for the lattice translates of the correspondingly dilated…
Topological subsystem codes in three spatial dimensions allow for quantum error correction with no time overhead, even in the presence of measurement noise. The physical origins of this single-shot property remain elusive, in part due to…
The hull of a linear code (i.e., a finite field vector space)~\({\mathcal C}\) is defined to be the vector space formed by the intersection of~\({\mathcal C}\) with its dual~\({\mathcal C}^{\perp}.\) Constructing vector spaces with a…
We study error-correcting codes in the space $\mathcal{S}_{n,q}$ of length-$n$ multisets over a $q$-ary alphabet under the deletion metric, motivated by permutation channels in which ordering is completely lost and errors act only on symbol…
We prove that, for every norm on $\mathbb{R}^d$ and every $E \subseteq \mathbb{R}^d$, the Hausdorff dimension of the distance set of $E$ with respect to that norm is at least $\dim_{\mathrm{H}} E - (d-1)$. An explicit construction follows,…
We show how to construct certain homogeneous deformations for rational normal varieties with codimension one torus action. This can then be used to construct homogeneous deformations of any toric variety in arbitrary degree. For locally…
Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this thesis we explore this correspondence to classify smooth lattice…
A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…
Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code {\it optimal} if it achieves the Singleton-type bound). In the breakthrough work of \cite{TB14}, several classes of…
Every normal toric ideal of codimension two is minimally generated by a Grobner basis with squarefree initial monomials. A polynomial time algorithm is presented for checking whether a toric ideal of fixed codimension is normal.