Saturations of Subalgebras, SAGBI Bases, and U-invariants

preprint2020arXivOpen access

Abstract

Given a polynomial ring PP over a field KK, an element g∈Pg \in P, and a KK-subalgebra SS of PP, we deal with the problem of saturating SS with respect to gg, i.e. computing Satg(S)=S[g,g−1]∩PSat_g(S) = S[g, g^{-1}]\cap P. In the general case we describe a procedure/algorithm to compute a set of generators for Satg(S)Sat_g(S) which terminates if and only if it is finitely generated. Then we consider the more interesting case when SS is graded. In particular, if SS is graded by a positive matrix WW and gg is an indeterminate, we show that if we choose a term ordering σσ of gg-DegRev type compatible with WW, then the two operations of computing a σσ-SAGBI basis of SS and saturating SS with respect to gg commute. This fact opens the doors to nice algorithms for the computation of Satg(S)Sat_g(S). In particular, under special assumptions on the grading one can use the truncation of a σσ-SAGBI basis and get the desired result. Notably, this technique can be applied to the problem of directly computing some UU-invariants, classically called semi-invariants, even in the case that KK is not the field of complex numbers.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.