Counting stabilized-interval-free permutations
Combinatorics
2007-05-23 v1
Abstract
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.
Keywords
Cite
@article{arxiv.math/0310157,
title = {Counting stabilized-interval-free permutations},
author = {David Callan},
journal= {arXiv preprint arXiv:math/0310157},
year = {2007}
}
Comments
latex, 6 pages