Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions (Q5404260): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by the same user not shown) | |||
| label / en | label / en | ||
Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions | |||
| Property / arXiv classification | |||
math.CO | |||
| Property / arXiv classification: math.CO / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1111.3920 / rank | |||
Normal rank | |||
Latest revision as of 02:55, 20 April 2024
scientific article; zbMATH DE number 6272357
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions |
scientific article; zbMATH DE number 6272357 |
Statements
24 March 2014
0 references
permutation pattern
0 references
equivalence class
0 references
Knuth relation
0 references
plactic monoid
0 references
Chinese monoid
0 references
integer sequence
0 references
Fibonacci number
0 references
Tribonacci number
0 references
Catalan number
0 references
layered permutation
0 references
connected permutation
0 references
involution
0 references
pattern-avoiding permutation
0 references
transposition
0 references
math.CO
0 references
