Related papers: Realizing the $s$-permutahedron via flow polytopes
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…
Laplante-Anfossi associated to each rooted plane tree a polytope called an operahedron. He also defined a partial order on the vertex set of an operahedron and asked if the resulting poset is a lattice. We answer this question in the…
Given a lattice path $\nu$, the alt $\nu$-Tamari lattice is a partial order recently introduced by Ceballos and Chenevi\`ere, which generalizes the $\nu$-Tamari lattice and the $\nu$-Dyck lattice. All these posets are defined on the set of…
Loebl, Koml\'os and S\'os conjectured that every $n$-vertex graph $G$ with at least $n/2$ vertices of degree at least $k$ contains each tree $T$ of order $k+1$ as a subgraph. We give a sketch of a proof of the approximate version of this…
A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a…
We consider the incidence structure formed by the twelve pentagons given by the vertex neighborhoods of the icosahedron. Interpreting this structure purely in terms of coplanarity conditions, we show that -- up to projective equivalence --…
Imposing a strong condition on the linear order of shellable complexes, we introduce strong shellability. Basic properties, including the existence of dimension-decreasing strong shelling orders, are developed with respect to nonpure…
We study lattice polytopes which arise as the convex hull of chip vectors for \textit{self-reachable} chip configurations on a tree $T$. We show that these polytopes always have the integer decomposition property and characterize the vertex…
The paper describes a construction of abstract polytopes from Cayley graphs of symmetric groups. Given any connected graph G with p vertices and q edges, we associate with G a Cayley graph of the symmetric group S_p and then construct a…
The simplicity and hidden symmetries of (Super) Yang-Mills and (Super)Gravity scattering amplitudes suggest the existence of a "weak-weak" dual formulation in which these structures are made manifest at the expense of manifest locality. We…
We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…
The set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet $\Sigma = \{ x, y, z, ... \}$, where each letter has a…
Arkani-Hamed, Bai, He, and Yan (ABHY) discovered a convex realisation of the associahedron whose combinatorial and geometric structure generates tree-level amplitudes in bi-adjoint scalar theory. In this paper, we identify S-matrix of…
We investigate how sorting algorithms efficiently overcome the exponential size of the permutation space. Our main contribution is a new continuous-time formulation of sorting as a gradient flow on the permutohedron, yielding an independent…
Compared with the two-component Camassa-Holm system, the modified two-component Camassa-Holm system introduces a regularized density which makes possible the existence of solutions of lower regularity, and in particular of multipeakon…
In one of his papers on the weak order of Coxeter groups, Dyer formulates several conjectures. Among these, one affirms that the extended weak order forms a lattice, while another offers an algebraic-geometric description of the join of two…
We investigate a poset structure that extends the weak order on a finite Coxeter group $W$ to the set of all faces of the permutahedron of $W$. We call this order the facial weak order. We first provide two alternative characterizations of…
We show that groups with a mild form of non-positive curvature (a navigable path system) satisfy the weak rank rigidity conjecture: they either have linear divergence or a Morse element. This class includes discrete groups of projective…
Let L_1 and L_2 be complete atomistic lattices. In a previous paper, we have defined a set S=S(L_1,L_2) of complete atomistic lattices, the elements of which are called weak tensor products of L_1 and L_2. S is defined by means of three…
An $S$-hypersimplex for $S \subseteq \{0,1, \dots,d\}$ is the convex hull of all $0/1$-vectors of length $d$ with coordinate sum in $S$. These polytopes generalize the classical hypersimplices as well as cubes, crosspolytopes, and…