Related papers: Extended Nestohedra and their Face Numbers
We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…
Spectrahedra are linear sections of the cone of positive semidefinite matrices that, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We reprove…
We define asymptotic lengths for families of oriented polytopes. We show that permutahedra with weak order orientations have asymptotic total length 1 and associahedra with Tamari order orientations have asymptotic total length 1/2.
Recently, "cosmohedra" have been introduced as polytopes underlying the cosmological wavefunction for conformally coupled Tr($\Phi^3$) theory in FRW cosmologies, generalizing associahedra for flat space scattering amplitudes. In this letter…
We describe a natural geometric relationship between matroids and underlying flag matroids by relating the geometry of the greedy algorithm to monotone path polytopes. This perspective allows us to generalize the construction of underlying…
A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in…
We characterise the set of fundamental groups for which there exist $n$-manifolds that are $h$-cobordant (hence homotopy equivalent) but not simple homotopy equivalent, when $n$ is sufficiently large. In particular, for $n \ge 12$ even, we…
For a generalized permutohedron $Q$ the enumerator $F(Q)$ of positive lattice points in interiors of maximal cones of the normal fan $\Sigma_Q$ is a quasisymmetric function. We describe this function for the class of nestohedra as a Hopf…
Partial permutohedra are lattice polytopes which were recently introduced and studied by Heuer and Striker. For positive integers $m$ and $n$, the partial permutohedron $\mathcal{P}(m,n)$ is the convex hull of all vectors in…
We introduce tools from discrete convexity theory and polyhedral geometry into the theory of West's stack-sorting map $s$. Associated to each permutation $\pi$ is a particular set $\mathcal V(\pi)$ of integer compositions that appears in a…
A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…
In recent years, high dimensional expanders have been found to have a variety of applications in theoretical computer science, such as efficient CSPs approximations, improved sampling and list-decoding algorithms, and more. Within that, an…
We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope. We find a sufficient condition for adjacency, and…
This manuscript introduces a finite collection of generalized permutohedra associated to a simple graph. The first polytope of this collection is the graphical zonotope of the graph and the last is the graph-associahedron associated to it.…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
For any flag simplicial complex $\Theta$ obtained by stellar subdividing the boundary of the cross polytope in edges, we define a flag simplicial complex $\Gamma(\Theta)$ (dependent on the sequence of subdivisions) whose $f$-vector is the…
We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members. This result directly implies a known lower bound on…
Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating…
Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…
We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…