The \(\lambda \)-Gröbner bases under polynomial composition

DOI10.1007/s11424-007-9059-5zbMath1135.13306OpenAlexW2028159581MaRDI QIDQ2425845

Dong-Mei Li, Xiao-song Chen, Jin-wang Liu

Publication date: 7 May 2008

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-007-9059-5

zbMATH Keywords

polynomial compositionterm ordering\(\lambda \)-gröbner basis

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (1)

Normal projection: deterministic and probabilistic algorithms

Cites Work

• Unnamed Item
• Groebner basis under composition. I
• Reduced Gröbner bases under composition
• The tangent cone algorithm and homogenization
• The term orderings which are compatible with composition. II.
• Advances and improvements in the theory of standard bases and syzygies
• Homogeneous Gröbner bases under composition
• Remarks on Gröbner basis for ideals under composition

This page was built for publication: The \(\lambda \)-Gröbner bases under polynomial composition