On the excedance number of colored permutation groups
Eli Bagno, David Garber
Abstract
We generalize the results of Ksavrelof and Zeng about the multidistribution of the excedance number of Sn with some natural parameters to the colored permutation group and to the Coxeter group of type D. We define two different orders on these groups which induce two different excedance numbers. Surprisingly, in the case of the colored permutation group, we get the same generalized formulas for both orders.
Create a lesson
Related papers
Off-Diagonal Induced Ramsey Numbers
Bruno Andrades, Marcelo Campos, Rafael Filipe et al.
Largest Sperner families with bounded VC-dimension
Gennian Ge, Hanyu Wang, Zixiang Xu et al.
Proof of two conjectures on the log-concavity of partition ranks and cranks
Jianxi Mao, Wenle Shi, Bao-Xuan Zhu
The Exact Number of Pentagons in Book-Free Graphs
Wentao Hu
A family of symmetric counterexamples to the bent sum decomposition conjecture
Máté Róbert Kepes, Anita Kercsó-Molnár, Viczián András
Counting graphs admitting a strictly matched involution
Stephan Dominique Andres, Igor Režan