No label defined (Q3972073)

[For the entire collection see Zbl 0694.00010.] According to the first fundamental theorem of invariant theory [\textit{H. Weyl}, The classical groups -- their invariants and representations (1939; Zbl 0020.20601)], the invariants of the general linear group acting on a vector space \(V\) of dimension \(r\) over an arbitrary field \(K\) are the homogeneous polynomials in the brackets, which are determinants of \(r\) of the vectors. The invariants of the projective linear group are the bracket polynomials satisfying a stronger homogeneity condition. Each bracket monomial is called a tableau. The straightening algorithm [\textit{B. Sturmfels} and the author, Adv. Math. 76, No. 2, 245-259 (1989; Zbl 0695.13001)] is a procedure for writing any bracket polynomial as a linear combination of certain tableaux called standard tableaux. It is well known that the standard tableaux form a linear basis of the vector space of bracket polynomials. The author describes the straightening algorithm as a whole and draws connections to the more general Gröbner basis normal form algorithms. He examines the choices that are involved in implementing a straightening algorithm and provides a comparison of the performances of some particular variations of the algorithm. Finally, the author uses one of the variations to straighten an invariant of \textit{H. W. Turnbull} and \textit{A. Young} [Linear invariants of ten quaternary quadrics, Trans. Camb. Philos. Soc. 23, 264-302 (1927; JFM 53.0094.01)] which specifies when ten points lie on a common quadric surface in the projective three-space.