Rational simplification modulo a polynomial ideal

Authors:
Michael Monagan;Roman Pearce
Affiliations:
Simon Fraser University, Burnaby, B.C. Canada;Simon Fraser University, Burnaby, B.C. Canada
Venue:
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Year:
2006

Citing 6
Cited 7

Rational parametrizations of algebraic curves using a canonical divisor

Journal of Symbolic Computation - Special issue: parametric algebraic curves and applications
Efficient algorithms for ideal operations (extended abstract)

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Rational parametrization of real algebraic surfaces

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Advances on the simplification of sine-cosine equations

Journal of Symbolic Computation
Algorithms for trigonometric polynomials

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Efficient Groebner walk conversion for implicitization of geometric objects

Computer Aided Geometric Design

When does (T) equal sat(T)?

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Jacobi Quartic Curves Revisited

ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Faster Pairings on Special Weierstrass Curves

Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Faster group operations on elliptic curves

AISC '09 Proceedings of the Seventh Australasian Conference on Information Security - Volume 98
Toric forms of elliptic curves and their arithmetic

Journal of Symbolic Computation
When does equal sat(T)?

Journal of Symbolic Computation
Automated simplification of large symbolic expressions

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two algorithms for simplifying rational expressions modulo an ideal of the polynomial ring k[x1, . . . , xn]. The first method generates the set of equivalent expressions as amodule over k[x1, . . . , xn] and computes a reduced Gröbner basis. From this we obtain a canonical form for the expression up to our choice of monomial order for the ideal. The second method constructs equivalent expressions by solving systems of linear equations over k, and conducts a global search for an expression with minimal total degree. Depending on the ideal, the algorithms may or may not cancel all common divisors. We also provide some timings comparing the efficiency of the algorithms in Maple.