Lower bounds in some power sum problems
Abstract
We study the power sum problem maxv=1,...,m | sumk=1n zkv | and by using features of Fejer kernels we give new lower bounds in the case of unimodular complex numbers zk and m cn2 for constants c>1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.