A minimax problem for sums of translates on the torus

DOI10.1112/TLM3.12010zbMATH Open1391.49007arXiv1512.09169OpenAlexW3102759098WikidataQ129078866 ScholiaQ129078866MaRDI QIDQ4642702FDOQ4642702

Authors: Bálint Farkas, Béla Nagy, Szilárd Gy. Révész 

Publication date: 25 May 2018

Published in: Transactions of the London Mathematical Society (Search for Journal in Brave)

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 $maxF=ma{x}_i{m}_i$. Here also a dual question of maximization of $mi{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=su{m}_{j=0}^{n}K(cdot-y_j)=K+su{m}_{j=1}^{n}K(cdot-y_j)$. Fenton considered situations on the interval with two fixed kernels $J$ and $K$, also satisfying additional assumptions, and $F=J+su{m}_{j=1}^{n}K(cdot-y_j)$. Here we consider the situation (on the circle) when emph{all the kernel functions can be different}, and $F=su{m}_{j=0}^n{K}_j(cdot-y_j)=K_0+su{m}_{j=1}^n{K}_j(cdot-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.

Full work available at URL: https://arxiv.org/abs/1512.09169

Recommendations

• On the existence of min-max minimal torus
• A min-max theorem for sums of translates of a function
• Minimal solutions of variational problems on a torus
• Minimax theorems and saddling transformations
• Maximisers for Strichartz inequalities on the torus
• Minoration of the complexity function associated to a translation on the torus
• scientific article; zbMATH DE number 975548
• Minimax problems on Grassmann manifolds. Sums of eigenvalues
• Almost optimal estimates for best approximation by translates on a torus
• On the \(L_p\) torsional Minkowski problem for \(0 < p < 1\)

zbMATH Keywords

torusminimax problem

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm
• Proof of the conjectures of Bernstein and Erdős concerning the optimal nodes for polynomial interpolation
• Title not available (Why is that?)
• Optimization of the norm of the Lagrange interpolation operator
• Title not available (Why is that?)
• Iterative Solution of Nonlinear Equations in Several Variables
• Polarization optimality of equally spaced points on the circle for discrete potentials
• Riesz polarization inequalities in higher dimensions
• Chebyshev constants for the unit circle
• Where does the sup norm of a weighted polynomial live? (A generalization of incomplete polynomials)
• Natural Operations on Differential Forms
• Global and fine approximation of convex functions
• A generalization of Chebyshev polynomials
• On a problem of the best approximation
• Some remarks on polynomials
• Characterization of polynomials by means of their stationary values
• Probability, minimax approximation, and Nash-equilibrium. Estimating the parameter of a biased coin
• A minimax problem admitting the equioscillation characterization of Bernstein and Erdös
• A min-max theorem for sums of translates of a function
• INVERSE BERNSTEIN INEQUALITIES AND MIN–MAX–MIN PROBLEMS ON THE UNIT CIRCLE
• Turan's Inequalities for Trigonometric Polynomials
• Title not available (Why is that?)

Cited In (6)

• Polarization problem on a higher-dimensional sphere for a simplex
• A homeomorphism theorem for sums of translates
• On the weighted Bojanov-Chebyshev problem and Fenton's sum of translates method;О весовой задаче Боянова-Чебышeва и методе Фентона для сумм сдвигов функций
• Unconstrained polarization (Chebyshev) problems: basic properties and Riesz kernel asymptotics
• Minoration of the complexity function associated to a translation on the torus
• Polarization, sign sequences and isotropic vector systems

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)