Counting occurrences of 132 in an even permutation (Q1774751)
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: Counting occurrences of 132 in an even permutation |
scientific article; zbMATH DE number 2168685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting occurrences of 132 in an even permutation |
scientific article; zbMATH DE number 2168685 |
Statements
Counting occurrences of 132 in an even permutation (English)
0 references
18 May 2005
0 references
Summary: We study the generating function for the number of even (or odd) permutations on \(n\) letters containing exactly \(r\geq0\) occurrences of a \(132\) pattern. It is shown that finding this function for a given \(r\) amounts to a routine check of all permutations in \(\mathfrak S_{2r}\).
0 references
generating function
0 references
0.97587556
0 references
0 references
0.86758566
0 references
0.8592205
0 references
0.85833573
0 references
0.84067607
0 references
0.8387964
0 references
0.8330306
0 references
