Simple permutations and algebraic generating functions
| dc.creator | Brignall, Robert | |
| dc.creator | Huczynska, Sophie | |
| dc.creator | Vatter, Vincent | |
| dc.date | 2006-08-15 | |
| dc.date.accessioned | 2026-07-07T07:21:49Z | |
| dc.date.available | 2026-07-07T07:21:49Z | |
| dc.description | A 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.identifier | https://arxiv.org/abs/math/0608391 | |
| dc.identifier | http://arxiv.org/abs/math/0608391 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115435 | |
| dc.subject | Combinatorics | |
| dc.title | Simple permutations and algebraic generating functions | |
| dc.type | text |