Enumeration schemes for permutations avoiding barred patterns (Q2380461): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:44, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumeration schemes for permutations avoiding barred patterns |
scientific article |
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
