On sums of roots of unity

0Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We make two remarks on linear forms over 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. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Litow, B. (2010). On sums of roots of unity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6198 LNCS, pp. 420–425). https://doi.org/10.1007/978-3-642-14165-2_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free