When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
type: Item
instance of: scholarly article
title: When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
zbMATH Open document ID: 1234.13028
author: François Lemaire
author: Marc Moreno Maza
author: Wei Pan
author: Yuzhen Xie
published in: Journal of Symbolic Computation
publication date: 2011-12-19T00:00:00Z
review text: Let \(S=\Bbbk[x_1,\dots,x_n]\) be a multivariate polynomial ring with ordered variables \(x_1\prec x_2 \prec \dots \prec x_n\). For any polynomial \(p\in S\) the largest variable dividing one of its terms is the \textit{main variable} \(\text{mvar}(p)\) of \(p\). Then \(p\) is regarded as a univariate polynomial in \(\text{mvar}(p)\) and its leading coefficient is denoted \(\text{init}(p)\). For any set \(T\subset S\) define \(\text{sat} (T) := \langle T\rangle : h^\infty\) where \(h\) is the product of all \(\text{init}(t)\), \(t\in T\). A \textit{regular chain} is defined inductively. The empty set is a regular chain. If \(T\) is a set of polynomials, then write \(T = \{p\} \cup T'\) where \(p\in T\) has the greatest main variable among the elements of \(T\). In this case \(T\) is a regular chain if \(T'\) is and \(\text{init}(p)\) is regular modulo \(\text{sat}(T')\). For example, every regular sequence is a regular chain, but not the other way around. The main use of regular chains is that the containments \(p \in \text{sat}(T)\) and \(p\in \sqrt{\text{sat}(T)}\) can be tested efficiently, that is without computing a Gröbner basis of \(\langle T \rangle\). The paper characterizes cases in which \(\langle T \rangle = \text{sat}(T)\) in terms of a property of \(T\) called \textit{primitivity}. The authors also give algorithms to test for primitivity and apply their method to inclusion tests of the form \(\text{sat}(U)\subseteq \text{sat}(T)\) for regular chains \(U,T\). The runtime of their Maple implementation is assessed by means of example.
reviewed by: Thomas Kahle
Mathematics Subject Classification ID: 13P05
Mathematics Subject Classification ID: 13P15
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 5989489
zbMATH Keywords: regular chain
zbMATH Keywords: saturated ideal
zbMATH Keywords: primitive polynomial
zbMATH Keywords: triangular system
describes a project that uses: Maple
describes a project that uses: RegularChains
MaRDI profile type: Publication
full work available at URL: j.jsc.2011.08.010
OpenAlex ID: W1875131895
cites work: On the Contents of Polynomials
cites work: On the theories of triangular sets
cites work: Triangular sets for solving polynomial systems: a comparative implementation of four methods
cites work: Q3568131
cites work: Comprehensive Triangular Decomposition
cites work: On the dimension of an arbitrary ascending chain
cites work: Generic Gaussian ideals
cites work: Q4425661
cites work: Q4831217
cites work: A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
cites work: Algorithmic properties of polynomial rings
cites work: Q3416657
cites work: Q5301624
cites work: Rational simplification modulo a polynomial ideal
cites work: Q4352810
cites work: Q5795628
cites work: Q4781203
cites work: Computing triangular systems and regular systems
cites work: Q3737533
DOI: 10.1016/J.JSC.2011.08.010
description: scientific article; zbMATH DE number 5989489