Python | SymPy Permutation.descents() method Last Updated : 26 Aug, 2019 Summarize Comments Improve Suggest changes Share Like Article Like Report 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] Comment More infoAdvertise with us Next Article Python | SymPy Permutation.descents() method N noobestars101 Follow 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 1 min read 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 1 min read 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 1 min read 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 1 min read 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 1 min read Like