English

Operahedron Lattices

Combinatorics 2024-02-21 v1

Abstract

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 affirmative, motivating us to name Laplante-Anfossi's posets operahedron lattices. The operahedron lattice of a chain with n+1n+1 vertices is isomorphic to the nn-th Tamari lattice, while the operahedron lattice of a claw with n+1n+1 vertices is isomorphic to Weak(Sn)\mathrm{Weak}(\mathfrak S_n), the weak order on the symmetric group Sn\mathfrak S_n. We characterize semidistributive operahedron lattices and trim operahedron lattices. Let ΔWeak(Sn)(w(k,n))\Delta_{\mathrm{Weak}(\mathfrak S_n)}(w_\circ(k,n)) be the principal order ideal of Weak(Sn)\mathrm{Weak}(\mathfrak S_n) generated by the permutation w(k,n)=k(k1)1(k+1)(k+2)n{w_\circ(k,n)=k(k-1)\cdots 1(k+1)(k+2)\cdots n}. Our final result states that the operahedron lattice of a broom with n+1n+1 vertices and kk leaves is isomorphic to the subposet of Weak(Sn)\mathrm{Weak}(\mathfrak S_n) consisting of the preimages of ΔWeak(Sn)(w(k,n))\Delta_{\mathrm{Weak}(\mathfrak S_n)}(w_\circ(k,n)) under West's stack-sorting map; as a consequence, we deduce that this subposet is a semidistributive lattice.

Keywords

Cite

@article{arxiv.2402.12717,
  title  = {Operahedron Lattices},
  author = {Colin Defant and Andrew Sack},
  journal= {arXiv preprint arXiv:2402.12717},
  year   = {2024}
}

Comments

25 pages, 10 figures

R2 v1 2026-06-28T14:54:03.756Z