English
Related papers

Related papers: Higher Secondary Polytopes for Two-Dimensional Zon…

200 papers

We give a self-contained introduction to the theory of secondary polytopes and geometric bistellar flips in triangulations of polytopes and point sets, as well as a review of some of the known results and connections to algebraic geometry,…

Combinatorics · Mathematics 2007-06-13 Francisco Santos

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $r<d$, as a (recursively defined)…

Computational Geometry · Computer Science 2015-03-03 Menelaos I. Karavelas , Eleni Tzanaki

Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…

Combinatorics · Mathematics 2023-12-06 Jane Ivy Coons , Joseph Cummings , Benjamin Hollering , Aida Maraj

Minkowski sums of simplices in ${\mathbb{R}}^n$ form an interesting class of polytopes that seem to emerge in various situations. In this paper we discuss the Minkowski sum of the simplices $\Delta_{k-1}$ in ${\mathbb{R}}^n$ where $k$ and…

Combinatorics · Mathematics 2016-11-17 Geir Agnarsson

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 links the study of mixed volumes of zonoids (a topic that has…

Combinatorics · Mathematics 2024-11-04 Gennadiy Averkov , Katherina von Dichter , Simon Richard , Ivan Soprunov

We introduce and study a family of polytopes which can be seen as a generalization of the permutahedron of type $B_d$. We highlight connections with the largest possible diameter of the convex hull of a set of points in dimension $d$ whose…

Optimization and Control · Mathematics 2017-02-07 Antoine Deza , George Manoussakis , Shmuel Onn

Let $A,B \subseteq \mathbb{R}^d $ both span $\mathbb{R}^d$ such that $\langle a, b \rangle \in \{0,1\}$ holds for all $a \in A$, $b \in B$. We show that $ |A| \cdot |B| \le (d+1) 2^d $. This allows us to settle a conjecture by Bohn, Faenza,…

Combinatorics · Mathematics 2020-08-18 Andrey Kupavskii , Stefan Weltge

It has been shown by Soprunov that the normalized mixed volume (minus one) of an $n$-tuple of $n$-dimensional lattice polytopes is a lower bound for the number of interior lattice points in the Minkowski sum of the polytopes. He defined…

Combinatorics · Mathematics 2020-02-27 Gabriele Balletti , Christopher Borger

We investigate a family of polytopes introduced by E.M.\ Feichtner, A.\ Postnikov and B.\ Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in…

Combinatorics · Mathematics 2011-10-07 K. Dosen , Z. Petric

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 objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with…

Combinatorics · Mathematics 2009-02-14 Komei Fukuda , Christophe Weibel

Polytope complexes are the generalisation of polygon meshes in geo-information systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straight-forward…

Computational Geometry · Computer Science 2012-05-28 Norbert Paul

In 1996, Edelman and Reiner defined the two higher Stasheff--Tamari orders on triangulations of cyclic polytopes and conjectured them to coincide. We open up an algebraic angle for approaching this conjecture by showing how these orders…

Combinatorics · Mathematics 2021-02-22 Nicholas J. Williams

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes.…

Computational Geometry · Computer Science 2011-10-04 Menelaos I. Karavelas , Eleni Tzanaki

This is the first paper in a series on new higher categorical structures called higher Segal spaces. For every d > 0, we introduce the notion of a d-Segal space which is a simplicial space satisfying locality conditions related to…

Algebraic Topology · Mathematics 2021-06-01 Tobias Dyckerhoff , Mikhail Kapranov

This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…

Combinatorics · Mathematics 2024-11-22 Marie-Charlotte Brandenburg , Roland Púček

We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…

Combinatorics · Mathematics 2018-09-10 Hugo Parlier , Lionel Pournin

High-dimensional expanders are a generalization of the notion of expander graphs to simplicial complexes and give rise to a variety of applications in computer science and other fields. We provide a general tool to construct families of…

Combinatorics · Mathematics 2025-02-11 Laura Grave de Peralta , Inga Valentiner-Branth

We introduce topological prismatoids, a combinatorial abstraction of the (geometric) prismatoids recently introduced by the second author to construct counter-examples to the Hirsch conjecture. We show that the `strong $d$-step Theorem'…

Combinatorics · Mathematics 2022-08-05 Francisco Criado , Francisco Santos

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

Metric Geometry · Mathematics 2020-02-20 Lyle Ramshaw , James B. Saxe