GENERACIÓN ALEATORIA DE PERMUTACIONES DEL GRUPO SIMÉTRICO O DEL GRUPO ALTERNADO
Resumen
In this paper three new algorithms for the random generation of permutations of degree n are shown, two of them for the
Symmetric group Sn and one for the Alternating group An , in such a way, that they are mainly carried out by means of the
operation of additions mod n o mod i, i = n..2.
Symmetric group Sn and one for the Alternating group An , in such a way, that they are mainly carried out by means of the
operation of additions mod n o mod i, i = n..2.
Texto completo:
PDFEnlaces refback
- No hay ningún enlace refback.











