2000 character limit reached
A one-sided power sum inequality (1107.5495v3)
Published 27 Jul 2011 in math.NT
Abstract: In this note we prove results of the following types. Let be given distinct complex numbers $z_j$ satisfying the conditions $|z_j| = 1, z_j \not= 1$ for $j=1,..., n$ and for every $z_j$ there exists an $ i$ such that $z_i = \bar{z_j}. $ Then $$\inf_{k} \sum_{j=1}n z_jk \leq - 1. $$ If, moreover, none of the numbers $z_j$ is a root of unity, then $$\inf_{k} \sum_{j=1}n z_jk \leq - \frac {2} {\pi3} \log n. $$ The constant -1 in the former result is the best possible. The above results are special cases of upper bounds for $\inf_{k} \sum_{j=1}n b_jz_jk$ obtained in this paper.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.