A simplified method of recognizing zero among elementary constants

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A simplified method of recognizing zero among elementary constants

Full text

Pdf (657 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1995 international symposium on Symbolic and algebraic computation table of contents

Montreal, Quebec, Canada

Pages: 104 - 109

Year of Publication: 1995

ISBN:0-89791-699-9

Author

Daniel Richardson

Department of Mathematics, University of Bath, Bath BA2, England

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 12, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/220346.220360 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	B. F. Caviness, On Canonical Forms and Simplification, Journal of the ACM (JACM), v.17 n.2, p.385-396, April 1970 [doi>10.1145/321574.321591]
	2	D. Richardson, Some undecidable problems involving elementary functions of a real variable, Journal of Symbolic Logic, 1968, pp 514-520
	3	J. Ax, Schanuel's Conjecture, Ann Math 93 (1971), 252- 68
	4	A. Baker, Transcendental Number Theory, Cambridge University Press, 1975
	5	B. F. Caviness , M. J. Prelle, A note on algebraic independence of logarithmic and exponential constants, ACM SIGSAM Bulletin, v.12 n.2, p.18-20, May 1978 [doi>10.1145/1088261.1088265]
	6	Cronin, J., Fixed Points and Topological Degree in Nonlinear Analysis, American Mathematical Society, 1964
	7	Ferguson, H.R.P., and R.W. Forcade, Multidimensional Euclidean Algorithms, J. Reine Ange. Math. 33, (1982), pp 171-181
	8	N. C. Lloyd, Degree Theory, Cambridge University Press, 1978
	9	J Hastad , B Helfrich , J Lagarias , C P Schnorr, Polynomial time algorithms for finding integer relations among real numbers, 3rd annual symposium on theoretical aspects of computer science on STACS 86, p.105-118, January 1986, Orsay, France
	10	A. G. Khovanskii, Fewnomials, AMS Translation Mathematical monographs; v 88, AMS, Providence, RI, 1991. (Russian Original: Malochleny, Moscow 1987).
	11	A.K. Lenstra, H. W. Lenstra, L. Lovasz, Factoring Polynomials with rational coefficients. Math Ann 261, pp 513- 534
	12	T. Leinekugel, Etre ou ne pas etre zero, report on work done at Bath University in summer 1994
	13	A.J. Macintyre and A.J. Wilkie, On the decidability of the real exponential field, preprint, Mathematical Institute, Oxford.
	14	Maurice Mignotte, Mathematics for computer algebra, Springer-Verlag New York, Inc., New York, NY, 1992
	15	M. Pohst, A modification of the LLL reduction algorithm, Journal of Symbolic Computation, v.4 n.1, p.123-127, August 1987 [doi>10.1016/S0747-7171(87)80061-5]
	16	P. Rabinowitz (Ed), Numerical Methods for Nonlinear Algebraic Equations, Gordon and Breach, 1970
	17	D. Richardson, Finding roots of equations involving solutions of first order algebraic differential equations, pp 427- 440 in Effective Methods in Algebraic Geometry, (Teo Mora and Carlo Traverso Eds), Birkhauser 1991
	18	Daniel Richardson, Computing the topology of a bounded non algebraic curve in the plane, Journal of Symbolic Computation, v.14 n.6, p.619-643, Dec. 1992
	19	Daniel Richardson, The elementary constant problem, Papers from the international symposium on Symbolic and algebraic computation, p.108-116, July 27-29, 1992, Berkeley, California, United States [doi>10.1145/143242.143284]
	20	Daniel Richardson, A zero structure theorem for exponential polynomials, Proceedings of the 1993 international symposium on Symbolic and algebraic computation, p.144-151, July 06-08, 1993, Kiev, Ukraine [doi>10.1145/164081.164110]
	21	D. Richardson and J. P. Fitch, Simplification of Elementary Constants and Functions, ISSAC '94
	22	M. Rosenlicht, On Liouville's Theory of Elementary Functions, Pacific Journal of Mathematics, voI 65, no 2, 1976, pp 485-492
	23	B. Salvy, Asymptotique Automatique et Fonctions G~nratrices, Thesis, Ecole Polytechnique, 1991
	24	J. Shackell, Zero-Equivalence in function fields defined by algebraic differential equations, Trans. of the AMS, vol 336, Number 1, pp 151-171, 1993
	25	J. Shackle, A differential-equations approach to functional equivalence, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, p.7-10, July 17-19, 1989, Portland, Oregon, United States [doi>10.1145/74540.74542]
	26	N. N. Vorobjov, Deciding consistency of systems of polynomial in exponent inequalities in subexponential time, Proceedings of MEGA 90, 1990.
	27	S.C. Chou, W. F. Schelter, and J. G. Yang, Characteristic Sets and GrSbner Bases in Geometry Theorem Proving, Draft, Institute for Computing Science, The University of Texas, Austin, TX 78712
	28	W. T. Wu, Basic Principles of Mechanical Theorem Proving in Elementary Geometries, J. Sys. Sci. and Math. Scis, f(3), 1984, 207-235

CITED BY 2

	Daniel Richardson, Solution of elementary systems of equations in a box in Rn, Proceedings of the 1996 international symposium on Symbolic and algebraic computation, p.120-126, July 24-26, 1996, Zurich, Switzerland
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003