Python | SymPy Permutation.from_sequence() method

Python | SymPy Permutation.cycle_structure() method

Last Updated : 27 Aug, 2019

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 : cycle structure of the permutation as a dictionary

Code #1 : cycle_structure() Example

Python3 1=1

# Python code explaining
# SymPy.Permutation.cycle_structure()

# importing SymPy libraries
from sympy.combinatorics.partitions import Partition
from sympy.combinatorics.permutations import Permutation

# Using from 
# sympy.combinatorics.permutations.Permutation.cycle_structure() method 

# creating Permutation
a = Permutation([2, 0, 3, 1, 5, 4])

b = Permutation([3, 1, 2, 5, 4, 0])


print ("Permutation a - cycle_structure form : ", a.cycle_structure)
print ("Permutation b - cycle_structure form : ", b.cycle_structure)

Output :

Permutation a - cycle_structure form : {2: 1, 4: 1} Permutation b - cycle_structure form : {1: 3, 3: 1}

Code #2 : cycle_structure() Example - 2D Permutation

Python3 1=1

# Python code explaining
# SymPy.Permutation.cycle_structure()

# importing SymPy libraries
from sympy.combinatorics.partitions import Partition
from sympy.combinatorics.permutations import Permutation

# Using from 
# sympy.combinatorics.permutations.Permutation.cycle_structure() method 

# creating Permutation
a = Permutation([[2, 4, 0], 
                 [3, 1, 2],
                 [1, 5, 6]])

# SELF COMMUTATING    
print ("Permutation a - cycle_structure form : ", a.cycle_structure)

Output :

Permutation a - cycle_structure form : {7: 1}

Python | SymPy Permutation.from_sequence() method

N

noobestars101

Improve

Article Tags :

Python
SymPy

Practice Tags :

python

Similar Reads

Python | SymPy Permutation.cycles() method

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() Ex

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.from_sequence() method

Permutation.from_sequence() : from_sequence() is a sympy Python library function that returns the permutation which is required to obtain 'i' from the sorted elements of 'i'. A 'key' can also be passed as an argument if any custom string is required. Syntax : sympy.combinatorics.permutations.Permuta

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.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.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 Partition.sort_key() method

Partition.sort_key() : sort_key() is a sympy Python library function that returns canonical key which can be used for string. This ordering of canonical key is based on the size and the elements of the partition whose ties are broken with the rank. Syntax : sympy.combinatorics.partitions.Partition.s

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.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.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