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

2006/07/10 by Andersson, Johan
#11N30 #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.math/0607238

Abstract

Let s_v denote the pure power sum ∑_k=1ⁿ z_k^v. In a previous paper we proved that √ n <= inf_{|zk| => 1} max_v=1,...,n² |s_v| <= √(n+1) when n+1 is prime. In this paper we prove that inf_{|zk| = 1} max_{v=1,...,n²-n} |s_v| = √(n-1) when n-1 is a prime power, and if 2 <= i <= n-1 and n => 3 is a prime power then inf_{|zk| => 1} max_{v=1,...,n²-i} |s_v| =√ n. We give explicit constructions of n-tuples (z₁,...,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.

Related

• Turan's problem 10 revisited
• On some power sum problems of Montgomery and Turan
• On the solutions to a power sum problem
• Lower bounds in some power sum problems
• A sum-product estimate in fields of prime order