English
Related papers

Related papers: Extended Nestohedra and their Face Numbers

200 papers

We extend the works of Loday-Ronco and Burgunder-Ronco on the tridendriform decomposition of the shuffle product on the faces of associahedra and permutohedra, to other families of hypergraph polytopes (or nestohedra), including simplices,…

Combinatorics · Mathematics 2022-11-30 Pierre-Louis Curien , Bérénice Delcroix-Oger , Jovana Obradović

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

We consider the convex hull $P_{\varphi}(G)$ of all satisfying assignments of a given MSO formula $\varphi$ on a given graph $G$. We show that there exists an extended formulation of the polytope $P_{\varphi}(G)$ that can be described by…

Data Structures and Algorithms · Computer Science 2023-06-22 Petr Kolman , Martin Koutecký , Hans Raj Tiwary

We give the facet description of the deformation cones of graph associahedra and nestohedra, generalizing the classical parametrization of the family of deformed permutahedra by the cone of submodular functions. When the underlying building…

Combinatorics · Mathematics 2023-11-14 Arnau Padrol , Vincent Pilaud , Germain Poullot

The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…

Combinatorics · Mathematics 2015-06-16 Satyan L. Devadoss , Rahul Shah , Xuancheng Shao , Ezra Winston

We define term rewriting systems on the vertices and faces of nestohedra, and show that the former are confluent and terminating. While the associated posets on vertices generalize Barnard--McConville's flip order for graph-associahedra,…

Category Theory · Mathematics 2025-01-22 Pierre-Louis Curien , Guillaume Laplante-Anfossi

This paper is a study of the polyhedral geometry of Gelfand-Tsetlin patterns arising in the representation theory $\mathfrak{gl}_n \C$ and algebraic combinatorics. We present a combinatorial characterization of the vertices and a method to…

Combinatorics · Mathematics 2007-05-23 Jesús A. De Loera , Tyrrell B. McAllister

We present a combinatorial isomorphism between Stasheff associahedra and an inductive cone construction of those complexes given by Loday. We give an alternate description of certain polytopes, known as multiplihedra, which arise in the…

Combinatorics · Mathematics 2025-11-25 Somnath Basu , Sandip Samanta

The shape of crystalline nanoparticles (NP) can often be described by polyhedra with flat facet surfaces. Thus, structural studies of polyhedral bodies can help to describe geometric details of NPs. Here we consider compact polyhedra of…

Mesoscale and Nanoscale Physics · Physics 2023-07-24 Klaus E. Hermann

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

Alcoved polytopes are characterized by the property that all facet normal directions are parallel to the roots $e_i-e_j$. Unlike other prominent families of polytopes, like generalized permutahedra, alcoved polytopes are not closed under…

Combinatorics · Mathematics 2025-11-05 Nick Early , Lukas Kühne , Leonid Monin

Scattering amplitudes of $\operatorname{tr}(\phi^3)$ theory can be encoded as the canonical form of the Stasheff associahedron. Similarly, the flat-space wavefunction coefficients of the same theory are captured by the recently proposed…

High Energy Physics - Theory · Physics 2025-11-17 Stefan Forcey , Ross Glew , Hyungrok Kim

In this note, we study the permutohedral geometry of the poles of a certain differential form introduced in recent work of Arkani-Hamed, Bai, He and Yan. There it was observed that the poles of the form determine a family of polyhedra which…

Combinatorics · Mathematics 2024-05-22 Nick Early

Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…

Combinatorics · Mathematics 2022-03-24 Matthew Kwan , Lisa Sauermann , Yufei Zhao

Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…

Computational Geometry · Computer Science 2021-07-02 David Eppstein

The invariants of finite-dimensional representations of simple Lie algebras, such as even-degree indices and anomaly numbers, are considered in the context of the non-crystallographic finite reflection groups $H_2$, $H_3$ and $H_4$. Using a…

Mathematical Physics · Physics 2021-01-28 Mariia Myronova , Jiri Patera , Marzena Szajewska

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

Given an $n$-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the $n$-gon (viewed as a disc with $n$…

Geometric Topology · Mathematics 2018-11-14 Joseph Gordon , Gaiane Panina

An assosiahedron $\mathcal{K}^n$, known also as Stasheff polytope, is a multifaceted combinatorial object, which, in particular, can be realized as a convex hull of certain points in $\mathbf{R}^{n}$, forming $(n-1)$-dimensional polytope. A…

Combinatorics · Mathematics 2011-03-31 Kira Adaricheva

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