About Gordan's algorithm for binary forms (Q1692130): Difference between revisions

In this article, the author presents a modern treatment of Gordan's algorithms for computing algebra generating sets of covariants for binary forms $V_n$ of degree $n$ over $\mathbb{C}$. Two versions of Gordan's algorithm are considered; the first produces a generating set for $\mathrm{Cov}(V_n):= \mathbb{C}[V_n \oplus V_2]^{SL_2(\mathbb{C})}$ given generating sets for $\mathrm{Cov}(V_k)$ for $k < n$, the second produces a generating set for $\mathrm{Cov}(V_m \oplus V_n)$ given generating sets of $\mathrm{Cov}(V_m)$ and $\mathrm{Cov}(V_n)$. \par It should be noted that Gordan's algorithm does not necessarily produce minimal generating sets, and other methods have to be employed to reduce the given generating set to a minimal one. Here, the author uses methods of \textit{L. P. Bedratyuk} [Ukr. Math. J. 63, No. 6, 880--890 (2011; Zbl 1262.13010); translation from Ukr. Mat. Zh. 63, No. 6, 755--763 (2011)] to compute multigraded Hilbert series to help with the reduction. However, the author also gives an improvement to the first version of the algorithm, in the sense that it produces a fewer redundant covariants. The author illustrates this by computing a minimal generating set for $\mathrm{Cov}(V_8)$. He uses the second version of the algorithm to produce, for the first time, minimal generating sets for $\mathrm{Cov}(V_6 \oplus V_4)$, $\mathrm{Cov}(V_6 \oplus V_4 \oplus V_2)$ and $\mathrm{Cov}(V_8 \oplus V_4 \oplus V_4)$. These particular examples are chosen because they arise in the study of certain $\mathrm{SO}_3$ tensorial representations, occuring in linear elasticity, piezoelectricity and the second gradient of strain elasticity theory.