Explicit solutions to certain inf max problems from Turan power sum theory

Details Explicit solutions to certain inf max problems from Turan power sum theory Explicit solutions to certain inf max problems from Turan power sum theory

2006-07-10

arxiv.org/abs/math/0607238v2

Mathematics

Number Theory

v1: 8 pages; v2: 7 pages. Minor changes. Exposition improved. To appear in Indagationes Mathematicae

Scientific paper

Let s_v denote the pure power sum \sum_{k=1}^n z_k^v. In a previous paper we proved that \sqrt n <= \inf_{|z_k| => 1} \max_{v=1,...,n^2} |s_v| <= \sqrt{n+1} when n+1 is prime. In this paper we prove that \inf_{|z_k| = 1} \max_{v=1,...,n^2-n} |s_v| = \sqrt{n-1} when n-1 is a prime power, and if 2 <= i <= n-1 and n => 3 is a prime power then \inf_{|z_k| => 1} \max_{v=1,...,n^2-i} |s_v| =\sqrt n. We give explicit constructions of n-tuples (z_1,...,z_n) which we prove are global minima for these problems. These are two of the few times in Turan power sum theory where solutions in the inf max problem can be explicitly calculated.

Affiliated with

Also associated with

No associations

Rating

Explicit solutions to certain inf max problems from Turan power sum theory 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 Explicit solutions to certain inf max problems from Turan power sum theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Explicit solutions to certain inf max problems from Turan power sum theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-152368