Combinatorial Gray codes for classes of pattern avoiding permutations

Simple item page
dc.creatorDukes, W. M. B.
dc.creatorFlanagan, Mark F.
dc.creatorMansour, Toufik
dc.creatorVajnovszki, V.
dc.date2007-04-16
dc.date2008-01-09
dc.date.accessioned2026-07-07T08:53:07Z
dc.date.available2026-07-07T08:53:07Z
dc.descriptionThe past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoiding permutations. Among the families under consideration are those counted by Catalan, Schröder, Pell, even index Fibonacci numbers and the central binomial coefficients. Consequently, this provides Gray codes for $\s_n(τ)$ for all $τ\in \s_3$ and the obtained Gray codes have distances 4 and 5.
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/0704.2048
dc.identifierhttp://arxiv.org/abs/0704.2048
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145509
dc.subjectCombinatorics
dc.subject05A05; 94B25; 05A15
dc.titleCombinatorial Gray codes for classes of pattern avoiding permutations
dc.typetext

Files

Collections

arXiv