Permutations, cycles and the pattern 2--13 (Q870037)
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: Permutations, cycles and the pattern 2--13 |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Permutations, cycles and the pattern 2--13 |
scientific article |
Statements
Permutations, cycles and the pattern 2--13 (English)
0 references
12 March 2007
0 references
Summary: We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length \textit{and} the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.
0 references
0.840792715549469
0 references
0.8116691708564758
0 references
0.8105970621109009
0 references
0.8010836243629456
0 references
0.7963926792144775
0 references
