Macaulay2 » Documentation
Packages » Permutations :: ascendingRuns

next | previous | forward | backward | up | index | toc

ascendingRuns -- computes the ascending runs of a permutation

Usage:

ascendingRuns w
Inputs:
- w, a permutation,
Outputs:
- allRuns, a list,

Description

An ascending run is a maximal subsequence of successive ascents.

i1 : p = permutation {3,1,2,5,4}

o1 = Permutation{3, 1, 2, 5, 4}

o1 : Permutation

i2 : ascendingRuns p

o2 = {1 : (3), (1, 2, 5), 1 : (4)}

o2 : List

See also

ascents -- computes the ascents of a permutation
descendingRuns -- computes the descending runs of a permutation
descents -- computes the descents of a permutation
exceedances -- computes the exceedances of a permutation
saliances -- computes the saliances of a permutation
records -- computes the saliances of a permutation

Ways to use ascendingRuns:

ascendingRuns(Permutation)

For the programmer

The object ascendingRuns is a method function.

The source of this document is in /__w/M2/M2/macaulay2-1.26.05+ds/M2/Macaulay2/packages/Permutations/Documentation/mainDocs.m2:49:0.