Search arXivSearch

arXiv · 2311.16928

Convergence of Time-Average along Uniformly Behaved in ${\mathbb N}$ Sequences on Every Point

Abstract

We define a uniformly behaved in ${\mathbb N}$ arithmetic sequence ${\bf a}$ and an ${\bf a}$-mean Lyapunov stable dynamical system $f$. We consider the time-average of a continuous function $ϕ$ along the ${\bf a}$-orbit of $f$ up to $N$. The main result we prove in the paper is that this partial time-average converges for every point in the space if ${\bf a}$ is uniformly behaved in ${\mathbb N}$ and $f$ is minimal and uniquely ergodic and ${\bf a}$-mean Lyapunov stable. In addition, if ${\bf a}$ is also completely additive, we then prove that the time-average of a continuous function $ϕ$ along the square-free ${\bf a}$-orbit of $f$ up to $N$ converges for every point in the space as well. All equicontinuous dynamical systems are ${\bf a}$-mean Lyapunov stable for any sequence ${\bf a}$. When ${\bf a}$ is a subsequence of ${\mathbb N}$ with positive lower density, we give two non-trivial examples of ${\bf a}$-mean Lyapunov stable dynamical systems. We give several examples of uniformly behaved in $\mathbb{N}$ sequences, including the counting function of the prime factors in natural numbers, the subsequence of natural numbers indexed by the Thue-Morse (or Rudin-Shapiro) sequence, and the sequence of even (or odd) prime factor natural numbers. We also show that the sequence of square-free natural numbers (or even (or odd) prime factor square-free natural numbers) is rotationally distributed in ${\mathbb N}$ but not uniformly distributed in ${\mathbb Z}$, thus not uniformly behaved in ${\mathbb N}$. We derive other consequences from the main result relevant to number theory and ergodic theory/dynamical systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yunping Jiang, Jessica Liu. 2024-08-30. Convergence of Time-Average along Uniformly Behaved in ${\mathbb N}$ Sequences on Every Point. https://arxiv.org/abs/2311.16928

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

KEEP EXPLORING

Related papers

On single-variable Witten zeta functions of rank two and three

By introducing a novel integration kernel for the Mellin transform, we uncover many previously unknown and intriguing properties of the Witten zeta functions of rank two and three. Detailed results concerning their pole locations, residues, and special values are obtained. We propose a non-trivial conjecture regarding their derivatives at the origin, which seems to encode deep information about the root system. We also discuss their behavior at negative integers, highlighting a connection with Eisenstein series and a $p$-adic observation.

math.NT

On graded Lie algebras associated to once-punctured elliptic curves with complex multiplication

We study a graded Lie algebra arising from the Galois action on the pro-$p$ fundamental group of a once-punctured elliptic curve with complex multiplication. Among other things, we provide a minimal generating set of the rationalized Lie algebra under suitable assumptions. The proof is based on a slight variant of the theory of weighted completion of profinite groups developed by Hain and Matsumoto.

math.NT

Burgess-type volume dependent bounds for character sums over $\mathbb{F}_{p^n}$

We establish a Burgess-type bound for short multiplicative character sums over finite fields $\mathbb{F}_{p^n}$. Let \[ B=\left\{\sum_{i=1}^{n}x_iω_i: N_i+1\le x_i\le N_i+H_i,1\le i\le n\right\}\subseteq\mathbb{F}_{p^n}, \] where $1\le H_i\le p$ for all $1\le i\le n$, and the side lengths satisfy $H_1\le H_2\le\cdots\le H_n.$ We prove that if the side lengths satisfy certain lower bounds in terms of the two largest side lengths, then a nontrivial cancellation occurs in the character sum over the boxes. This generalizes the work of Gabdullin \cite{GB} in dimensions $n=2,3$ to arbitrary dimension. This also generalizes the character sum estimate of Konyagin \cite{Kon} where each of the side lengths of the boxes are greater than $p^{1/4}$. The proof combines techniques from the geometry of numbers, multiplicative energy estimates, and Katz's bounds for multiplicative character sums.

math.NT