Python | SymPy Permutation.index() method

Python | SymPy Permutation.cycles() method

Last Updated : 26 Aug, 2019

Permutation.cycles() : cycles() is a sympy Python library function that returns the number of cycles present in the permutation. This also includes the singleton.

Syntax :
sympy.combinatorics.permutations.Permutation.cycles()

Return :
number of cycles present in the permutation

Code #1 : cycles() Example

# Python code explaining 
# SymPy.Permutation.cycles() 
  
# importing SymPy libraries 
from sympy.combinatorics.partitions import Partition 
from sympy.combinatorics.permutations import Permutation 
  
# Using from sympy.combinatorics.permutations.Permutation.cycles() method  
  
# creating Permutation 
a = Permutation([2, 0, 3, 1, 5, 4]) 
  
b = Permutation([3, 1, 2, 5, 4, 0]) 
  
  
print ("Permutation a - cycles form : ", a.cycles) 
print ("Permutation b - cycles form : ", b.cycles) 

Output :

Permutation a – cycles form : 2
Permutation b – cycles form : 4

Code #2 : cycles() Example – 2D Permutation

# Python code explaining 
# SymPy.Permutation.cycles() 
  
# importing SymPy libraries 
from sympy.combinatorics.partitions import Partition 
from sympy.combinatorics.permutations import Permutation 
  
# Using from  
# sympy.combinatorics.permutations.Permutation.cycles() method  
  
# creating Permutation 
a = Permutation([[2, 4, 0],  
                 [3, 1, 2], 
                 [1, 5, 6]]) 
  
# SELF COMMUTATING     
print ("Permutation a - cycles form : ", a.cycles) 

Output :

Permutation a – cycles form : 1

Python | SymPy Permutation.index() method

N

noobestars101

Improve

Article Tags :

Python
SymPy

Practice Tags :

python

Similar Reads

Python | SymPy Permutation.ascents() method

Permutation.ascents() : ascents() is a sympy Python library function that returns the position of ascents in the permutation. Ascents are the elements where a[i] < a[i+1] Syntax : sympy.combinatorics.permutations.Permutation.ascents() Return : position of ascents in the permutation Code #1 : asce

Python | SymPy Permutation.descents() method

Permutation.descents() : descents() is a sympy Python library function that returns the position of descents in the permutation. Descents are the elements where a[i] > a[i+1] Syntax : sympy.combinatorics.permutations.Permutation.descents() Return : position of descents in the permutation Code #1

Python | SymPy Permutation.cyclic_form() method

Permutation.cyclic_form() : cyclic_form() is a sympy Python library function that returns the cyclic notation from the canonical notation, by omitting the singletons. Syntax : sympy.combinatorics.permutations.Permutation.cyclic_form() Return : cyclic notation from the canonical notation Code #1 : cy

Python | SymPy Permutation.index() method

Permutation.index() : index() is a sympy Python library function that returns the index value of the permutation in argument. Index of a permutation = Sum of all subscripts j such that permutation[j] is greater than permutation[j+1]. Syntax : sympy.combinatorics.permutations.Permutation.index() Retu

Python | SymPy Permutation.atoms() method

Permutation.atoms() : atoms() is a sympy Python library function that returns all the elements that are present in the permutation. Syntax : sympy.combinatorics.permutations.Permutation.atoms() Return : elements of the argumented permutation. Code #1 : atoms() Example # Python code explaining # SymP

Python | SymPy Permutation.cycle_structure() method

Permutation.cycle_structure() : cycle_structure() is a sympy Python library function that returns the cycle structure of the permutation as a dictionary and this will indicate the multiplicity of each cycle length. Syntax : sympy.combinatorics.permutations.Permutation.cycle_structure() Return : cycl

Python | SymPy Permutation.full_cyclic_form() method

Permutation.full_cyclic_form() : full_cyclic_form() is a sympy Python library function that returns the permutation in cyclic form, by including the singletons. Syntax : sympy.combinatorics.permutations.Permutation.full_cyclic_form() Return : permutation in cyclic form Code #1 : full_cyclic_form() E

Python | SymPy Permutation.commutes_with() method

Permutation.commutes_with() : commutes_with() is a sympy Python library function that checks whether the two permutations are commuting. Suppose 'a' and 'b' are part of 'C', then the commutator of a and b is the 'C' identity if a and b commute, i.e. ab == ba. Syntax : sympy.combinatorics.permutation

Python | SymPy Permutation.cardinality() method

Permutation.cardinality() : cardinality() is a sympy Python library function that returns all the possible number of permutation. Syntax : sympy.combinatorics.permutations.Permutation.cardinality() Return : all the possible number of permutation Code #1 : cardinality() Example # Python code explaini

Python | SymPy Permutation.commutator() method

Permutation.commutator() : commutator() is a sympy Python library function that returns the commutator of the partition. Suppose 'a' and 'b' are part of 'C', then the commutator of a and b is the 'C' identity iff a and b commute, i.e. ab == ba. Syntax : sympy.combinatorics.permutations.Permutation.c