Simple permutations and algebraic generating functions

dc.creatorBrignall, Robert
dc.creatorHuczynska, Sophie
dc.creatorVatter, Vincent
dc.date2006-08-15
dc.date.accessioned2026-07-07T07:21:49Z
dc.date.available2026-07-07T07:21:49Z
dc.descriptionA simple permutation is one that does not map a nontrivial interval onto an interval. It was recently proved by Albert and Atkinson that a permutation class with only finitely simple permutations has an algebraic generating function. We extend this result to enumerate permutations in such a class satisfying additional properties, e.g., the even permutations, the involutions, the permutations avoiding generalised permutations, and so on.
dc.identifierhttps://arxiv.org/abs/math/0608391
dc.identifierhttp://arxiv.org/abs/math/0608391
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115435
dc.subjectCombinatorics
dc.titleSimple permutations and algebraic generating functions
dc.typetext

Files

Collections