SearcharxivSearch

arXiv subjects

Sovanlal Mondal

Publications and source records attributed to Sovanlal Mondal.

6 recordsLinked to original sources

Weighted ergodic averages along subpolynomials in Hardy fields and applications

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]$.

math.DS

Ergodic averages for commutative transformations along return times

In this paper, we extend recent results on the convergence of ergodic averages along sequences generated by return times to shrinking targets in rapidly mixing systems, partially answering questions posed by the first author, Maass and the third author. In particular, for a fixed parameter $a\in (0,1)$ and for generic $y\in [0,1]$, we establish both $L^2$ and pointwise convergence for single averages and multiple averages for commuting transformations along the sequences $(a_n(y))_{n\in \mathbb{N}}$, obtained by arranging the set $$\Big\{n\in\mathbb{N}: 0<2^ny \mod{1}<n^{-a} \Big\}$$ in an increasing order. We also obtain new results for semi-random ergodic averages along sequences of similar type.

math.DS

Fluctuation of ergodic averages and other stochastic processes

For an ergodic map $T$ and a non-constant, real-valued $f \in L^1$, the ergodic averages $\mathbb{A}_N f(x) = \frac{1} {N} \sum_{n=1}^N f(T^n x)$ converge a.e., but the convergence is never monotone. Depending on particular properties of the function $f$, the averages $\mathbb{A}_N f(x)$ may or may not actually fluctuate around the mean value infinitely often a.e. We will prove that a.e. fluctuation around the mean is the generic behavior. That is, for a fixed ergodic $T$, the generic non-constant $f\in L^1$ has the averages $\mathbb{A}_N f(x)$ fluctuating around the mean infinitely often for almost every $x$. We also consider fluctuation for other stochastic processes like subsequences of the ergodic averages, convolution operators, weighted averages, uniform distribution and martingales. We will show that in general, in these settings fluctuation around the limit infinitely often persists as the generic behavior.

math.DS

Ergodic averages along sequences of slow growth

We consider pointwise convergence of weighted ergodic averages along the sequence $Ω(n)$, where $Ω(n)$ denotes the number of prime factors of $n$ counted with multiplicities. It was previously shown that $Ω(n)$ satisfies the strong sweeping out property, implying that a pointwise ergodic theorem does not hold for $Ω(n)$. We further classify the strength of non-convergence exhibited by $Ω(n)$ by verifying a double-logarithmic pointwise ergodic theorem along $Ω(n)$. In particular, this demonstrates that $Ω(n)$ is not inherently strong sweeping out. We also show that the strong sweeping out property for slow growing sequences persists under certain perturbations, yielding natural new examples of sequences with the strong sweeping out property.

math.DS

Sublacunary sequences that are strong sweeping out

An increasing sequence $(a_n)$ of positive integers which satisfies $\frac{a_{n+1}}{a_n}>1+η$ for some positive $η$ is called a lacunary sequence. It has been known for over twenty years that every lacunary sequence is strong sweeping out which means that in every aperiodic dynamical system we can find a set $E$ of arbitrary small measure so that $\limsup_N\frac{1}{N} \sum_{n\le N}\mathbb{1}_E(T^nx)=1$ and $\liminf_N\frac{1}{N} \sum_{n\le N}\mathbb{1}_E(T^nx)=0$ almost everywhere. In this paper we improve this result by showing that if $(a_n)$ satisfies only $\frac{a_{n+1}}{a_n}>1+\frac1{(\log\log n)^{1-η}}$ for some positive $η$ then it is already strong sweeping out.

math.DS

Grid method for divergence of averages

In this paper, we will introduce the `grid method' to prove that the extreme case of oscillation occurs for the averages obtained by sampling a flow along the sequence of times of the form $\{n^α: n\in \mathbb{N}\}$, where $α$ is a positive non-integer rational number. Such behavior of a sequence is known as the `strong sweeping out property'. By using the same method, we will give an example of a general class of sequences which satisfy the `strong sweeping out' property. This class of sequences may be useful to solve the longstanding open problem: for a given irrational $α$, whether the sequence $(n^α)$ is `pointwise bad' for $L^p$ or not. In the process of proving these results, we will prove a continuous version of the Conze principle.

math.DS