39 citations · 175 across the 32 of their papers we have counts for
34 papers
On the Log-submodularity for zonoids: from Mixed Volume inequalities to the Hypercube
Gennadiy Averkov, Katherina von Dichter, Ivan Soprunov
We prove a log-submodularity-type inequality for zonoids in , extending the three-dimensional result of Fradelizi, Madiman, Meyer, and Zvavitch. More generally, we co…
On the discrete Heine-Shephard problem for four lattice polygons
Darren Gerrity, Ivan Soprunov
We study the set of square-free parts of volume polynomials associated with four planar lattice polytopes. This is motivated by the problem of describing possible pairwise intersec…
An algebraic-combinatorial proof of a Bezout-type inequality for mixed volumes of three-dimensional zonoids
Gennadiy Averkov, Ivan Soprunov
We present a new algebraic-combinatorial approach to proving a Bezout-type inequality for zonoids in dimension three, which has recently been established by Fradelizi, Madiman, Mey…
Binary Triorthogonal and CSS-T Codes for Quantum Error Correction
Eduardo Camps-Moreno, Hiram H. López, Gretchen L. Matthews +3
In this paper, we study binary triorthogonal codes and their relation to CSS-T quantum codes. We characterize the binary triorthogonal codes that are minimal or maximal with respec…
On the affine permutation group of certain decreasing Cartesian codes
Eduardo Camps-Moreno, Hiram H. López, Eliseo Sarmiento +1
A decreasing Cartesian code is defined by evaluating a monomial set closed under divisibility on a Cartesian set. Some well-known examples are the Reed-Solomon, Reed-Muller, and (s…
Mixed volumes of zonoids and the absolute value of the Grassmannian
Gennadiy Averkov, Katherina von Dichter, Simon Richard +1
Zonoids are Hausdorff limits of zonotopes, while zonotopes are convex polytopes defined as the Minkowski sums of finitely many segments. We present a combinatorial framework that l…