Some observations on familiar numbers

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Some observations on familiar numbers

Full text

Pdf (195 KB)

Source

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

Lille, France

Pages: 214 - 220

Year of Publication: 2002

ISBN:1-58113-484-3

Authors

Daniel Richardson	Bath University, Bath, UK
Simon Langley	University of the West of England, Bristol, UK

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 8, Citation Count: 1

Additional Information:

abstract 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/780506.780534 What is a DOI?

ABSTRACT

We look at complex numbers which are values of classical closed form expressions, and consider the relationship between the length of an expression and the number of decimal places needed to distinguish its absolute value from zero (if it is non-zero).

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	BAKER, A. Transcendental Number Theory. Cambridge University Press, 1975.
	2	BORWEIN, J. M., AND BORWEIN, P. B. Pi and the AGM. John Wiley, Canadian Mathematical Society, 1987.
	3	CHOW, T. Y. What is a closed-form number? American Mathematical Monthly 106, 5 (1999), 440-448.
	4	FERGUSON, H. R. P., BAILEY, D. H., AND ARNO, S. Analysis of pslq, an integer relation finding algorithm. Preprint. See www.nersc.gov/ dhb.
	5	LANG, S. Linear Algebra. Springer-Verlag, 1987.
	6	K. Mulmuley, A fast parallel algorithm to compute the rank of a matrix over an arbitrary field, Combinatorica, v.7 n.1, p.101-104, Jan. 1987 [doi>10.1007/BF02579205]
	7	NITAJ, A. La Conjecture abc. Enseign. Math 42 (1996), 3-24.
	8	PHILIPPON, P. Sur des hauteurs alternatives. Math Ann 289 (1991), 255-283.
	9	PHILIPPON, P. Quelques remarques sur des questions d'approximation Diophantine. Bull Austral. Math. Soc. 59, 2 (1999), 323-334.
	10	PHILIPPON, P. Addendum a quelques remarques sur des questions d'approximation Diophantine. Bull Austral. Math. Soc. 61, 1 (2000), 167-169.
	11	RICHARDSON, D. Testing the uniformity conjecture. www.bath.ac.uk/~masdr/testu.dvi, submitted for publication.
	12	RICHARDSON, D. Multiplicative independence of algebraic numbers and expressions. In Mega2000 conference, Bath (June 2000). also in Journal of Pure and Applied Algebra 164, 2001, pp 231-245, ISSN 0022-4049.
	13	Daniel Richardson, The Uniformity Conjecture, Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis, p.253-272, September 17-19, 2000
	14	SERT, A. Une version effective du theoreme de lindemann-weierstrass par les determinants d'interpolation. Journal of Number Theory 76 (1999), 94-119.
	15	SPRINKZHUK, V. G. Achievements and problems in diophantine approximation theory. Russian Mathematical Surveys 35, 4 (1980), 1-80.
	16	VAN DER HOEVEN, J. Zero-testing, witness conjectures and differential diophantine approximation. Preprint.
	17	VAN DER HOEVEN, J. Automatic Asymptotics. PhD thesis, Ecole Polytechnique, 1997.
	18	WALDSCHMIDT, M. Diophantine approximation on linear algebraic groups. No. 326 in Grundlehren der Mathematischen Wissenschaften. Springer-Verlag, 2000.
	19	WEGER, B. M. M. D. Solving exponential diophantine equations using lattice basis reduction algorithms. J. Number Theory 26 (1987), 325-367.