A one-sided power sum inequality

Details A one-sided power sum inequality A one-sided power sum inequality

2011-07-27

arxiv.org/abs/1107.5495v2

Mathematics

Number Theory

9 pages, submitted to Indagationes Mathematicae

Scientific paper

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_j^k \leq - 1. $$ If, moreover, none of the numbers $z_j$ is a root of unity, then $$\inf_{k} \sum_{j=1}^n z_j^k \leq - \frac {2} {\pi^3} \log n. $$ 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_j^k$ obtained in this paper.

Affiliated with

Also associated with

No associations

Rating

A one-sided power sum inequality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A one-sided power sum inequality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A one-sided power sum inequality will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-113442