Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA concentration inequality for interval maps with an indifferent fixed point
132
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
For a map of the unit interval with an indifferent fixed point, we prove an upper bound for the variance of all observables of $n$ variables $K:[0,1]^ntoR$ which are componentwise Lipschitz. The proof is based on coupling and decay of correlation properties of the map. We then give various applications of this inequality to the almost-sure central limit theorem, the kernel density estimation, the empirical measure and the periodogram.
rate research
Read More
Poincares last geometric theorem (Poincare-Birkhoff Theorem) states that any area-preserving twist map of annulus has at least two fixed points. We replace the area-preserving condition with a weaker intersection property, which states that any essential simple closed curve intersects its image under $f$ at least at one point. The conclusion is that any such map has at least one fixed point. Besides providing a new proof to Poincares geometric theorem, our result also has some applications to reversible systems.
We give examples of symplectic diffeomorphisms of R^6 for which the origin is a non-resonant elliptic fixed point which attracts an orbit.
For piecewise monotone interval maps we look at Birkhoff spectra for regular potential functions. This means considering the Hausdorff dimension of the set of points for which the Birkhoff average of the potential takes a fixed value. In the uniformly hyperbolic case we obtain complete results, in the case with parabolic behaviour we are able to describe the part of the sets where the lower Lyapunov exponent is positive. In addition we give some lower bounds on the full spectrum in this case. This is an extension of work of Hofbauer on the entropy and Lyapunov spectra.
In this note, we design a discrete random walk on the real line which takes steps $0, pm 1$ (and one with steps in ${pm 1, 2}$) where at least $96%$ of the signs are $pm 1$ in expectation, and which has $mathcal{N}(0,1)$ as a stationary distribution. As an immediate corollary, we obtain an online version of Banaszczyks discrepancy result for partial colorings and $pm 1, 2$ signings. Additionally, we recover linear time algorithms for logarithmic bounds for the Koml{o}s conjecture in an oblivious online setting.
We prove that a periodic orbit $P$ with coprime over-rotation pair is an over-twist periodic orbit iff the $P$-linear map has the over-rotation interval with left endpoint equal to the over-rotation number of $P$. We then show that this result fails if the over-rotation pair of $P$ is not coprime. Examples of patterns with non-coprime over-rotation pairs are given so that these patterns have no block structure over over-twists but have over-rotation number equal to the left endpoint of the forced over-rotation interval (such patterns are called emph{very badly ordered}). This presents a situation in which the results about over-rotation numbers on the interval and those about classical rotation numbers for circle degree one maps are different. In the end we elucidate a rigorous description of the strongest unimodal pattern that corresponds to a given over-rotation interval and use it to construct unimodal very badly ordered patterns with arbitrary non-coprime over-rotation pair.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
