Related papers: Hochschild polytopes
We introduce polyhedral cones associated with $m$-hemimetrics on $n$ points, and, in particular, with $m$-hemimetrics coming from partitions of an $n$-set into $m+1$ blocks. We compute generators and facets of the cones for small values of…
This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…
A maniplex of rank n is a connected, n-valent, edge-coloured graph that generalises abstract polytopes and maps. If the automorphism group of a maniplex M partitions the vertex-set of M into k distinct orbits, we say that M is a k-orbit…
The multiplihedra {M_n} form a family of polytopes originating in the study of higher categories and homotopy theory. While the multiplihedra may be unfamiliar to the algebraic combinatorics community, it is nestled between two families of…
A Coxeter $n$-orbifold is an $n$-dimensional orbifold based on a polytope with silvered boundary facets. Each pair of adjacent facets meet on a ridge of some order $m$, whose neighborhood is locally modeled on ${\mathbb R}^n$ modulo the…
The permutohedron $P_n$ of order $n$ is a polytope embedded in $\mathbb{R}^n$ whose vertex coordinates are permutations of the first $n$ natural numbers. It is obvious that $P_n$ lies on the hyperplane $H_n$ consisting of points whose…
The associahedron is a polytope whose graph is the graph of flips on triangulations of a convex polygon. Pseudotriangulations and multitriangulations generalize triangulations in two different ways, which have been unified by Pilaud and…
A multidimensional nonnegative matrix is called polystochastic if the sum of entries in each of its lines equals $1$. The set of all polystochastic matrices of order $n$ and dimension $d$ is a convex polytope $\Omega_n^d$ known as the…
We show that every heptagon is a section of a $3$-polytope with $6$ vertices. This implies that every $n$-gon with $n\geq 7$ can be obtained as a section of a $(2+\lfloor\frac{n}{7}\rfloor)$-dimensional polytope with at most…
A cosmological polytope is a lattice polytope introduced by Arkani-Hamed, Benincasa, and Postnikov in their study of the wavefunction of the universe in a class of cosmological models. More concretely, they construct a cosmological polytope…
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…
Generalized permutahedra are the polytopes obtained from the permutahedron by changing the edge lengths while preserving the edge directions, possibly identifying vertices along the way. We introduce a "lifting" construction for these…
Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…
For an $n \times n$ nonnegative matrix $P$, an isomorphism is obtained between the lattice of initial subsets (of ${1,...,n}$) for $P$ and the lattice of $P$-invariant faces of the nonnegative orthant $\IR^{n}_{+}$. Motivated by this…
Let $1 \le m \le n$. We prove various results about the chessboard complex $M_{m,n}$, which is the simplicial complex of matchings in the complete bipartite graph $K_{m,n}$. First, we demonstrate that there is nonvanishing 3-torsion in…
Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element…
We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss the special case of simple polyhedra and present computational…
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…
A pebble tree is an ordered tree where each node receives some colored pebbles, in such a way that each unary node receives at least one pebble, and each subtree has either one more or as many leaves as pebbles of each color. We show that…
A multisection, or $n$-section, of an $(n + 1)$-dimensional manifold is a decomposition of this manifold into $n$ $1$-handlebodies of dimension $n+1$, such that all these handlebodies intersect along a closed surface, and every…