Enumeration schemes for permutations avoiding barred patterns (Q2380461): Difference between revisions
From MaRDI portal
Changed an Item |
Import IPFS CIDs |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreihaqaxdubt7vk54y4gzgh5pkx7khupqgwcdepwbm5f2fshtq77nh4 / rank | |||
Normal rank | |||
Latest revision as of 10:16, 22 February 2025
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
