The identity problem for elementary functions and constants

Authors:
Dan Richardson;John Fitch
Affiliations:
School of Mathematical Sciences, University of Bath, Bath, UK;School of Mathematical Sciences, University of Bath, Bath, UK
Venue:
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Year:
1994

Citing 5
Cited 0

A modification of the LLL reduction algorithm

Journal of Symbolic Computation
A differential-equations approach to functional equivalence

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
The elementary constant problem

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
A zero structure theorem for exponential polynomials

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
On Canonical Forms and Simplification

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A solution for a version of the identify problem is proposed for a class of functions including the elementary functions. Given f(x), g(x), defined at some point &bgr; we decide whether or not f(x) = g(x) in some neighbourhood of &bgr;. This problem is first reduced to a problem about zero equivalence of elementary constants. Then a semi algorithm is given to solve the elementary constant problem. This semi algorithm is guaranteed to give the correct answer whenever it terminates, and it terminates unless the problem being considered contains a counterexample to Schanuel's conjecture.