A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern (Q394208)
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: A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern |
scientific article; zbMATH DE number 6250379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern |
scientific article; zbMATH DE number 6250379 |
Statements
A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern (English)
0 references
24 January 2014
0 references
permutation
0 references
pattern match
0 references
descent
0 references
left-to-right minimum
0 references
symmetric polynomial
0 references
exponential generating function
0 references
0 references
0 references
0.9325556755065918
0 references
0.9130048751831056
0 references
0.8110897541046143
0 references
0.7960229516029358
0 references
