Permutations avoiding a nonconsecutive instance of a 2- or 3-letter pattern

Simple item page
dc.creatorCallan, David
dc.date2006-10-13
dc.date2006-11-02
dc.date.accessioned2026-07-07T07:29:03Z
dc.date.available2026-07-07T07:29:03Z
dc.descriptionWe count permutations avoiding a nonconsecutive instance of a two- or three-letter pattern, that is, the pattern may occur but only as consecutive entries in the permutation. Two-letter patterns give rise to the Fibonacci numbers. The counting sequences for the two representative three-letter patterns, 321 and 132, have respective generating functions (1+x^2)(C(x)-1)/(1+x+x^2-x C(x)) and C(x+x^3) where C(x) is the generating function for the Catalan numbers.
dc.descriptionAcknowledgment of priority
dc.identifierhttps://arxiv.org/abs/math/0610428
dc.identifierhttp://arxiv.org/abs/math/0610428
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/117957
dc.subjectCombinatorics
dc.subject05A15
dc.titlePermutations avoiding a nonconsecutive instance of a 2- or 3-letter pattern
dc.typetext

Files

Collections

arXiv