Lower bounds in some power sum problems
classification
🧮 math.NT
keywords
boundslowerpowercasecomplexconstantsfeaturesfejer
read the original abstract
We study the power sum problem max_{v=1,...,m} | sum_{k=1}^n z_k^v | and by using features of Fejer kernels we give new lower bounds in the case of unimodular complex numbers z_k and m cn^2 for constants c>1.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.