On the excedance sets of colored permutations

arXiv0806.2114MaRDI QIDQ6209908FDOQ6209908

Authors: Eli Bagno, David Garber, Robert Shwartz 

Publication date: 12 June 2008

Abstract: We define the excedence set and the excedance word on $G_{r,n}$, generalizing a work of Ehrenborg and Steingrimsson and use the inclusion-exclusion principle to calculate the number of colored permutations having a prescribed excedance word. We show some symmetric properties as Log concavity and unimodality of a specific sequence of excedance words.

Mathematics Subject Classification ID

This page was built for publication: On the excedance sets of colored permutations

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