Combinatorial algorithm for the computation of cyclically standard regular bracket monomials (Q2211188)

Let \(\mathbb{C} [x,y]\) be the polynomial ring in 2 variables and consider a binary form of degree \(n\) \[ f(x,y)=\sum_{k=0}^n \binom{n}{k} a_k x^k y^{n-k}. \] The general linear group \(\mathrm{GL}_2(\mathbb{C})\) acts on this polynomial ring by linear change of variables given as; for \(A=\begin{pmatrix}\alpha&\beta\\\gamma&\theta\end{pmatrix}\in \mathrm{GL}_2(\mathbb{C})\) \[\bar{f}(\bar{x},\bar{y})=f(\alpha \bar{x}+\gamma\bar{y}, \beta\bar{x}+\delta\bar{y})=\sum_{k=0}^n \binom{n}{k} \bar{a_k} \bar{x}^k \bar{y}^{n-k}.\] After expanding the action linearly to the polynomial ring \(\mathbb{C}[a_0,\dotsc,a_n,x,y],\) we get linear action of \(\mathrm{GL}_2(\mathbb{C})\) on \(n+3\) variables. A polynomial \(I(a_0,\dotsc,a_n,x,y)\) is said to be covariant of index \(g\) if \(I(\bar{a}_0,\dotsc,\bar{a}_n,\bar{x},\bar{y})=(\det A)^g I(a_0,\dotsc,a_n,x,y),\) for all \(A\in \mathrm{GL}_2(\mathbb{C}).\) In the paper under review, a combinatorial algorithm is given for a generating set for covariants. The paper is self contained, by introducing bracket polynomials, and cyclically standard monomials and then proves that; Theorem 2. The set of cyclically standard regular bracket monomials of degree 1 together with the regular bracket monomials of degree 2 corresponding to Hamiltonian circuits is a generating set of the ring of regular bracket polynomials. improving the results of \textit{A. B. Kempe} [Proc. Lond. Math. Soc. 25, 343--359 (1894; JFM 25.0235.01)]. Moreover, there are two explicit examples are given with a graphical description.