Finding roots of unity among quotients of the roots of an integral polynomial

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Finding roots of unity among quotients of the roots of an integral polynomial

Full text

Pdf (479 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: 85 - 89

Year of Publication: 1995

ISBN:0-89791-699-9

Authors

Kazuhiro Yokoyama	Research Institute for Symbolic Computation, Johannes Kepler University, A-4040 Linz, Austria and ISIS, Fujitsu Laboratories Limited, 140 Miyamoto, Numazu-shi, Shizuoka 410-03, Japan
Ziming Li	Research Institute for Symbolic Computation, Johannes Kepler University, A-4040 Linz, Austria
István Nemes	Research Institute for Symbolic Computation, Johannes Kepler University, A-4040 Linz, Austria

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): 3, Downloads (12 Months): 9, Citation Count: 0

Additional Information:

references 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.220357 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	Berstel J., Mignotte M.; Deux propri6t~s d~cidables des suites r6currentes lin~aires, Bull. Soc. Math. France 104 (1976), 175-184.
	2	Russell J. Bradford , James H. Davenport, Effective Tests for Cyclotonic Polynomials, Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation, p.244-251, July 04-08, 1988
	3	Ge G.; Algorithms related to multiplicative representations of algebraic numbers, Ph.D. thesis, University of California, 1993.
	4	Goldstein A.j., Graham R.L.; Problem 73-17, SIAM Review 16 (1974), 394-395.
	5	Hecke E.; Lectures on the theory of algebraic numbers, Springer-Verlag, New York, 1981.
	6	Masayuki Noro , Taku Takeshima, Risa/Asir—a computer algebra system, Papers from the international symposium on Symbolic and algebraic computation, p.387-396, July 27-29, 1992, Berkeley, California, United States [doi>10.1145/143242.143362]
	7	Robba, Ph.; Z6ros de suites r~currentes lin~aires, Groupe d'Etude d'Analyse Ultramdtrique, 5e annde (1977/78) Exp. No. 13.
	8	Wielandt, H.; Finite permutation groups, Academic Press, New York, 1964.