Related papers: Polymake and Lattice Polytopes
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…
We describe the implementation of a subfield of the field of formal Puiseux series in polymake. This is employed for solving linear programs and computing convex hulls depending on a real parameter. Moreover, this approach is also useful…
Enumeration of various types of lattice polygons and in particular polyominoes is of primary importance in many machine learning, pattern recognition, and geometric analysis problems. In this work, we develop a large deviation principle for…
We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…
Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…
The lattice size of a lattice polytope is a geometric invariant which was formally introduced in the context of simplification of the defining equation of an algebraic curve, but appeared implicitly earlier in geometric combinatorics.…
A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained.
The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…
The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…
This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including…
It is shown how the Beneath-and-Beyond algorithm can be used to yield another proof of the equivalence of V- and H-representations of convex polytopes. In this sense this paper serves as the sketch of an introduction to polytope theory with…
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes. The…
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…
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 consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. To decompose such problems we introduce the new concept of core points, i.e., integral points whose orbit polytopes are…
There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…
This paper proposes a novel and simple algorithm of facet enumeration for convex polytopes. The complexity of the algorithm is discussed. The algorithm is implemented in Matlab. Some simple polytopes with known H-representations and…
We propose a new shape-based modeling technique for applications in imaging problems. Given a collection of shape priors (a shape dictionary), we define our problem as choosing the right dictionary elements and geometrically composing them…
We present a family of complete acyclic Morse matchings on the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. In a future paper we will utilize these…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…