On the excedance sets of colored permutations

Simple item page
dc.creatorBagno, Eli
dc.creatorGarber, David
dc.creatorShwartz, Robert
dc.date2008-06-12
dc.date.accessioned2026-07-07T09:44:14Z
dc.date.available2026-07-07T09:44:14Z
dc.descriptionWe 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.
dc.description9 pages, no figures; submitted
dc.identifierhttps://arxiv.org/abs/0806.2114
dc.identifierhttp://arxiv.org/abs/0806.2114
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162800
dc.subjectCombinatorics
dc.subjectGroup Theory
dc.subject05E15
dc.titleOn the excedance sets of colored permutations
dc.typetext

Files

Collections

arXiv