Permutations, cycles, and the pattern 2-13
| dc.creator | Parviainen, Robert | |
| dc.date | 2006-07-31 | |
| dc.date.accessioned | 2026-07-07T07:21:11Z | |
| dc.date.available | 2026-07-07T07:21:11Z | |
| dc.description | We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths. | |
| dc.description | 13 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0607793 | |
| dc.identifier | http://arxiv.org/abs/math/0607793 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115212 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C05; 05C15 | |
| dc.title | Permutations, cycles, and the pattern 2-13 | |
| dc.type | text |