On the excedance sets of colored permutations

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 pages, no figures; submitted

Keywords

Combinatorics, Group Theory, 05E15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/162800

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0806.2114
 http://arxiv.org/abs/0806.2114

Collections

arXiv