Prefixes of minimal factorisations of a cycle

Details Prefixes of minimal factorisations of a cycle Prefixes of minimal factorisations of a cycle

2011-05-29

arxiv.org/abs/1105.5763v1

Mathematics

Combinatorics

Scientific paper

We give a bijective proof of the fact that the number of k-prefixes of minimal factorisations of the n-cycle (1...n) as a product of n-1 transpositions is n^{k-1}\binom{n}{k+1}. Rather than a bijection, we construct a surjection with fibres of constant size. This surjection is inspired by a bijection exhibited by Stanley between minimal factorisations of an n-cycle and parking functions, and by a counting argument for parking functions due to Pollak.

Affiliated with

Also associated with

No associations

Rating

Prefixes of minimal factorisations of a cycle 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 Prefixes of minimal factorisations of a cycle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prefixes of minimal factorisations of a cycle will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-289665