Fourier transforms and iterated function systems

Abstract

We discuss the problem of bounding the Fourier transforms of stationary measures of iterated function systems (IFSs) and how the pseudo-randomness of the IFS either due to arithmetic, algebraic or geometric reasons is reflected in the behaviour of the Fourier transform. We outline various methods that have been built to estimate the Fourier transform of stationary measures arising e.g. from thermodynamical formalism, additive combinatorics, random walks on groups and hyperbolic dynamics. Open problems, prospects and recent links to quantum chaos are also highlighted.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…