On the excedance sets of colored permutations

Details On the excedance sets of colored permutations On the excedance sets of colored permutations

2008-06-12

arxiv.org/abs/0806.2114v1

Mathematics

Combinatorics

9 pages, no figures; submitted

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the excedance sets of colored permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the excedance sets of colored permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the excedance sets of colored permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-691107