English
Related papers

Related papers: Multi-splits and tropical linear spaces from neste…

200 papers

In a previous work, we gave a construction of (not necessarily realizable) oriented matroids from a triangulation of a product of two simplices. In this follow-up paper, we use a variant of Viro's patchworking to derive a topological…

Combinatorics · Mathematics 2020-10-26 Marcel Celaya , Georg Loho , Chi Ho Yuen

A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…

Combinatorics · Mathematics 2010-02-14 Barbara Baumeister , Christian Haase , Benjamin Nill , Andreas Paffenholz

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

We introduce a class of cusped hyperbolic $3$-manifolds that we call mixed-platonic, composed of regular ideal hyperbolic polyhedra of more than one type, which includes certain previously-known examples. We establish basic facts about…

Geometric Topology · Mathematics 2024-07-16 Eric Chesebro , Michelle Chu , Jason DeBlois , Neil R. Hoffman , Priyadip Mondal , Genevieve S. Walsh

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

This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another…

Combinatorics · Mathematics 2014-12-02 Michael Gene Dobbins

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

Combinatorics · Mathematics 2024-01-17 Gunnar Fløystad

We introduce a concept of multiplicity lattices of 2-multiarrangements, determine the combinatorics and geometry of that lattice, and give a criterion and method to construct a basis for derivation modules effectively.

Combinatorics · Mathematics 2014-02-11 Takuro Abe , Yasuhide Numata

We define the notion of complex stratification by quasifolds and show that such spaces occur as complex quotients by certain nonclosed subgroups of tori associated to convex polytopes. The spaces thus obtained provide a natural…

Algebraic Geometry · Mathematics 2008-03-02 Fiammetta Battaglia

We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…

Discrete Mathematics · Computer Science 2019-04-09 Matthias Walter

We present statistics on the decompositions (with respect to a distinguished symmetric 2t-cycle) of vertices of the hypercube graph, whose negative parts are covered by two subsets of the ground set {1,...,t} of the corresponding oriented…

Combinatorics · Mathematics 2023-03-24 Andrey O. Matveev

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

Combinatorics · Mathematics 2015-01-23 Volker Kaibel , Matthias Walter

Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…

Combinatorics · Mathematics 2015-01-30 Hiroyuki Miyata , Arnau Padrol

The (n,k)-hypersimplex is the convex hull of all 0/1-vectors of length n with coordinate sum k. We explicitly determine the extension complexity of all hypersimplices as well as of certain classes of combinatorial hypersimplices. To that…

Metric Geometry · Mathematics 2017-02-28 Francesco Grande , Arnau Padrol , Raman Sanyal

Let $P$ be a polytope. The hitting number of $P$ is the smallest size of a hitting set of the facets of $P$, i.e., a subset of vertices of $P$ such that every facet of $P$ has a vertex in the subset. An extended formulation of $P$ is the…

Combinatorics · Mathematics 2021-06-24 Manuel Aprile

For a polytope P a simplex S with vertex set V(S) is called a special simplex if every facet of P contains all but exactly one vertex of S. For such polytopes P with face complex F(P) containing a special simplex the subcomplex F(P) / V(S)…

Combinatorics · Mathematics 2010-10-01 Timo de Wolff

Moduli spaces of quadratic differentials with prescribed singularities are not necessarily connected. We describe here all cases when they have a special hyperelliptic connected component. We announce the general classification theorem: up…

Geometric Topology · Mathematics 2007-05-23 Erwan Lanneau

We construct and study a family of double-periodic almost entire solutions of the maximal surface equation. The solutions are parameterized by a submanifold of $3\times 3$-matrices (the so-called generating matrices). We show that the…

Differential Geometry · Mathematics 2009-03-10 Vladimir V. Sergienko , Vladimir G. Tkachev

Several properties of the isotropic matroid of a looped simple graph are presented. Results include a characterization of the multimatroids that are associated with isotropic matroids and several ways in which the isotropic matroid of G…

Combinatorics · Mathematics 2016-10-20 Robert Brijder , Lorenzo Traldi

Let $Z$ be the typical cell of a stationary Poisson hyperplane tessellation in $\mathbb{R}^d$. The distribution of the number of facets $f(Z)$ of the typical cell is investigated. It is shown, that under a well-spread condition on the…

Probability · Mathematics 2016-08-30 Gilles Bonnet , Pierre Calka , Matthias Reitzner