Saturations of subalgebras, SAGBI bases, and U-invariants (Q820960)

Let \(R=K[x_1,\dots ,x_n]\) and \(F\) be a (not necessarily finite) subset of \(R\). Then the subalgebra of \(R\) generated by \(F\) is denoted \(K[F]\). Similar to the notion of Grobner bases for ideals of \(R\), we can define the notion of SAGBI Gröbner basis for \(K[F]\) (see e.g. the paper of the second author and \textit{M. Sweedler} [Lect. Notes Math. 1430, 61--87 (1990; Zbl 0725.13013)] which is regarded as a pioneer work). Let \(S\) be a \(K\)-subalgebra of the polynomial ring \(R\) , and let \(0 \ne g\in S\). We denote the set \(\bigcup_{i=0}^\infty \{ f \in R \ | \ g^i f \in S\}\) by \(S : g^\infty\). The problem that the authors address in this paper is as follows: Given polynomials \(g_1,\dots, g_r \in R\), let \(S= K[g_1,\dots, g_r]\) and \(0\ne g \in S\). The problem is to compute a set of generators for \(S : g^\infty\). In the first part of the paper, an algorithm has been presented to compute a set of generators for \(S : g^\infty\) which terminates if and only if it is finitely generated. In the second part of the paper, the authors consider the case that \(S\) is graded. They show that two operations of computing a SAGBI basis for \(S\) and a set of generators for \(S : g^\infty\) commute and this leads to nice algorithms for computing with \(S : g^\infty\).