Using basis computation to determine pseudo-multiplicative independence

Authors:
H. I. Epstein
Affiliations:
-
Venue:
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Year:
1976

Citing 5
Cited 2

On the Problem of Recognizing Zero

Journal of the ACM (JACM)
The Exact Solution of Systems of Linear Equations with Polynomial Coefficients

Journal of the ACM (JACM)
ESSAYS IN ALGEBRAIC SIMPLIFICATION

ESSAYS IN ALGEBRAIC SIMPLIFICATION
Algorithms for elementary transcendental function arithmetic.

Algorithms for elementary transcendental function arithmetic.
Quantifier elimination for real closed fields by cylindrical algebraic decomposition--preliminary report

ACM SIGSAM Bulletin

Factor refinement

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Simplification of radical expressions

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a procedure for determining when a set of rational functions are pseudo-multiplicatively independent, i.e. when no non-trivial power product of the rational functions can be a constant. The method used is to derive a multiplicative basis of factors of the numerators and denominators of the rational functions; the basis is then used to derive a system of homogeneous linear equations which will have a non-trivial solution if and only if the rational functions are pseudo-multiplicatively dependent. Algorithms which find a basis for a set of Gaussian rational functions and the corresponding linear equations are presented in detail and bounds on their theoretical computing times are derived.