Classifying Descents According to equivalence mod k

Details Classifying Descents According to equivalence mod k Classifying Descents According to equivalence mod k

2006-04-20

arxiv.org/abs/math/0604455v1

Mathematics

Combinatorics

42 pages

Scientific paper

In [S. Kitaev and J. Remmel: Classifying descents according to parity] the authors refine the well-known permutation statistic "descent" by fixing parity of (exactly) one of the descent's numbers. In this paper, we generalize the results of [S. Kitaev and J. Remmel: Classifying descents according to parity] by studying descents according to whether the first or the second element in a descent pair is equivalent to $k$ mod $k\geq 2$. We provide either an explicit or an inclusion-exclusion type formula for the distribution of the new statistics. Based on our results we obtain combinatorial proofs of a number of remarkable identities. We also provide bijective proofs of some of our results and state a number of open problems.

Affiliated with

Also associated with

No associations

Rating

Classifying Descents According to equivalence mod k 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 Classifying Descents According to equivalence mod k, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classifying Descents According to equivalence mod k will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-67130