On the excedance sets of colored permutations
From MaRDI portal
Publication:6209908
Abstract: We define the excedence set and the excedance word on , 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.
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)
