SearcharxivSearch

arXiv · 2609.14939

Weighted ergodic averages along subpolynomials in Hardy fields and applications

Abstract

We establish new pointwise convergence results for weighted ergodic averages along sequences of the form \( (\lfloor a(n) \rfloor)_{n \in \mathbb{N}}, \) where $a(x)$ is a subpolynomial function in a Hardy field. For example, we establish pointwise convergence of logarithmic averages along sequences of the form $(\lfloor n^k + \log^{c} n \rfloor)_{n \in \mathbb{N}}$, where $k \in \mathbb{N} \cup \{0\}$ and $c > 0$. This result should be juxtaposed with the fact that either for $k=0$ or for $k \geq 2$ and for sufficiently small $c>0$ (depending on $k$), the standard ergodic averages along these sequences fail to converge pointwise. We also obtain pointwise joint ergodicity results for multiple weighted ergodic averages along slow Hardy field functions. For example, it follows from our results that for $c> 0$ and for any $f, g \in L^{\infty} (λ)$, \begin{equation*} \lim_{N \rightarrow \infty} \frac{1}{\log N } \sum_{n=1}^{N} \frac{1}{n} f(T_b^{\lfloor \log^c n \rfloor}x) \, g(T_G^{\lfloor \log^c n \rfloor} x) = \int f \, d λ\cdot \int g \, d μ_G \quad \text{for almost every } x \in [0,1], \end{equation*} where $T_b:[0,1] \rightarrow [0,1]$ is the times-$b$ map defined by $T_b x = bx \, \bmod \, 1 $ and $T_G:[0,1] \rightarrow [0,1]$ is the Gauss map defined by $T_G(x) = \frac{1}{x} \bmod \, 1$ for $x \ne 0$ and $T_G (0) =0$. Here $λ$ is the Lebesgue measure on $[0,1]$ and $μ_G$ is the Gauss measure on $[0,1]$ given by $μ_G (A) = \frac{1}{ \log 2} \int_A \frac{1}{1+x} dx$ for any measurable set $A \subset [0,1]$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vitaly Bergelson, Sovanlal Mondal, Younghwan Son. 2026-09-14. Weighted ergodic averages along subpolynomials in Hardy fields and applications. https://arxiv.org/abs/2609.14939

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

KEEP EXPLORING

Related papers

Equidistribution of saddle periodic points for Hénon-like maps

We prove that under a natural assumption on the dynamical degrees, the saddle periodic points of a Hénon-like map in any dimension equidistribute with respect to the equilibrium measure. Our work is a generalization of the results of Bedford-Lyubich-Smillie, Dujardin, and Dinh-Sibony along with improvements of their techniques. We also investigate some fine properties of Green currents associated with the map.

math.DS

On dissonance and orthogonal projections of self-conformal measures

Let $μ$ be a self-conformal measure on $\mathbb{R}^d$. We establish conditions for $μ$ under which $\dim(μ*ν) = \min\lbrace d,\dimμ+\dimν\rbrace$ holds when $ν$ is any Ahlfors-regular or self-conformal measure on $\mathbb{R}^d$. Our main result states the following sufficient condition: $μ$ is totally non-linear and not supported on a smooth hypersurface. We also establish sufficient (likely non-sharp) algebraic conditions for self-conformal measures which are not totally non-linear. In addition, we show that $\dim μ\circπ^{-1} = \min\{ k, \dim μ\}$ for every ortohogonal projection $π:\mathbb{R}^d\to\mathbb{R}^k$, $0<k<d$, when either $d=2$ and $μ$ is not self-similar and not supported on a line, or $d\geq 3$ and $μ$ is totally non-linear and not supported on a smooth hypersurface.

math.DS

Equation-Free Screening of Mittag-Leffler-Compatible Dynamics from Scalar Time Series via kNN Multi-Horizon Profiles

Fractional models provide a natural description of systems with memory, but a noninteger derivative should not be introduced solely because a time series is curved or slowly relaxing. We develop an equation-free preliminary screening framework that asks whether a scalar time series produces a multi-horizon k-nearest-neighbor (kNN) profile more compatible with Mittag-Leffler-type behavior than with selected conventional alternatives. In an ideal matched Caputo-relaxation benchmark, the complete generation-kNN-profile-model-comparison pipeline reproduces the expected Mittag-Leffler geometry and recovers the generating order to within approximately $10^{-3}$; this is interpreted as controlled calibration rather than as general fractional-order identification. Under 3% trajectory-specific observational noise, the held-out Mittag-Leffler preference is most consistent when the generating dynamics are well separated from the integer-order limit and becomes progressively less decisive as $α\rightarrow1$. The fitted order $α_{\mathrm{fit}}$, however, shows substantially larger realization-to-realization variability. Thus, relative model compatibility is more robust than single-realization order estimation in the present noisy benchmark. Noise-free nonfractional controls show a separate limitation of specificity: a stretched exponential can generate a strongly Mittag-Leffler-compatible profile, whereas inclusion of the generating rational/Hill family recovers that family and its parameters to numerical precision in the matched setting. A positive Mittag-Leffler-versus-exponential screen therefore does not uniquely establish fractional origin. A fractional chaotic system is treated only as an exploratory extension: the Mittag-Leffler growth family gives lower finite-window RMSE than exponential and logistic/saturating alternatives over the detected pre-transition interval.

math.DS