Relative reduction and Buchberger's algorithm in filtered free modules (Q1701647)

From MaRDI portal





scientific article; zbMATH DE number 6843888
Language Label Description Also known as
default for all languages
No label defined
    English
    Relative reduction and Buchberger's algorithm in filtered free modules
    scientific article; zbMATH DE number 6843888

      Statements

      Relative reduction and Buchberger's algorithm in filtered free modules (English)
      0 references
      0 references
      0 references
      27 February 2018
      0 references
      Let \(p\) be a positive integer and \(\mathbb{N}^p\) the semigroup of natural numbers. Let us consider the following partial ordering on \(\mathbb{N}^p\): We write \(r=(r_1,\ldots ,r_p)\prec s=(s_1,\ldots ,s_p)\) if \(r_i\leq s_i\) for each \(i\). Assume that \(R\) is a left noetherian ring containing a commutative ring \(K\). Then, \(R\) is called a \textit{\(p\)-filtered ring} if there exists a family of \(K\)-submodules \(\{R_r \mid r\in \mathbb{N}^p\}\) of \(R\) so that for any \(r,s\in \mathbb{N}^p\) the following conditions hold: {\parindent=6mm \begin{itemize}\item[(1)] \(R_r\subset R_s\) whenever \(r\prec s\) \item[(2)] \(R_r.R_s\subset R_{r+s}\) \item[(3)] \(R=\bigcup_{r\in \mathbb{N}^p}{R_r}\) \item[(4)] \(1\in R_{(0,\ldots ,0)}\). \end{itemize}} \(R\) is called monomially \(p\)-filtered, if in addition for each \(f\in R_r\), the support of \(f\) is included in \(R_r\). In the paper under review, the authors introduce the concepts of monomial orderings, reduction and Gröbner bases for free modules over a monomially \(p\)-filtered ring. Furthermore, they describe a Buchberger-like algorithm for the construction of such Gröbner bases.
      0 references
      0 references
      filtered module
      0 references
      admissible orders
      0 references
      relative Gröbner basis
      0 references
      Gröbner reduction
      0 references
      0 references

      Identifiers