Explicit solutions to certain inf max problems from Turan power sum theory
2007 (English)In: Indagationes mathematicae, ISSN 0019-3577, Vol. 18, no 2, 189-194 p.Article in journal (Refereed) Published
In a previous paper  we proved that [GRAPHICS] when n + 1 is prime. In this paper we prove that [GRAPHICS] when n - 1 is a prime power, and [GRAPHICS] when n >= 3 is a prime power. 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.
Place, publisher, year, edition, pages
2007. Vol. 18, no 2, 189-194 p.
IdentifiersURN: urn:nbn:se:su:diva-55739DOI: 10.1016/S0019-3577(07)00009-2ISI: 000249741200003OAI: oai:DiVA.org:su-55739DiVA: diva2:406714
authorCount :12011-03-282011-03-282011-03-28Bibliographically approved