On sums of roots of unity
Litow, B. (2010) On sums of roots of unity. Lecture Notes in Computer Science, 6198 . pp. 420-425.
|PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
View at Publisher Website: http://www.springer.com/computer/theoret...
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.
|Item Type:||Article (Refereed Research - C1)|
From the proceedings of 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Part I
|FoR Codes:||08 INFORMATION AND COMPUTING SCIENCES > 0802 Computation Theory and Mathematics > 080201 Analysis of Algorithms and Complexity @ 100%|
|SEO Codes:||89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 100%|
|Deposited On:||19 Aug 2010 09:27|
|Last Modified:||18 Oct 2013 01:04|
Last 12 Months: 0
|Citation Counts with External Providers:|
Repository Staff Only: item control page