On the construction of permutations of a given type kept fixed by conjugation (Q1803875)
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: On the construction of permutations of a given type kept fixed by conjugation |
scientific article; zbMATH DE number 221990
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the construction of permutations of a given type kept fixed by conjugation |
scientific article; zbMATH DE number 221990 |
Statements
On the construction of permutations of a given type kept fixed by conjugation (English)
0 references
29 June 1993
0 references
Let \(\overline\alpha,\overline\beta\) be two partitions of \(n\), and \(\beta\in S_ n\) be a permutations of type \(\overline\beta\). The authors construct and enumerate the set \(\{\alpha\in S_ n\mid\alpha\) of type \(\overline\alpha\), \(\beta\alpha\beta^{-1}=\alpha\}\) by obtaining some recurrence formulas. The number of references is impressive.
0 references
partitions
0 references
permutation
0 references
0 references