Macaulay2 » Documentation
Packages » Permutations :: saliances

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

saliances -- computes the saliances of a permutation

Usage:

saliances w
Inputs:
- w, a permutation,
Outputs:
- a list,

Description

A permutation $p$ has a saliance at $i$ if $p(j) < p(i)$ for all $j > i$.

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

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

o1 : Permutation

i2 : saliances p

o2 = {4, 5}

o2 : List

See also

ascendingRuns -- computes the ascending runs of a permutation
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
records -- computes the saliances of a permutation

Ways to use saliances:

saliances(Permutation)

For the programmer

The object saliances is a method function.

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