Macaulay2 » Documentation
Packages » Permutations :: descendingRuns
next | previous | forward | backward | up | index | toc

descendingRuns -- computes the descending runs of a permutation

Synopsis

Description

A descending run is a maximal subsequence of successive descents.

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

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

o1 : Permutation
i2 : descendingRuns p

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

o2 : List

See also

Ways to use descendingRuns:

For the programmer

The object descendingRuns is a method function.