Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Function Repository Resource:
List permutations comprised only of cycles of size two or less
ResourceFunction["Involutions"][l] gives the list of involutions of the elements in the list l. | |
ResourceFunction["Involutions"][n] gives involutions for Range[n]. | |
ResourceFunction["Involutions"][…,"Cycles"] gives involutions in their cycle representation. |
All involutive permutations of a list:
In[1]:= | ![]() |
Out[1]= | ![]() |
Get the same result by specifying the size:
In[2]:= | ![]() |
Out[2]= | ![]() |
Cycle representations of the involutions:
In[3]:= | ![]() |
Out[3]= | ![]() |
In[4]:= | ![]() |
Out[4]= | ![]() |
Permuting involutions with themselves gives the identity permutation:
In[5]:= | ![]() |
Out[5]= | ![]() |
In[6]:= | ![]() |
Out[6]= | ![]() |
The result given by Involutions can be verified using the resource function PermutationInvolutionQ:
In[7]:= | ![]() |
Out[7]= | ![]() |
In[8]:= | ![]() |
Out[8]= | ![]() |
Involutions can be obtained from a list of permutations:
In[9]:= | ![]() |
Out[9]= | ![]() |
In[10]:= | ![]() |
Out[10]= | ![]() |
In[11]:= | ![]() |
Out[11]= | ![]() |
The number of involutions is given by the resource function InvolutionCount:
In[12]:= | ![]() |
Out[12]= | ![]() |
In[13]:= | ![]() |
Out[13]= | ![]() |
In[14]:= | ![]() |
Out[14]= | ![]() |
This work is licensed under a Creative Commons Attribution 4.0 International License