Searcharxiv⌕ Search

arXiv · 0707.1263

Affine systems: asymptotics at infinity for fractal measures

Abstract

We study measures on $\mathbb{R}^d$ which are induced by a class of infinite and recursive iterations in symbolic dynamics. Beginning with a finite set of data, we analyze prescribed recursive iteration systems, each involving subdivisions. The construction includes measures arising from affine and contractive iterated function systems with and without overlap (IFSs), i.e., limit measures $μ$ induced by a finite family of affine mappings in $\mathbb{R}^d$ (the focus of our paper), as well as equilibrium measures in complex dynamics. By a systematic analysis of the Fourier transform of the measure $μ$ at hand (frequency domain), we identify asymptotic laws, spectral types, dichotomy, and chaos laws. In particular we show that the cases when $μ$ is singular carry a gradation, ranging from Cantor-like fractal measures to measures exhibiting chaos, i.e., a situation when small changes in the initial data produce large fluctuations in the outcome, or rather, the iteration limit (in this case the measures). Our method depends on asymptotic estimates on the Fourier transform of $μ$ for paths at infinity in $\mathbb{R}^d$. We show how properties of $μ$ depend on perturbations of the initial data, e.g., variations in a prescribed finite set of affine mappings in $\mathbb{R}^d$, in parameters of a rational function in one complex variable (Julia sets and equilibrium measures), or in the entries of a given infinite positive definite matrix.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Palle E. T. Jorgensen, Keri A. Kornelson, Karen L. Shuman. 2007-08-20. Affine systems: asymptotics at infinity for fractal measures. https://arxiv.org/abs/0707.1263

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

KEEP EXPLORING

Related papers

Lyapunov stability of polynomial vector fields is undecidable

We show that there are integers $N$ and odd $D$ such that no algorithm can decide, from the rational coefficients of a homogeneous polynomial vector field $F$ in dimension $N$ of degree $D$, whether the origin is Lyapunov stable for $\dot Y=F(Y)$. This proves a conjecture of V. I. Arnold. We provide a Lean formalization of the proof. The smallest dimension $N$ for which we were able to prove undecidability is $N = 5$. An analogous undecidability result holds for global asymptotic stability and global exponential stability for non-homogenous vector fields. For dimension $N=2$ and homogenous vector fields, we establish decidability for all commonly used stability notions, building heavily on existing results.

math.DS↗

On Standard perturbations of the Affine twist map

For any $t\in\mathbb{R}$, consider the Affine twist map $\rm{Aff_t}:\mathbb{T}^2\to\mathbb{T}^2$ given by $$\rm{Aff_t}(x,y)=(x+y \text{ mod 1}, y+t \text{ mod 1}).$$ The map $\rm{Aff_t}$ clearly possesses an invariant foliation by horizontal curves. If $t$ is rational, each leaf is periodic, and if $t$ is irrational, the orbit of each leaf is dense in the torus. In both cases, the vertical rotation set of the proper lift of $\rm{Aff_t}$ to the vertical cylinder is reduced to $\{t\}.$ Now, for $k\in\mathbb{R},$ define $$f_{k,t}(x,y):=(x+y+k\sin (2πx)\text{ mod 1},y+k\sin (2πx)+t\text{ mod 1}).$$ We show that: 1) when $t=p/q$ for integers $p$ and $q>0$, KAM theory implies the existence of a constant $k_{p/q}>0$ such that for $|k|<k_{p/q}$, the vertical rotation set of an adequate lift of $f_{k,p/q}$ is just $\{p/q\}.$ 2) when $t$ is irrational, for any $k\neq 0$ the vertical rotation set of the adequate lift of $f_{k,t}$ is a non-degenerate interval which contains $t$ in its interior. In other words, it is not easy to build area-preserving twist maps whose vertical rotation sets are reduced to a single irrational number. From Theorem A of \cite{eujul}, such a map needs to have an invariant foliation by Lipschitz graphs over the horizontal coordinate. In particular, all its iterates must satisfy a twist condition. This is precisely what does not hold for $f_{k,t}$, for all non-zero values of $k$.

math.DS↗

A topology for Engel expansions: evaluation and digit coding maps

We develop a topological framework for Engel expansions that treats both directions of the correspondence between points of $(0,1]$ and nondecreasing digit sequences. We endow the sequence space with the product topology to study the evaluation map, and we fix a nonterminating digit algorithm to study the digit coding map. We also record the correspondence between cylinder sets and fundamental intervals, and give an application to Baire category results for functions of the digits.

math.DS↗