The insertion encoding of permutations (Q2571290): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Q222125 / rank | |||
| Property / author | |||
| Property / author: Steve Linton / rank | |||
| Property / author | |||
| Property / author: Michael Henry Albert / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Steve Linton / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 07:38, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The insertion encoding of permutations |
scientific article |
Statements
The insertion encoding of permutations (English)
0 references
1 November 2005
0 references
The problem addressed in the paper is to describe or enumerate certain collections of permutations. More precisely, the insertion encoding for finite permutations is introduced and compared to the other tools used for enumerating permutation pattern classes and finding Wilfian equivalence classes.
0 references
enumeration
0 references
pattern classes
0 references
Wilf equivalence
0 references
