Starting from a Theorem by Hall, we define the identity transform of a permutation Ï as C(Ï) = (0+Ï(0), 1+Ï(1), â¯, (n-1)+Ï(n.1)), and we define the set Cn = (C(Ï) : Ï â Sn, where Sn is the set of permutations of the elements of the cyclic group â¤n. In the first part of this paper we study the set Cn: we show some closure properties of this set, and then provide some of its combinatorial and algebraic characterizations and connections with other combinatorial structures. In the second part of the paper, we use some of the combinatorial properties we have determined to provide a different algorithm for the proof of Hall's Theorem.
|Titolo:||The Identity Transform of a Permutation and its Applications|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto: