Related papers: Cyclic polytope of the simplest cubic fields
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
Inspired by Coxeter's notion of Petrie polygon for $d$-polytopes (see \cite{Cox73}), we consider a generalization of the notion of zigzag circuits on complexes and compute the zigzag structure for several interesting families of…
This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…
This is the same version that was previously only on my home page. We give a description of geometric realization which makes it evident that it commutes with products. A similar approach is used to treat cyclic sets. Our approach is…
Finite smooth digraphs, that is, finite directed graphs without sources and sinks, can be partially ordered via pp-constructability. We give a complete description of this poset and, in particular, we prove that it is a distributive…
Two types of particles, A and B with their corresponding antiparticles, are defined in a one dimensional cyclic lattice with an odd number of sites. In each step of time evolution, each particle acts as a source for the polarization field…
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…
Motivated by relations with a symplectic invariant known as the "cylindrical symplectic capacity", in this note we study the expectation of the area of a minimal projection to a complex line for a randomly rotated cube.
In this paper it is shown that the space of tight geodesic segments connecting any two vertices in a complex of cycles has finite, uniformly bounded dimension. The dimension is defined in terms of a discrete analogue of Jacobi fields, which…
Let $q$ be a non-degenerate quadratic form defined on an $F$ vector space $V$ and $a \in F$. We consider the Cayley graph on $V$ with generating set $\{x \in V \mid q(x) = a\}$ and study its diameter and girth. In particular, if $F$ is a…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…
There are many practical applications that require simplification of polylines. Some of the goals are to reduce the amount of information necessary to store, improve processing time, or simplify editing. The simplification is usually done…
We have previously explored cylindrical packings of disks and their relation to sphere packings. Here we extend the analytical treatment of disk packings, analysing the rules for phyllotactic indices of related structures and the variation…
We discuss the problem of counting vertices in Gelfand-Zetlin polytopes. Namely, we deduce a partial differential equation with constant coefficients on the exponential generating function for these numbers. For some particular classes of…
LDPC codes constructed from permutation matrices have recently attracted the interest of many researchers. A crucial point when dealing with such codes is trying to avoid cycles of short length in the associated Tanner graph, i.e. obtaining…
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we classify the facets of the contact polytope of the Leech lattice up to symmetry. There are 1,197,362,269,604,214,277,200 many facets in 232…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
We develop tools for characterizing vertices of fiber products of polytopes and apply them to simplicial distribution polytopes, a class of probability polytopes arising in quantum foundations and quantum information. In the theory of…