Hofstadter's Law: It always takes longer than you think it will take, even if you take into
account Hofstadter's Law.(Douglas R. Hofstadter) Dear Reader, what you are holding in …

Computing the Hermite Normal Form of an n× n integer matrix using the best current
algorithms typically requires Ο (n 3 log M) space, where M is a bound on the entries of the …

In this paper, we discuss several notions of decomposition for multivariate polynomials,
focussing on the relation with Lüroth's theorem in field theory, and the finiteness and …

Composition is an operation of replacing a variable in a polynomial with another polynomial.
The main question of this paper is: What happens to subresultants under composition? The …

In this paper we continue the work done in [GMRT]. Namely we describean algorithm which
allows to drive the classicalBuchberger Algorithm by meansof multigrade Hilbert-Poincar6 …

Composition is an operation of replacing variables in a polynomial with other polynomials.
The main question of this paper is: When does composition commute with Gr-oebner basis …

In this paper we contribute with one main result to the interesting problem initiated by Hong
(1998, J. Symb. Comput. 25, 643–663) on the behaviour of Gröbner bases under …

The method of Gröbner bases is a powerful effective technique for solving problems in
commutative algebra and algebraic geometry that was coined by Bruno Buchberger in his …

Earlier work has presented algorithms to factor and compute GCDs of symbolic Laurent
polynomials, that is multivariate polynomials whose exponents are themselves integer …

Polynomial composition is the operation of replacing the variables in a polynomial with other
polynomials. In this paper we give a sufficient and necessary condition on a set Θ of …