Saturations of subalgebras, SAGBI bases, and U-invariants

DOI10.1016/J.JSC.2020.07.006MaRDI QIDQ820960zbMATH OpenOpenAlexFDO

Authors Anna M. Bigatti, Lorenzo Robbiano

Publication date 29 September 2021

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.10901

\(U\)-invariants CoCoA SAGBI bases subalgebra saturation

Subalgebras, congruence relations (08A30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Group actions on affine varieties (14R20) Symbolic computation and algebraic computation (68W30)

Abstract: Given a polynomial ring

P

over a field

K

, an element

g i n P

, and a

K

-subalgebra

S

of

P

, we deal with the problem of saturating

S

with respect to

g

, i.e. computing

S a t_{g} (S) = S [g, g^{- 1}] c a p P

. In the general case we describe a procedure/algorithm to compute a set of generators for

S a t_{g} (S)

which terminates if and only if it is finitely generated. Then we consider the more interesting case when

S

is graded. In particular, if

S

is graded by a positive matrix

W

and

g

is an indeterminate, we show that if we choose a term ordering

s i g m a

of

g

-DegRev type compatible with

W

, then the two operations of computing a

s i g m a

-SAGBI basis of

S

and saturating

S

with respect to

g

commute. This fact opens the doors to nice algorithms for the computation of

S a t_{g} (S)

. In particular, under special assumptions on the grading one can use the truncation of a

s i g m a

-SAGBI basis and get the desired result. Notably, this technique can be applied to the problem of directly computing some

U

-invariants, classically called semi-invariants, even in the case that

K

is not the field of complex numbers.

Review text

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\).

Recommendations

Cites work

Cited in

(6)

Describes a project that uses

Uses Software

CoCoA

This page was built for publication: Saturations of subalgebras, SAGBI bases, and U-invariants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820960)