Groebner Basis Under Composition I

@article{Hong1998GroebnerBU,
  title={Groebner Basis Under Composition I},
  author={Hoon Hong},
  journal={J. Symb. Comput.},
  year={1998},
  volume={25},
  pages={643-663}
}
  • H. Hong
  • Published 1 May 1998
  • Mathematics
  • J. Symb. Comput.
Composition is the operation of replacing variables in a polynomial with other polynomials. The main question of this paper is:When does composition commute with Groebner basis computation?We prove that this happens iff the composition is `compatible? with the term ordering and the nondivisibility. This has a natural application in the computation of Groebner bases of composed polynomials which often arises in real-life problems. 
Groebner basis under composition II
TLDR
It is proved that this happens i the composition is ‘compatible’ with the term ordering and the nondivisibility of Groebner basis computation.
The Gröbner h-bases under composition
Polynomial composition is the operation of replacing variables in a polynomial with other polynomials. H.Hong has resolved following problem: when does polynomial composition commute with Gröbner
The λ-Gröbner Bases Under Polynomial Composition
Polynomial composition is the operation of replacing variables in a polynomial with other polynomials. λ-Gröbner basis is an especial Gröbner basis. The main problem in the paper is: when does
NON-COMMUTATIVE GRÖBNER BASES UNDER COMPOSITION
Polynomial composition is the operation of replacing the variables in a polynomial with other polynomials. In this paper we give sufficient and necessary conditions on a set Θ of non-commutative
Further results on homogeneous Gröbner bases under composition
FURTHER ON THE COMPOSITION OF SAGBI BASES
Composition is the operation of replacing variables in a polynomial by other polynomials. In this paper, we show that composition commutes with SAGBI basis computation (possibly under different
SAGBI Bases Under Composition
TLDR
A sufficient and necessary condition is given to assure that the set F of composed polynomials is a SAGBI basis whenever F is.
Subresultants Under Composition
  • H. Hong
  • Mathematics
    J. Symb. Comput.
  • 1997
TLDR
The main contribution of the paper is to show that the subresultants ``almost'' commute with composition, which generalizes the well-known fact that the resultant is invariant under translation.
Multivariate Resultants Under Composition
Composition is an operation of replacing variables in a polynomial with other poly-nomials. The main question of this paper is: What happens to multivariate resultants under composition? We prove
Reduced Gröbner Bases Under Composition
TLDR
A sufficient condition is provided to determine when composition commutes with reduced Grobner bases computation (possibly) under different term ordering.
...
...

References

SHOWING 1-10 OF 23 REFERENCES
Groebner basis under composition II
TLDR
It is proved that this happens i the composition is ‘compatible’ with the term ordering and the nondivisibility of Groebner basis computation.
Subresultants Under Composition
  • H. Hong
  • Mathematics
    J. Symb. Comput.
  • 1997
TLDR
The main contribution of the paper is to show that the subresultants ``almost'' commute with composition, which generalizes the well-known fact that the resultant is invariant under translation.
Multivariate Resultants Under Composition
Composition is an operation of replacing variables in a polynomial with other poly-nomials. The main question of this paper is: What happens to multivariate resultants under composition? We prove
On the Theory of Graded Structures
  • L. Robbiano
  • Mathematics, Computer Science
    J. Symb. Comput.
  • 1986
Gröbner bases - a computational approach to commutative algebra
TLDR
This chapter discusses linear algebra in Residue Class Rings in Vector Spaces and Modules, and first applications of Gr bner Bases.
Functional Decomposition of Polynomials: The Tame Case
  • J. Gathen
  • Mathematics, Computer Science
    J. Symb. Comput.
  • 1990
Polynomial Decomposition Algorithms
Fast computations in the lattice of polynomial rational function fields
TLDR
A fast algorithm for computing a generator of k (p, q), wlhich is similar to the Euclidean algorithm, and also an extended version, that expresses this generator in terms of p and q are given.
Admissible orders and linear forms
TLDR
From now on an "admissible order" will be a linear group order on [EQUATION] with [EquATION] >= 0.
...
...