W-Gröbner basis and monomial ideals under polynomial composition
DOI10.1007/S11766-011-2695-5zbMATH Open1249.13023OpenAlexW2182122933MaRDI QIDQ423183FDOQ423183
Authors: Dongmei Li, Jinwang Liu, Weijun 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
Recommendations
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
- Groebner basis under composition. I
- The term orderings which are compatible with composition. II.
- Title not available (Why is that?)
- On the complexity of computing syzygies
- Title not available (Why is that?)
- Title not available (Why is that?)
- New constructive methods in classical ideal theory
- On superG-bases
- An approach to the zero recognition problem by Buchberger algorithm
- Reduced Gröbner bases under composition
- Further results on homogeneous Gröbner bases under composition
- Homogeneous Gröbner bases under composition
Cited In (1)
This page was built for publication: W-Gröbner basis and monomial ideals under polynomial composition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423183)