Related papers: Toric Codes from Order Polytopes
We study the entanglement structure of topological orders subject to decoherence on the bipartition boundary. Focusing on the toric codes in $d$ space dimensions for $d=2,3,4$, we explore whether the boundary decoherence may be able to…
We consider linear systems on toric varieties of any dimension, with invariant base points, giving a characterization of special linear systems. We then make a new conjecture for linear systems on rational surfaces.
We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…
Motivated by problems arising with the symbolic analysis of steady state ideals in Chemical Reaction Network Theory, we consider the problem of testing whether the points in a complex or real variety with non-zero coordinates form a coset…
We show that errors in data transmitted through linear codes can be thought of as codewords of minimum weight of new linear codes. To determine errors we can then use methods specific to finding such special codewords. One of these methods…
We construct polyhedral families of valuations on the branching algebra of a morphism of reductive groups. This establishes a connection between the combinatorial rules for studying a branching problem and the tropical geometry of the…
Toric codes are evaluation codes obtained from an integral convex polytope $P \subset \R^n$ and finite field $\F_q$. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently by J. Hansen and D. Joyner.…
We investigate the logarithmic bundles associated to arrangements of hypersurfaces with a fixed degree in a smooth projective variety. We then specialize to the case when the variety is a quadric hypersurface and a multiprojective space to…
We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their subfield-subcodes with respect to the Hermitian…
We introduce bosonic error correction codes for particle loss and dephasing errors, constructed from states generated by particle number measurements on two-mode Gaussian states. We analyze these states for their suitability in correcting…
We compute the characteristic polynomials of the posets of hypertrees. We show that the generating series of the polynomials can be expressed using cyclic hypertrees. We also propose a conjecture on the action of the symmetric groups on the…
We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as…
The problem when the order polytope and the chain polytope of a finite partially ordered set are unimodularly equivalent will be solved.
In recent years, questions about the construction of special orderings of a given graph search were studied by several authors. On the one hand, the so called end-vertex problem introduced by Corneil et al. in 2010 asks for search orderings…
The polarization process of polar codes over a ternary alphabet is studied. Recently it has been shown that the scaling of the blocklength of polar codes with prime alphabet size scales polynomially with respect to the inverse of the gap…
In this paper, we propose a probabilistic algorithm suitable for any linear code $C$ to determine whether a given vector $\mathbf{x}$ belongs to $ C$. The algorithm achieves $O(n\log n)$ time complexity, $ O(n^2)$ space complexity and with…
We describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…
We establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight…
We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…
We address the task of higher-order derivative evaluation of computer programs that contain QR decompositions and real symmetric eigenvalue decompositions. The approach is a combination of univariate Taylor polynomial arithmetic and matrix…