Search arXivSearch

arXiv · math/0601676

The $M$-triangle of generalised non-crossing partitions for the types $E_7$ and $E_8$

Abstract

The $M$-triangle of a ranked locally finite poset $P$ is the generating function $\sum_{u,w\in P} ^{}μ(u,w) x^{\rk u}y^{\rk w}$, where $μ(.,.)$ is the Möbius 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christian Krattenthaler. 2006-10-25. The $M$-triangle of generalised non-crossing partitions for the types $E_7$ and $E_8$. https://arxiv.org/abs/math/0601676

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO