English
Related papers

Related papers: Primitive Zonotopes

200 papers

A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…

Combinatorics · Mathematics 2025-11-19 Jonah Berggren , Jeremy L. Martin , José A. Samper

The Birkhoff polytope is defined to be the convex hull of permutation matrices, $P_{\sigma}\ \forall \sigma\in S_n$. We define a second-order permutation matrix $P^{[2]}_{\sigma}$ in $\mathbb{R}^{n^2\times n^2}$ corresponding to a…

Optimization and Control · Mathematics 2014-09-08 Pawan Kumar Aurora , Shashank K Mehta

We study random polytopes of the form $[X_1,\ldots,X_n]$ defined as convex hulls of independent and identically distributed random points $X_1,\ldots,X_n$ in $\mathbb{R}^d$ with one of the following densities: $$ f_{d,\beta} (x) =…

Probability · Mathematics 2020-02-04 Zakhar Kabluchko , Christoph Thaele , Dmitry Zaporozhets

Mirkovi\'c-Vilonen (MV) polytopes are a class of generalized permutahedra originating from geometric representation theory. In this paper we study MV polytopes coming from matroid polytopes, flag matroid polytopes, Bruhat interval…

Combinatorics · Mathematics 2023-11-29 Mario Sanchez

Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensional and non-degenerate cases. Finschi and…

Combinatorics · Mathematics 2012-09-26 Komei Fukuda , Hiroyuki Miyata , Sonoko Moriyama

Given a polynomial f(z) = z^d + c over a global field K and a_0 in K, we study the density of prime ideals of K dividing at least one element of the orbit of a_0 under f. The density of such sets for linear polynomials has attracted much…

Number Theory · Mathematics 2015-08-18 Spencer Hamblen , Rafe Jones , Kalyani Madhu

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…

Combinatorics · Mathematics 2007-05-23 Thomas Lam , Alexander Postnikov

The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…

Combinatorics · Mathematics 2007-05-23 Alexander Postnikov

We express the matroid polytope $P_M$ of a matroid $M$ as a signed Minkowski sum of simplices, and obtain a formula for the volume of $P_M$. This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the…

Combinatorics · Mathematics 2013-01-17 Federico Ardila , Carolina Benedetti , Jeffrey Doker

We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at…

Optimization and Control · Mathematics 2007-05-23 Volker Kaibel , Marc E. Pfetsch

Let u and v be permutations on n letters, with u <= v in Bruhat order. A Bruhat interval polytope Q_{u,v} is the convex hull of all permutation vectors z = (z(1), z(2),...,z(n)) with u <= z <= v. Note that when u=e and v=w_0 are the…

Combinatorics · Mathematics 2015-06-11 Emmanuel Tsukerman , Lauren Williams

With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…

Optimization and Control · Mathematics 2024-07-02 Alberto Del Pia , Aida Khajavirad

The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…

Combinatorics · Mathematics 2011-04-07 Volker Kaibel

The convex hull generated by the restriction to the unit ball of a stationary Poisson point process in the $d$-dimensional Euclidean space is considered. By establishing sharp bounds on cumulants, exponential estimates for large deviation…

Probability · Mathematics 2015-12-15 Julian Grote , Christoph Thaele

A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational…

Computational Geometry · Computer Science 2017-04-07 Nathan Chadder , Antoine Deza

Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as well as the expected number of facets as…

Probability · Mathematics 2019-08-13 Gilles Bonnet , Eliza O'Reilly

There is a well-established dictionary between zonotopes, hyperplane arrangements, and their (oriented) matroids. Arguably one of the most famous examples is the class of graphical zonotopes, also called acyclotopes, which encode…

Combinatorics · Mathematics 2024-09-24 Eleonore Bach , Matthias Beck , Sophie Rehberg

In this note we investigate the convex hull of those $n \times n$-permutation matrices that correspond to symmetries of a regular $n$-gon. We give the complete facet description. As an application, we show that this yields a Gorenstein…

Combinatorics · Mathematics 2012-12-19 Barbara Baumeister , Christian Haase , Benjamin Nill , Andreas Paffenholz

We prove that each bounded polytope can be represented as a polynomial zonotope, which we refer to as the Z-representation of polytopes. Previous representations are the vertex representation (V-representation) and the halfspace…

Combinatorics · Mathematics 2019-10-17 Niklas Kochdumper , Matthias Althoff

Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…

Metric Geometry · Mathematics 2017-03-30 Marek Lassak