% $Date: 2003/09/15 16:37:46 $ $Author: nthiery $ $Revision: 1.1.1.1 $

\begin{Mhelppage}{Permutation}%
  {V. Prosper}%
  \begin{MInfo}
    \eng{how permutations are encoded in \Mmath{mu}{\mu}-EC}
  \end{MInfo}
  

\begin{MIntro}
  \eng{
This part describes how the elements of the symmetric group of degree
\Mmath{n, n>=1}{n, n\ge1}, are represented in \Mmath{mu}{\mu}-EC.
 
A permutation is denoted by the list of the images of
\Mmath{i, for i in [1,n]}{i, i\in\{1,n\}}, under the permutation.
In other words, a permutation \Mmath{perm}{perm} is represented
by the list \Mmath{[perm(1), ...,perm(n)]}{[perm_1, ...,perm_n]} where
\Mmath{perm(i)}{perm_i} is the image of \Mmath{i}{i} under the permutation
\Mmath{perm}{perm}.
}
\end{MIntro}

\begin{MExample}{ex1}
\begin{Mexin}
muEC::TYP::IsPerm( [2,3,1] );
\end{Mexin}
\begin{Mexout}
                             TRUE
\end{Mexout}
\end{MExample}

\MRelatedFunctions{IsPerm}
\end{Mhelppage}
