rperm

Integer specifying how many elements can move (that is,
 how many elements do not map to themselves), with default <code>NA</code>
 meaning to choose a permutation at random. This is useful if you
 want a permutation that has a compact cycle representation

moved

Create a word object of random permutations

sybolmath

Manipulates invertible functions from a finite set to itself.  Can transform from word form to cycle form and back.

Robin K S Hankin

permutations

The Symmetric Group: Permutations of a Finite Set

Paul Egeler

rperm function

<dl> <dt>n</dt>
<dd>Number of permutations to create</dd> <dt>r</dt>
<dd>Size of permutations</dd> <dt>moved</dt>
<dd>Integer specifying how many elements can move (that is,
 how many elements do not map to themselves), with default <code>NA</code>
 meaning to choose a permutation at random. This is useful if you
 want a permutation that has a compact cycle representation</dd></dl>

Arguments

Author

Random permutations — rperm

<dl>

 <dt>n</dt>
<dd>Number of permutations to create</dd>

 <dt>r</dt>
<dd>Size of permutations</dd>

 <dt>moved</dt>
<dd>Integer specifying how many elements can move (that is,
 how many elements do not map to themselves), with default <code>NA</code>
 meaning to choose a permutation at random. This is useful if you
 want a permutation that has a compact cycle representation</dd>

</dl>

rperm: Random permutations

Description

Usage

Value

Arguments

Author

See Also

Examples