Finite transition matrices for permutations avoiding pairs of length four patterns (Q1398262): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: HERB / rank | |||
Normal rank | |||
Revision as of 01:03, 1 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite transition matrices for permutations avoiding pairs of length four patterns |
scientific article |
Statements
Finite transition matrices for permutations avoiding pairs of length four patterns (English)
0 references
29 July 2003
0 references
This article shows that four classes of pattern-avoiding permutations are enumerated by a closed formula. The technique of proofs uses finite transition matrices associated with permutations avoiding pairs of length four patterns.
0 references
pattern-avoiding permutations
0 references
