permorder

Permutation, coerced to <code>cycle</code> form

Boolean, with default <code>TRUE</code> meaning to return the
 order of each element of the vector, and <code>FALSE</code> meaning to
 return the order of the vector itself (that is, the smallest
 strictly positive integer for which <code>all(x^n==id)</code>).

singly

Returns the order of a permutation \(P\): the smallest strictly
positive integer \(n\) for which \(P^n\) is the identity.

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

permorder function

<dl> <dt>x</dt>
<dd>Permutation, coerced to <code>cycle</code> form</dd> <dt>singly</dt>
<dd>Boolean, with default <code>TRUE</code> meaning to return the
 order of each element of the vector, and <code>FALSE</code> meaning to
 return the order of the vector itself (that is, the smallest
 strictly positive integer for which <code>all(x^n==id)</code>).</dd></dl>

Arguments

Author

The order of a permutation — permorder

<dl>

 <dt>x</dt>
<dd>Permutation, coerced to <code>cycle</code> form</dd>

 <dt>singly</dt>
<dd>Boolean, with default <code>TRUE</code> meaning to return the
 order of each element of the vector, and <code>FALSE</code> meaning to
 return the order of the vector itself (that is, the smallest
 strictly positive integer for which <code>all(x^n==id)</code>).</dd>

</dl>

permorder: The order of a permutation

Description

Usage

Arguments

Author

Details

See Also

Examples