On Canonical Forms and Simplification
Journal of the ACM (JACM)
Algebraic simplification: a guide for the perplexed
Communications of the ACM
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Toward a formal implementation of computer algebra
ACM SIGSAM Bulletin
Realistic analysis of some randomized algorithms
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Simplification of algebraic expression by multiterm rewriting rules
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Gsolve: a faster algorithm for solving systems of algebraic equations
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
Journal of Symbolic Computation
On the construction of Gröbner bases using syzygies
Journal of Symbolic Computation
Standard bases for general coefficient rings and a new constructive proof of Hilbert's basis theorem
Journal of Symbolic Computation
Algorithm 628: An algorithm for constructing canonical bases of polynomial ideals
ACM Transactions on Mathematical Software (TOMS)
Simplification of radical expressions
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
A theoretical basis for the reduction of polynomials to canonical forms
ACM SIGSAM Bulletin
The use of "LET" statements in producing short comprehensible outputs
ACM SIGSAM Bulletin
Some comments on the modular approach to Gröbner-bases
ACM SIGSAM Bulletin
Hi-index | 0.00 |
At the EUROSAM Conference 1974 it was conjectured that there exist probably no canonical forms for polynomial expressions under polynomial side relations. In 1965, however, Buchberger had already implemented a reduction algorithm solving the problem over fields. Positive results were also attained independently since 1974 by R. Shtokhamer and the author. In this note a general theorem on canonical representatives is obtained and by application to Buchberger's and Shtokhamer's algorithms it is proven that the stated problem is solved.