Finite transition matrices for permutations avoiding pairs of length four patterns (Q1398262): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(03)00042-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024633196 / rank | |||
Normal rank | |||
Latest revision as of 09:58, 30 July 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
0 references
