The structure of the centralizer of a permutation (Q1100564): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3848243 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4132170 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3853827 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cyclic subsemigroups of symmetric inverse semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3926778 / rank | |||
Normal rank |
Latest revision as of 16:36, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The structure of the centralizer of a permutation |
scientific article |
Statements
The structure of the centralizer of a permutation (English)
0 references
1988
0 references
Relative to the symmetric groups \(S_ n\) the structure of centralizers of permutations are known as direct products of certain general wreath products. A recent generalization of the cycle notation for partial one- one transformations (charts) is applied to show that relative to the symmetric inverse semigroups \(C_ n\) the structure of centralizers of permutations are also direct products of certain subsemigroups of a new wreath product, and this new wreath includes the former as a subgroup. A necessary and sufficient condition is given for two charts to commute and the approach for the \(C_ n\)-case parallels and generalizes the one for the \(S_ n\)-case. As a result, the \(C_ n\)-case yields the standard known characterizations of commuting permutations, as well as formulas for the orders of centralizers as corollaries. It is an open problem to extend these results to the centralizers of arbitrary charts in \(C_ n\).
0 references
symmetric groups
0 references
centralizers of permutations
0 references
wreath products
0 references
partial one-one transformations
0 references
symmetric inverse semigroups
0 references
charts
0 references
commuting permutations
0 references
orders of centralizers
0 references