Characterization of relative Gröbner bases (Q390387): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.jsc.2013.03.003 / rank | |||
Property / cites work | |||
Property / cites work: Converting bases with the Gröbner walk / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Gröbner bases with respect to several orderings and multivariable dimension polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3708893 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial algorithms in computer algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing difference-differential dimension polynomials by relative Gröbner bases in difference-differential modules / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.JSC.2013.03.003 / rank | |||
Normal rank |
Latest revision as of 16:07, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Characterization of relative Gröbner bases |
scientific article |
Statements
Characterization of relative Gröbner bases (English)
0 references
8 January 2014
0 references
Gröbner bases are one of the most important concepts in Computational Algebra. They have many applications and allow to make several computations in polynomial rings. \textit{M. Zhou} and \textit{F. Winkler} [J. Symb. Comput. 43, No. 10, 726--745 (2008; Zbl 1149.13014)] introduced the concept of \textit{relative Gröbner bases}, together with the notion of \textit{relative reduction}. These ideas are strictly related to the one of Gröbner basis w.r.t. several term orderings, due to \textit{A. B. Levin} [J. Symb. Comput. 42, No. 5, 561--578 (2007; Zbl 1144.13013)]. In this paper, the author provides results that complete the theory of relative Gröbner bases by Zhou and Winkler, such as a characterization for relative Gröbner bases and the conditions on the leading terms s.t. a relative Gröbner basis is not changed by a change of term ordering. He analyzes the algorithm for the computation of relative Gröbner bases proposed by Zhou and Winkler, focusing on the problem of termination and providing an example of non-termination.
0 references
relative Gröbner bases
0 references
relative reduction
0 references
symmetry of relative Gröbner bases
0 references
characterization of relative Gröbner bases
0 references
0 references