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 no mod i, i = n..2. [ABSTRACT FROM AUTHOR]
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 no mod i, i = n.2. [ABSTRACT FROM AUTHOR]
Published
2015
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.