New in Wolfram
Mathematica
8: Group Theory Algorithms
◄
previous

next
►
Core Algorithms
Orders of Groups with Random Generators
Compute the orders of groups generated by two random permutations, with increasing support of one of them. Frequently, the group generated is the symmetric or alternating group of the points moved by the permutations.
In[1]:=
X
DiscretePlot[ Log[10, GroupOrder[ PermutationGroup[{RandomPermutation[n], RandomPermutation[5]}]]], {n, 5, 100}]
Out[1]=
In[2]:=
X
GroupOrder[ PermutationGroup[{RandomPermutation[300], RandomPermutation[100]}]]
Out[2]=