The insertion encoding of permutations (Q2571290)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The insertion encoding of permutations |
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
