Counting stabilized-interval-free permutations

Simple item page
dc.creatorCallan, David
dc.date2003-10-10
dc.date.accessioned2026-07-07T05:01:48Z
dc.date.available2026-07-07T05:01:48Z
dc.descriptionA 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.
dc.descriptionlatex, 6 pages
dc.identifierhttps://arxiv.org/abs/math/0310157
dc.identifierhttp://arxiv.org/abs/math/0310157
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68812
dc.subjectCombinatorics
dc.subject05A05; 05A15
dc.titleCounting stabilized-interval-free permutations
dc.typetext

Files

Collections

arXiv