The \(M\)-triangle of generalised non-crossing partitions for the types \(E_7\) and \(E_8\).

zbMath1267.05293arXivmath/0601676MaRDI QIDQ2654571

Christian Krattenthaler

Publication date: 19 January 2010

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

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

zbMATH Keywords

Möbius functionroot systemsface numbersF -trianglegeneralised cluster complexgeneralised non-crossing partitionsM -triangle

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Related Items

The rank enumeration of certain parabolic non-crossing partitions ⋮ Refined lattice path enumeration and combinatorial reciprocity ⋮ On the \(H\)-triangle of generalised nonnesting partitions ⋮ On noncrossing and nonnesting partitions of type \(D\)

Uses Software

• coxeter

This page was built for publication: The \(M\)-triangle of generalised non-crossing partitions for the types \(E_7\) and \(E_8\).