Cycles and patterns in permutations

dc.creatorParviainen, Robert
dc.date2006-10-20
dc.date2007-11-05
dc.date.accessioned2026-07-07T08:40:19Z
dc.date.available2026-07-07T08:40:19Z
dc.descriptionWe study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating functions for inversions, ascents, descents, 123s, valleys, 1'-2-1s; closed forms forms for avoidance of peaks, 2-3-1s, 1-2-3s, 2'-1-2s and 1'-2-1s; bijective proofs of Wilf-equivalences. We also derive some results about standard pattern occurrence, such as continued fractions for the generating functions for occurrences of valleys and the pattern 123. The methods are simple and combinatorial in nature: direct enumerative analysis and bijections to lattice paths.
dc.description13 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/0610616
dc.identifierhttp://arxiv.org/abs/math/0610616
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141340
dc.subjectCombinatorics
dc.subject05C05; 05C15
dc.titleCycles and patterns in permutations
dc.typetext

Files

Collections