Counting stabilized-interval-free permutations

Details Counting stabilized-interval-free permutations Counting stabilized-interval-free permutations

2003-10-10

arxiv.org/abs/math/0310157v1

Mathematics

Combinatorics

latex, 6 pages

Scientific paper

A stabilized-interval-free (SIF) permutation on [n]={1,2,...,n} is one that does not stabilize any proper subinterval of [n]. By presenting a decomposition of an arbitrary permutation into a list of SIF permutations, we show that the generating function A(x) for SIF permutations satisfies the defining property: [x^(n-1)] A(x)^n = n! . We also give an efficient recurrence for counting SIF permutations.

Affiliated with

Also associated with

No associations

Rating

Counting stabilized-interval-free 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 Counting stabilized-interval-free permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting stabilized-interval-free permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-543315