Related papers: Polymake and Lattice Polytopes
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
The duality between a class of the Davey-Stewartson type coupled systems and a class of two-dimensional Toda type lattices is discussed. A new coupled system related to the recently found lattice is presented. A method for eliminating…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
Lattice models or structures are geometrical objects with mathematical forms, that are used to represent physical systems. They have been used widely in diverse fields, namely, in condensed matter physics, to study degrees of freedom of…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we…
The purpose of this paper is to study convex bodies $C$ for which there exists no convex body $C^\prime\subsetneq C$ of the same lattice width. Such bodies shall be called ``lattice reduced'', and they occur naturally in the study of the…
The free sum is a basic geometric operation among convex polytopes. This note focuses on the relationship between the normalized volume of the free sum and that of the summands. In particular, we show that the normalized volume of the free…
This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings,…
One may associate several frames to a given polytope, such as its collection of vertices, edges, or facet normal vectors. In this note, we use these frames to generate geometric inequalities for the simplex in $\mathbb{R}^d$ and polytopes…
The bottom complex of a finite polyhedal pointed rational cone is the lattice polytopal complex of the compact faces of the convex hull of nonzero lattice points in the cone. The algebra, associated to the bottom complex of a cone, defines…
We review models of random geometries based on the dynamical lattice approach. We discuss one dimensional model of simplicial complexes (branched polymers), two dimensional model of dynamical triangulations and four dimensional model of…
Reconstructing a composition (union) of convex polytopes that perfectly fits the corresponding input point-cloud is a hard optimization problem with interesting applications in reverse engineering and rigid body dynamics simulations. We…
We present a dynamical systems approach for geometric matchings in an ensemble of polytopes along rigid-body motions. Each polytope can be characterized by a vertex set and edge or faces determined by vertices, and polygons and simplexes…
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…
Will the cosmological multiverse, when described mathematically, have easily stated properties that are impossible to prove or disprove using mathematical physics? We explore this question by constructing lattice multiverses which exhibit…
We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set,…
We introduce a class of $n$-dimensional (possibly inhomogeneous) spin-like lattice systems presenting modulated phases with possibly different textures. Such systems can be parameterized according to the number of ground states, and can be…
For many applications, we need to use techniques to represent convex shapes and objects. In this work, we use level set method to represent shapes and find a necessary and sufficient condition on the level set function to guarantee the…
We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope…