Grid classes and the Fibonacci dichotomy for restricted permutations (Q2500973)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Grid classes and the Fibonacci dichotomy for restricted permutations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Grid classes and the Fibonacci dichotomy for restricted permutations |
scientific article |
Statements
Grid classes and the Fibonacci dichotomy for restricted permutations (English)
0 references
30 August 2006
0 references
Summary: We 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 \(n\)th Fibonacci number or is eventually polynomial.
0 references
permutation classes
0 references
Fibonacci number
0 references
0.8044708967208862
0 references
0.7718407511711121
0 references
0.7681463360786438
0 references
0.7680009603500366
0 references
0.7540457844734192
0 references
