rperm

rword

rcycle

rcyc

r1cyc

Function <code>rperm()</code> creates a word object of random permutations.
 Function <code>rcyc()</code> creates random permutations comprising a single
 (group-theoretic) cycle of a specified length (<code>r1cyc()</code> is a
 low-level helper function).

symbolmath

Manipulates invertible functions from a finite set to
itself. Can transform from word form to cycle form and
back. To cite the package in publications please use
Hankin (2020) "Introducing the permutations R package",
SoftwareX, volume 11 <doi:10.1016/j.softx.2020.100453>.

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>len</dt>
<dd>Length of cycles in <code>rcyc()</code> and <code>r1cyc()</code></dd> <dt>moved</dt>
<dd>In function <code>rperm()</code>, 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>len</dt>
<dd>Length of cycles in <code>rcyc()</code> and <code>r1cyc()</code></dd>

 <dt>moved</dt>
<dd>In function <code>rperm()</code>, 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