The M-triangle of generalised non-crossing partitions for the types E₇ and E₈.

zbMATH Open1267.05293arXivmath/0601676MaRDI QIDQ2654571FDOQ2654571

Authors: C. Krattenthaler 

Publication date: 19 January 2010

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

Abstract: The $M$-triangle of a ranked locally finite poset $P$ is the generating function $su{m}_{u,winP}^{}mu(u,w)x^{ku}{y}^{kw}$, where $mu(.,.)$ is the M"obius function of $P$. We compute the $M$-triangle of Armstrong's poset of $m$-divisible non-crossing partitions for the root systems of type $E_7$ and $E_8$. For the other types except $D_n$ this had been accomplished in the earlier paper "The $F$-triangle of the generalised cluster complex." Altogether, this almost settles Armstrong's $F=M$ Conjecture predicting a surprising relation between the $M$-triangle of the $m$-divisible partitions poset and the $F$-triangle (a certain refined face count) of the generalised cluster complex of Fomin and Reading, the only gap remaining in type $D_n$. Moreover, we prove a reciprocity result for this $M$-triangle, again with the possible exception of type $D_n$. Our results are based on the calculation of certain decomposition numbers for the reflection groups of types $E_7$ and $E_8$, which carry in fact finer information than does the $M$-triangle. The decomposition numbers for the other exceptional reflection groups had been computed in the earlier paper. We present a conjectured formula for the type $A_n$ decomposition numbers.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The \(F\)-triangle of the generalised cluster complex
• Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions
• The rank enumeration of certain parabolic non-crossing partitions
• Faces of Generalized Cluster Complexes and Noncrossing Partitions
• On some enumerative aspects of generalized associahedra

zbMATH Keywords

root systemsface numbersF -trianglegeneralised cluster complexgeneralised non-crossing partitionsM -triangleMöbius function

Mathematics Subject Classification ID

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

Cited In (6)

• On the \(H\)-triangle of generalised nonnesting partitions
• On noncrossing and nonnesting partitions of type \(D\)
• The \(F\)-triangle of the generalised cluster complex
• The rank enumeration of certain parabolic non-crossing partitions
• Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions
• Refined lattice path enumeration and combinatorial reciprocity

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\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2654571)