File: minPosition-doc.m2

package info (click to toggle)
macaulay2 1.17.1%2Bds-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 68,376 kB
  • sloc: cpp: 102,995; ansic: 10,040; javascript: 6,019; sh: 3,506; makefile: 3,426; lisp: 727; yacc: 590; perl: 369; xml: 177; python: 141; lex: 65; awk: 3
file content (40 lines) | stat: -rw-r--r-- 921 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
-- Status: rewritten July 2018
-- Author: Lily Silverstein

doc///
 Key 
  minPosition
  (minPosition, BasicList)
 Headline
  position of the smallest element
 Usage
  minPosition L
 Inputs
  L:BasicList
 Outputs
  i:ZZ
   the index of the smallest element in the list {\tt L}
 Description
  Text
   If the smallest element occurs more than once, the index of its first occurrence is used.
  Example
   minPosition {2, 1, 6, 4, 1}
  Text
   If {\tt L} contains elements in a polynomial ring, the @TO MonomialOrder@
   of the ring is used for comparisons.
  Example
   R1 = QQ[x, y, z, MonomialOrder => Lex];
   minPosition {x*y^2, x*y^2 + z^2, y^4, y*z^5}
   R2 = QQ[x, y, z, MonomialOrder => GRevLex];
   minPosition (x*y^2, x*y^2 + z^2, y^4, y*z^5)
  Text
   More generally, the order of the elements is determined using the @TO "?"@ operator.
 SeeAlso 
  maxPosition
  max
  min
  sort
  position
  positions
  "?"
///