W-Gröbner basis and monomial ideals under polynomial composition

DOI10.1007/S11766-011-2695-5zbMath1249.13023OpenAlexW2182122933MaRDI QIDQ423183

Dong-Mei Li, Jin-wang Liu, Wei-jun Liu

Publication date: 1 June 2012

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-011-2695-5

zbMATH Keywords

polynomial compositionW-Gröbner basisweakly relatively prime

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Mechanization of proofs and logical operations (03B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New constructive methods in classical ideal theory
• On the complexity of computing syzygies
• On superG-bases
• An approach to the zero recognition problem by Buchberger algorithm
• Groebner basis under composition. I
• Reduced Gröbner bases under composition
• The term orderings which are compatible with composition. II.
• Further results on homogeneous Gröbner bases under composition
• Homogeneous Gröbner bases under composition

This page was built for publication: W-Gröbner basis and monomial ideals under polynomial composition