Abstract
We make two remarks on linear forms over \({\cal Z}\) in complex roots of unity. First we show that a Liouville type lower bound on the absolute value of a nonvanishing form can be derived from the time complexity upper bound on Tarski algbera. Second we exhibit an efficient randomized algorithm for deciding whether a given form vanishes. In the special case where the periods of the roots of unity are mutually coprime, we can eliminate randomization. This efficiency is surprising given the doubly exponential smallness of the Liouville bound.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balcazar, J.L., Diaz, J., Gabarro, J.: Structural Complexity. Springer, Heidelberg (1988)
Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Heidelberg (2003)
Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers. Oxford Press, USA (1979)
Lang, S.: Algebra. Addison-Wesley, Reading (1965)
Samuel, P.: Algebraic Theory of Numbers. Hermann (1970)
Tarski, A.: Sur les ensembles définissables de nombres réels. Fundamenta Mathematicae 17, 210–239 (1931)
Tarski, A.: A decision method for elementary algebra and geometry. Technical report, Rand Corp. (1948)
Waldschmidt, M.: Linear independence of logarithms of algebraic numbers. Technical Report IMSc 116, Inst. of Math. Science, Madras (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Litow, B. (2010). On Sums of Roots of Unity. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-14165-2_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14164-5
Online ISBN: 978-3-642-14165-2
eBook Packages: Computer ScienceComputer Science (R0)