Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Fourier coefficients of powers of a Blaschke factor and strongly annular fonctions

Published 1 Jul 2021 in math.CV | (2107.00405v1)

Abstract: We compute asymptotic formulas for the $k{\rm th}$ Fourier coefficients of $b_\lambdan$, where $b_\lambda(z)=\frac{z-\lambda}{1-\lambda z}$ is the Blaschke factor associated to $\lambda\in\mathbb{D}$, $k\in[0,\infty)$ and $n$ is a large integer. We distinguish several regions of different asymptotic behavior of those coefficients in terms of $k$ and $n$. Given $\beta\in((1-\lambda)/(1+\lambda),(1+\lambda)/(1-\lambda))$ their decay is oscillatory for $k\in[\beta n,n/\beta]$. Given $\alpha\in(0,(1-\lambda)/(1+\lambda))$ their decay is exponential for $k\in[0,n\alpha]\cup[n/\alpha,\infty).$ Airy-type behavior is happening near the $k$-transition points $n(1-\lambda)/(1+\lambda)$ and $n(1+\lambda)/(1-\lambda)$. The asymptotic formulas for the $k{\rm th}$ Fourier coefficients of $b_{\lambda}{n}$ are derived using standard tools of asymptotic analysis of Laplace-type integrals. More precisely, the integral defining the $k{\rm th}$ Fourier coefficient of $b_\lambdan$ is perfectly suited for an application of the method of stationary phase when $k\in\left(n(1-\lambda)/(1+\lambda),n(1+\lambda)/(1-\lambda)\right)$ and requires the use of the method of the steepest descent when $k\notin[n(1-\lambda)/(1+\lambda),n(1+\lambda)/(1-\lambda)]$. Uniform versions of those standard methods are required when $k$ approaches one of the boundaries $n(1-\lambda)/(1+\lambda),$ $n(1+\lambda)/(1-\lambda)$. As an application, we construct strongly annular functions with Taylor coefficients satisfying sharp summation properties.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.