next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
Macaulay2Doc :: minPosition

minPosition -- position of the smallest element

Synopsis

Description

If the smallest element occurs more than once, the index of its first occurrence is used.

i1 : minPosition {2, 1, 6, 4, 1}

o1 = 1

If L contains elements in a polynomial ring, the MonomialOrder of the ring is used for comparisons.

i2 : R1 = QQ[x, y, z, MonomialOrder => Lex];
i3 : minPosition {x*y^2, x*y^2 + z^2, y^4, y*z^5}

o3 = 3
i4 : R2 = QQ[x, y, z, MonomialOrder => GRevLex];
i5 : minPosition (x*y^2, x*y^2 + z^2, y^4, y*z^5)

o5 = 0

More generally, the order of the elements is determined using the ? operator.

See also

Ways to use minPosition :