ascents w
A permutation $p=(p_1 \, \dots \, p_n)$ has an ascent at $i$ (for $i < n$) if $p(i) < p(i+1)$.
i1 : p = permutation {3,1,2,5,4} o1 = Permutation{3, 1, 2, 5, 4} o1 : Permutation
i2 : ascents p o2 = {2, 3} o2 : List
The object ascents is a method function.