Search arXivSearch

arXiv · 2306.16411

Expansions and Characterizations of Sieved Random Walk Polynomials

Abstract

We consider random walk polynomial sequences $(P_n(x))_{n\in\mathbb{N}_0}\subseteq\mathbb{R}[x]$ given by recurrence relations $P_0(x)=1$, $P_1(x)=x$, $x P_n(x)=(1-c_n)P_{n+1}(x)+c_n P_{n-1}(x),$ $n\in\mathbb{N}$ with $(c_n)_{n\in\mathbb{N}}\subseteq(0,1)$. For every $k\in\mathbb{N}$, the $k$-sieved polynomials $(P_n(x;k))_{n\in\mathbb{N}_0}$ arise from the recurrence coefficients $c(n;k):=c_{n/k}$ if $k|n$ and $c(n;k):=1/2$ otherwise. A main objective of this paper is to study expansions in the Chebyshev basis $\{T_n(x)\colon n\in\mathbb{N}_0\}$. As an application, we obtain explicit expansions for the sieved ultraspherical polynomials. Moreover, we introduce and study a sieved version $\mathrm{D}_k$ of the Askey-Wilson operator $\mathcal{D}_q$. It is motivated by the sieved ultraspherical polynomials, a generalization of the classical derivative and obtained from $\mathcal{D}_q$ by letting $q$ approach a $k$-th root of unity. However, for $k\geq2$ the new operator $\mathrm{D}_k$ on $\mathbb{R}[x]$ has an infinite-dimensional kernel (in contrast to its ancestor), which leads to additional degrees of freedom and characterization results for $k$-sieved random walk polynomials. Similar characterizations are obtained for a sieved averaging operator $\mathrm{A}_k$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefan Kahler. 2023-12-22. Expansions and Characterizations of Sieved Random Walk Polynomials. https://doi.org/10.3842/sigma.2023.103

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the prime field spherical restriction conjecture in four dimensions: breaking the Stein-Tomas exponent and applications

Let $p$ be an odd prime. We prove the extension estimate $R_{S_j}^*(2\to r)\lesssim_r 1$ for every nonzero-radius sphere $S_j\subseteq\mathbb{F}_p^4$ and every $r\geq \, 34/11$, uniformly in $p$ and $j$. This improves the Stein--Tomas exponent $10/3$ established by Iosevich and Koh (2008). We also formulate a localized spherical restriction/extension conjecture that predicts the sharp dependence of the restriction norm on the size of the physical support. This conjecture implies the spherical extension estimates $R_{S_j}^*(2\to r)\lesssim_r 1$ for every $r>3$, and yields almost-every-pin distance estimates at the conjectured Erdős--Falconer exponent in four dimensions, up to an arbitrarily small power loss in the set-size hypothesis. Using the same method, we improve the bounds supplied by Fourier decay and Plancherel at intermediate support scales and derive new almost-every-pin distance estimates in $\mathbb{F}_p^4$.

math.CA

Dimension-free estimates for discrete maximal functions over cubes in $\mathbb Z^d$

In this short note, we establish dimension-free $\ell^p(\mathbb Z^d)$ bounds, for all $p\in(1,\infty]$, for the discrete Hardy--Littlewood maximal functions associated with cubes in $\mathbb Z^d$, answering a question that had been open for a while. The key idea is to prove dimension-free bounds for the $\ell^p(\mathbb Z^d)$ norms of the differences of the corresponding averages. This follows from an ad hoc interpretation of the associated discrete multipliers as a special continuous family of multipliers to which basic fractional integration and complex interpolation can be applied. The same method also yields an elementary proof of Bourgain's dimension-free $L^p(\mathbb R^d)$ bounds for the Hardy--Littlewood maximal function associated with cubes in $\mathbb R^d$.

math.CA

Establishing the Polynomial Wolff Axioms for $δ$-Separated $δ$-Tubes With #o-minimality

We establish the full version of a conjecture of Guth and Zahl, giving a lower bound for the volume of a semialgebraic set that has a large intersection with a collection of $δ$-separated $δ$-tubes. Our proof uses o-minimal methods to simplify the proof of Katz and Rogers, who proved the conjecture up to a small factor. We also establish that the constants depend polynomially on the complexity of the semialgebraic set, and more generally in the #o-minimal setting.

math.CA