Pattern avoidance in circular permutations

Simple item page
dc.creatorCallan, David
dc.date2002-10-01
dc.date.accessioned2026-07-07T04:51:25Z
dc.date.available2026-07-07T04:51:25Z
dc.descriptionCircular permutations on {1,2,...,n} that avoid a given pattern correspond to ordinary (linear) permutations that end with n and avoid all cyclic rotations of the pattern. Three letter patterns are all but unavoidable in circular permutations and here we give explicit formulas for the number of circular permutations that avoid one four letter pattern. In the three essentially distinct cases, the counts are as follows: the Fibonacci number F_{2n-3} for the pattern 1324, 2^{n-1}-(n-1) for 1342, and 2^{n}+1-2n-{n}choose{3} for 1234.
dc.descriptionLaTeX
dc.identifierhttps://arxiv.org/abs/math/0210014
dc.identifierhttp://arxiv.org/abs/math/0210014
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65137
dc.subjectCombinatorics
dc.subject05A15
dc.titlePattern avoidance in circular permutations
dc.typetext

Files

Collections

arXiv