PermutationCyclesQ

PermutationCyclesQ[expr]
returns True if expr is a permutation in disjoint cyclic form, and False otherwise.

DetailsDetails

  • The disjoint cyclic form of a permutation is an expression with head Cycles containing a list of cycles, each one being a list of positive integers. The integer points in a permutation must all be different.

ExamplesExamplesopen allclose all

Basic Examples (3)Basic Examples (3)

A valid permutation in cyclic form:

In[1]:=
Click for copyable input
Out[1]=

A symbolic permutation object:

In[1]:=
Click for copyable input
Out[1]=

An invalid permutation:

In[1]:=
Click for copyable input
Out[1]=
New in 8
New to Mathematica? Find your learning path »
Have a question? Ask support »