Grid classes and the Fibonacci dichotomy for restricted permutations

Simple item page
dc.creatorHuczynska, Sophie
dc.creatorVatter, Vincent
dc.date2006-02-07
dc.date.accessioned2026-07-07T07:03:12Z
dc.date.available2026-07-07T07:03:12Z
dc.descriptionWe introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of length n in a permutation class is either at least as large as the nth Fibonacci number or is eventually polynomial.
dc.identifierhttps://arxiv.org/abs/math/0602143
dc.identifierhttp://arxiv.org/abs/math/0602143
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/108885
dc.subjectCombinatorics
dc.subject05A05
dc.titleGrid classes and the Fibonacci dichotomy for restricted permutations
dc.typetext

Files

Collections

arXiv