Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAveraging almost periodic functions along exponential sequences
88
0
0.0
(
0
)
Authors
Michael Baake
Ask ChatGPT about the research
No Arabic abstract
The goal of this expository article is a fairly self-contained account of some averaging processes of functions along sequences of the form $(alpha^n x)^{}_{ninmathbb{N}}$, where $alpha$ is a fixed real number with $| alpha | > 1$ and $xinmathbb{R}$ is arbitrary. Such sequences appear in a multitude of situations including the spectral theory of inflation systems in aperiodic order. Due to the connection with uniform distribution theory, the results will mostly be metric in nature, which means that they hold for Lebesgue-almost every $xinmathbb{R}$.
rate research
Read More
In this paper we prove the existence of asymptotic moments, and an estimate on the tails of the limiting distribution, for a specific class of almost periodic functions. Then we introduce the hyperbolic circle problem, proving an estimate on the asymptotic variance of the remainder that improves a result of Chamizo. Applying the results of the first part we prove the existence of limiting distribution and asymptotic moments for three functions that are integrat
In this paper, we study almost periodic solutions for semilinear stochastic differential equations driven by L{e}vy noise with exponential dichotomy property. Under suitable conditions on the coefficients, we obtain the existence and uniqueness of bounded solutions. Furthermore, this unique bounded solution is almost periodic in distribution under slightly stronger conditions. We also give two examples to illustrate our results.
The paper develops a method for discrete computational Fourier analysis of functions defined on quasicrystals and other almost periodic sets. A key point is to build the analysis around the emerging theory of quasicrystals and diffraction in the setting on local hulls and dynamical systems. Numerically computed approximations arising in this way are built out of the Fourier module of the quasicrystal in question, and approximate their target functions uniformly on the entire infinite space. The methods are entirely group theoretical, being based on finite groups and their duals, and they are practical and computable. Examples of functions based on the standard Fibonacci quasicrystal serve to illustrate the method (which is applicable to all quasicrystals modeled on the cut and project formalism).
The main step in numerical evaluation of classical Sl2 (Z) modular forms and elliptic functions is to compute the sum of the first N nonzero terms in the sparse q-series belonging to the Dedekind eta function or the Jacobi theta constants. We construct short addition sequences to perform this task using N + o(N) multiplications. Our constructions rely on the representability of specific quadratic progressions of integers as sums of smaller numbers of the same kind. For example, we show that every generalised pentagonal number c 5 can be written as c = 2a + b where a, b are smaller generalised pentagonal numbers. We also give a baby-step giant-step algorithm that uses O(N/ log r N) multiplications for any r > 0, beating the lower bound of N multiplications required when computing the terms explicitly. These results lead to speed-ups in practice.
In this paper we show how the cross-disciplinary transfer of techniques from Dynamical Systems Theory to Number Theory can be a fruitful avenue for research. We illustrate this idea by exploring from a nonlinear and symbolic dynamics viewpoint certain patterns emerging in some residue sequences generated from the prime number sequence. We show that the sequence formed by the residues of the primes modulo $k$ are maximally chaotic and, while lacking forbidden patterns, display a non-trivial spectrum of Renyi entropies which suggest that every block of size $m>1$, while admissible, occurs with different probability. This non-uniform distribution of blocks for $m>1$ contrasts Dirichlets theorem that guarantees equiprobability for $m=1$. We then explore in a similar fashion the sequence of prime gap residues. This sequence is again chaotic (positivity of Kolmogorov-Sinai entropy), however chaos is weaker as we find forbidden patterns for every block of size $m>1$. We relate the onset of these forbidden patterns with the divisibility properties of integers, and estimate the densities of gap block residues via Hardy-Littlewood $k$-tuple conjecture. We use this estimation to argue that the amount of admissible blocks is non-uniformly distributed, what supports the fact that the spectrum of Renyi entropies is again non-trivial in this case. We complete our analysis by applying the Chaos Game to these symbolic sequences, and comparing the IFS attractors found for the experimental sequences with appropriate null models.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
