On the excedance sets of colored permutations
Combinatorics
2008-06-13 v1 Group Theory
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.
Keywords
Cite
@article{arxiv.0806.2114,
title = {On the excedance sets of colored permutations},
author = {Eli Bagno and David Garber and Robert Shwartz},
journal= {arXiv preprint arXiv:0806.2114},
year = {2008}
}
Comments
9 pages, no figures; submitted