Reduced Gröbner bases under composition
In this paper, the authors study how the reduced Gröbner bases computation behaves with respect to composition. Their main result is to give an equivalent condition to the fact that reduced Gröbner bases computation commutes with composition under the same term ordering: The composition must be given by a list of permuted univariate polynomials and must be compatible with the term ordering. This equivalence answers a question stated by \textit{H. Hong} [ibid. 25, No. 5, 643-663 (1998)]. In the last section, the authors show examples of compositions which satisfy the equivalence. They also state an equivalent condition to the fact that minimal Gröbner bases computation commutes with composition under the same term ordering and study the behaviour of reduced Gröbner bases with respect to composition under different term orderings.
- The term orderings which are compatible with composition. II.
- SAGBI bases under composition
- Some criteria for Gröbner bases and their applications
- The -Gröbner bases under polynomial composition
- Further results on homogeneous Gröbner bases under composition
- Resultants of partially composed polynomials
- Homogeneous Gröbner bases under composition
- scientific article; zbMATH DE number 5846112 (Why is no real title available?)
- Composed Groebner basis over Noetherian domain under different term orderings
- Reduced Gröbner Bases of Certain Toric Varieties; A New Short Proof
- W-Gröbner basis and monomial ideals under polynomial composition
- Further on the composition of SAGBI bases
- On multivariate rational function decomposition
- The Groebner basis under composition. I.
- Differential standard bases under composition
This page was built for publication: Reduced Gröbner bases under composition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1269748)
