A conjecture on descents, inversions and the weak order
Abstract
In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system : a partition of an element is a subset such that the left inversion set of is the disjoint union of the left inversion set of the elements in . Partitions of elements of arises in the study of the Belkale-Kumar product on the cohomology , where is the complete flag variety of any complex semi-simple algebraic group. Partitions of elements in the symmetric group are also related to the {\em Babington-Smith model} in algebraic statistics or to the simplicial faces of the Littlewood-Richardson cone. We state the conjecture that the number of right descents of is the sum of the number of right descents of the elements of and prove that this conjecture holds in the cases of symmetric groups (type ) and hyperoctahedral groups (type ).
Cite
@article{arxiv.2412.09227,
title = {A conjecture on descents, inversions and the weak order},
author = {Christophe Hohlweg and Viviane Pons},
journal= {arXiv preprint arXiv:2412.09227},
year = {2026}
}
Comments
31 pages, 1 figure v2: The statement of Conjecture 3 had a typo that is corrected in this version. v3: 33p to appear in Algebraic Combinatorics