Python | SymPy Permutation.cardinality() method

Python | SymPy Permutation.descents() method

Last Updated : 26 Aug, 2019

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 : descents() Example

Python3 1=1

# Python code explaining
# SymPy.descents()

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

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

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

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


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

Output :

Permutation a - descents form : [1] Permutation b - descents form : [2, 3, 4]

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

Python3 1=1

# Python code explaining
# SymPy.descents()

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

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

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


print ("Permutation a - descents form : ", a.descents())

Output :

Permutation a - descents form : [0, 3, 5]

Python | SymPy Permutation.cardinality() 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.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.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 Python3 1=1 # Python code expla

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 Python3 1=1 # Python c

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

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

SymPy | Permutation.length() in Python

Permutation.length() : length() is a sympy Python library function that finds the number of integers moved by the permutation. Syntax : sympy.combinatorics.permutations.Permutation.length() Return : number of integers moved by the permutation Code #1 : length() Example Python3 1=1 # Python code expl

Python | SymPy Permutation.get_adjacency_distance() method

Permutation.get_adjacency_distance() : get_adjacency_distance() is a sympy Python library function that calculates the adjacency distance between two permutations. Syntax : sympy.combinatorics.permutations.Permutation.get_adjacency_distance() Return : adjacency distance between two permutation Code

SymPy | Permutation.is_odd() in Python

Permutation.is_odd() : is_odd() is a sympy Python library function that checks whether the permutation is odd. Syntax : sympy.combinatorics.permutations.Permutation.is_odd() Return : true - if the permutation is odd; otherwise false Code #1 : is_odd() Example Python3 1=1 # Python code explaining # S