In the attempt of giving a constructive proof of Hall’s Theorem, different from the original one due to Hall himself, we define a transformation on permutations of the cyclic group $Z_n$. In the first part of the paper, they study some basic properties of this transformation. Then, in the second part, we describe a new algorithm for the proof of Hall’s Theorem. Finally, we conclude with some general remarks on the defined transformation and with some open problems.
The identity transform of a permutation and its applications / Frosini, Andrea; Battaglini, Daniela; Rinaldi, SImone; Socci, Samanta. - In: FUNDAMENTA INFORMATICAE. - ISSN 0169-2968. - STAMPA. - 141:(2015), pp. 1-15. [10.3233/FI-2015-1271]
The identity transform of a permutation and its applications
FROSINI, ANDREA;
2015
Abstract
In the attempt of giving a constructive proof of Hall’s Theorem, different from the original one due to Hall himself, we define a transformation on permutations of the cyclic group $Z_n$. In the first part of the paper, they study some basic properties of this transformation. Then, in the second part, we describe a new algorithm for the proof of Hall’s Theorem. Finally, we conclude with some general remarks on the defined transformation and with some open problems.I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.