The element centralizers of symmetric group (Q2703319)
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 element centralizers of symmetric group |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The element centralizers of symmetric group |
scientific article |
Statements
1 March 2001
0 references
symmetric groups
0 references
alphabets
0 references
cycles on words
0 references
centralizers of elements
0 references
algorithms
0 references
The element centralizers of symmetric group (English)
0 references
The author proposes an algorithm for finding element centralizers in symmetric groups. The \(Z\)-representation of the symmetric group \(S_n\), generated by cycles on words in the alphabet \(A=\{a_0,a_1,\dots,a_{n-1}\}\) is used. Every element in this representation of the group \(S_n\) is a product of independent cycles. Formalization of the computational procedure is realized on the basis of the introduced notion of the transform operation.
0 references
0.7922437191009521
0 references
0.7662003040313721
0 references
0.7583479881286621
0 references
0.729837954044342
0 references
