A minimax problem for sums of translates on the torus

Minimax problems in mathematical programming (90C47) Convexity of real functions in one variable, generalizations (26A51) Trigonometric polynomials, inequalities, extremal problems (42A05) Existence of solutions for minimax problems (49J35)

Abstract: We investigate an extension of an equilibrium-type result, conjectured by Ambrus, Ball and Erd'elyi, and proved recently by Hardin, Kendall and Saff. These results were formulated on the torus, hence we also work on the torus, but one of the main motivations for our extension comes from an analogous setup on the unit interval, investigated earlier by Fenton. Basically, the problem is a minimax one, i.e. to minimize the maximum of a function

F

, defined as the sum of arbitrary translates of certain fixed "kernel functions", minimization understood with respect to the translates. If these kernels are assumed to be concave, having certain singularities or cusps at zero, then translates by

y_{j}

will have singularities at

y_{j}

(while in between these nodes the sum function still behaves realtively regularly). So one can consider the maxima

m_{i}

on each subintervals between the nodes

y_{j}

, and look for the minimization of

m a x F = m a x_{i} m_{i}

. Here also a dual question of maximization of

m i n_{i} m_{i}

arises. This type of minimax problems were treated under some additional assumptions on the kernels. Also the problem is normalized so that

y_{0} = 0

. In particular, Hardin, Kendall and Saff assumed that we have one single kernel

K

on the torus or circle, and

F = s u m_{j = 0}^{n} K (c d o t - y_{j}) = K + s u m_{j = 1}^{n} K (c d o t - y_{j})

. Fenton considered situations on the interval with two fixed kernels

J

and

K

, also satisfying additional assumptions, and

F = J + s u m_{j = 1}^{n} K (c d o t - y_{j})

. Here we consider the situation (on the circle) when emph{all the kernel functions can be different}, and

F = s u m_{j = 0}^{n} K_{j} (c d o t - y_{j}) = K_{0} + s u m_{j = 1}^{n} K_{j} (c d o t - y_{j})

. Also an emphasis is put on relaxing all other technical assumptions and give alternative, rather minimal variants of the set of conditions on the kernel.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: A minimax problem for sums of translates on the torus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642702)