Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Asymptotics of the minimum values of Riesz and logarithmic potentials generated by greedy energy sequences on the unit circle (2105.10817v3)

Published 22 May 2021 in math.CA

Abstract: In this work we investigate greedy energy sequences on the unit circle for the logarithmic and Riesz potentials. By definition, if $(a_n){n=0}{\infty}$ is a greedy $s$-energy sequence on the unit circle, the Riesz potential $U{N,s}(x):=\sum_{k=0}{N-1}|a_k-x|{-s}$, $s>0$, generated by the first $N$ points of the sequence attains its minimum value at the point $a_{N}$, for every $N\geq 1$. In the case $s=0$ we minimize instead the logarithmic potential $U_{N,0}(x):=-\sum_{k=0}{N-1}\log |a_{k}-x|$. We analyze the asymptotic properties of these extremal values $U_{N,s}(a_N)$, studying separately the cases $s=0$, $0<s\<1$, $s=1$, and $s\>1$. We obtain second-order asymptotic formulas for $U_{N,s}(a_N)$ in the cases $s=0$, $0<s\<1$, and $s=1$ (the corresponding first-order formulas are well known). A first-order result for $s\>1$ is proved, and it is shown that the normalized sequence $U_{N,s}(a_N)/Ns$ is bounded and divergent in this case. We also consider, briefly, greedy energy sequences in which the minimization condition is required starting from the point $a_{p+1}$ (instead of the point $a_{1}$ as previously stated), for some $p\geq 1$. For this more general class of greedy sequences, we prove a first-order asymptotic result for $0\leq s<1$.

Summary

We haven't generated a summary for this paper yet.