'Returns the positions of ascents in a permutation, ie, the location
where p[i] < p[i+1]
Examples
>>> from sympy.combinatorics.permutations import Permutation
>>> p = Permutation([4, 0, 1, 3, 2])
>>> p.ascents()
[1, 2]
See Also
descents, inversions, min, max'

def ascents(self):

    a = self.array_form
    pos = [i for i in range((len(a) - 1)) if (a[i] < a[(i + 1)])]
    return pos
