Enumeration schemes for permutations avoiding barred patterns (Q2380461)
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: Enumeration schemes for permutations avoiding barred patterns |
scientific article; zbMATH DE number 5687011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration schemes for permutations avoiding barred patterns |
scientific article; zbMATH DE number 5687011 |
Statements
Enumeration schemes for permutations avoiding barred patterns (English)
0 references
26 March 2010
0 references
Summary: We give the first comprehensive collection of enumeration results for permutations that avoid barred patterns of length \(\leq 4\). We then use the method of prefix enumeration schemes to find recurrences counting permutations that avoid a barred pattern of length \(> 4\) or a set of barred patterns.
0 references
0.8083193898200989
0 references
0.8043303489685059
0 references
0.8042912483215332
0 references
0.8015145659446716
0 references
0.7920958399772644
0 references
