2009/12/26 by Nathan Reading, Reading, Nathan · 1 citation
Computer Science · Mathematics · #20F55 (Primary) 05A18 (Secondary) #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.0912.5028
openalex publication_date 2009/12/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how the classical-type constructions of planar diagrams arise uniformly from projections of small W-orbits to the Coxeter plane. When the construction is applied beyond the classical cases, simple criteria are apparent for noncrossing and for compatibility for W of types H3 and I2(m) and less simple criteria can be found for compatibility in types E6, F4 and H4. Our construction also explains why simple combinatorial models are elusive in the larger exceptional types.