Refined Enumeration of Noncrossing Chains and Hook Formulas

Matthieu Josuat-Vergès (1, 2, 3)

1 UPEM - Université Paris-Est Marne-la-Vallée
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
3 CNRS - Centre National de la Recherche Scientifique

In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpre-tation of a result by Deligne which is due to Chapoton, and the goal of this article is to refine the formula. First, we prove a one-parameter generalization, by the considering enumeration of noncrossing chains where we put a weight on some relations. Second, we consider an equivalence relation on noncrossing chains coming from the natural action of the group on set partitions, and we show that each equivalence class has a simple generating function. Using this we recover Postnikov's hook length formula in type A and obtain a variant in type B.

Mots clés: Euler numbers; finite Coxeter groups; set partitions

Domaines: Combinatoire [math.CO]

Matthieu Josuat-Vergès. Refined Enumeration of Noncrossing Chains and Hook Formulas. Annals of Combinatorics, 2015, 19 (3), pp.443-460. ⟨10.1007/s00026-015-0278-5⟩. ⟨hal-01189485⟩