On the solutions to a power sum problem

Details On the solutions to a power sum problem On the solutions to a power sum problem

2006-09-21

arxiv.org/abs/math/0609621v2

Mathematics

Number Theory

6 pages, v2: Minor changes. Typos fixed

Scientific paper

In a recent paper we proved that if (*)=\inf_{|z_k|=1}\max_{v=1,...,n^2-n} |\sum_{k=1}^n z_k^v|, then (*)=\sqrt{n-1} if n-1 is a prime power. We proved that a construction of Fabrykowski gives minimal systems (z_1,...,z_n) to this problem. The construction depends on the existence of perfect difference sets of order n-1. As an open problem we asked whether all solutions would arise from this construction. In this paper we show that this is true and in fact if there exist no perfect difference set of order n-1 (which by the prime power conjecture is true if n-1 is not a prime power), then we have the strict inequality (*)>\sqrt{n-1}.

Affiliated with

Also associated with

No associations

Rating

On the solutions to a power sum problem 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 On the solutions to a power sum problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the solutions to a power sum problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-135532