EL-Labelings and Canonical Spanning Trees for Subword Complexes

DOI10.1007/978-3-319-00200-2_13zbMath1271.05025arXiv1210.1435OpenAlexW1547723331MaRDI QIDQ2849001

Christian Stump, Vincent Pilaud

Publication date: 13 September 2013

Published in: Discrete Geometry and Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.1435

zbMATH Keywords

Möbius functionexhaustive generationspanning treesenumeration algorithmsubword complexesEL-labelingsincreasing flips

Mathematics Subject Classification ID

Trees (05C05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorial aspects of simplicial complexes (05E45)

Related Items (7)

Bruhat intervals, subword complexes and brick polyhedra for finite Coxeter groups ⋮ Brick polytopes, lattice quotients, and Hopf algebras ⋮ Hopf dreams and diagonal harmonics ⋮ Trimness of closed intervals in Cambrian semilattices ⋮ Associahedra via spines ⋮ Vertex barycenter of generalized associahedra ⋮ Brick polytopes of spherical subword complexes and generalized associahedra

Uses Software

• SageMath

This page was built for publication: EL-Labelings and Canonical Spanning Trees for Subword Complexes