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

ascendingRuns -- computes the ascending runs of a permutation

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

Ways to use ascendingRuns:

  • ascendingRuns(Permutation)

For the programmer

The object ascendingRuns is a method function.


The source of this document is in Permutations/Documentation/mainDocs.m2:49:0.