Consider a real Gaussian stationary process, either on Z or on R. That is,
a stochastic process, invariant under translations, whose finite marginals
are centered multi-variate Gaussians. The persistence of such a process on
[0,N] is the probability that it remains positive throughout this interval.
The relation between the decay of the persistence as N tends to infinity
and the covariance function of the process has been investigated since the
1950s with motivations stemming from probability, engineering and
Manchester building, Hebrew University of Jerusalem, (Room 209)
I describe a language and set-up for proving monotonicity of entropy for families of interval maps which are defined locally. This can be seen as a local version of Thurston's algorithm. We apply this approach to prove the monotonicity and related results for families that are
not covered by other methods (with flat critical point, piecewise linear, Lorenz-type, Arnold family and others) . Joint work with Weixiao Shen and Sebastian van Strien.
The Schmidt Subspace Theorem, its S-arithmetic extension by Schlickewei, and subsequent (rather significant) refinements are highlights of the theory of Diophantine applications and have many applications, some quite unexpected.
In this talk I will introduce the relations of rigidity, equicontinuity and pointwise recurrence between an invertible topological dynamical system (X; T) and the dynamical system (K(X); T_K) induced on the hyperspace K(X) of all compact subsets of X, and show some
Based on joint work with Piotr Oprocha, Xiangdong Ye and Ruifeng Zhang.
Given n uniform points on the surface of a two-dimensional sphere, how can we partition the sphere fairly among them ? "Fairly" means that each region has the same area. It turns out that if the given points apply a two-dimensional gravity force to the rest of the sphere, then the basins of attraction for the resulting gradient flow yield such a partition—with exactly equal areas, no matter how the points are distributed. (See the
In the theory of Diophantine approximations, singular points are ones for which Dirichlet’s theorem can be infinitely improved. It is easy to see that all rational points are singular. In the special case of dimension one, the only singular points are the rational ones. In higher dimensions, points lying on a rational hyperplane are also obviously singular. However, in this case there are additional singular points. In the dynamical setting the singular points are related to divergent trajectories.
In this talk I will discuss a finitary version of projection theorems in fractal geometry. Roughly speaking, a projection theorem says that, given a subset in the Euclidean space, its orthogonal projection onto a subspace is large except for a small set of exceptional directions. There are several ways to quantify "large" and "small" in this statement. We will place ourself in a discretized setting where the size of a set is measured by its delta-covering number : the minimal number of balls of radius delta needed to cover the set, where delta > 0 is the scale.
Birkhoff averages (of an observable along orbits) are objects of interest when investigating statistical behaviour of a dynamical system. If there is a unique physical measure, the Birkhoff averages will converge, for almost every orbit, to the space average (i.e. the integral) of the observable, so the physical measure captures important statistical properties of the dynamical system. However, in the quadratic family, for
Automatic sequences are one of the most basic models of computation, with remarkable links to dynamics, algebra and logic (among other fields). In the talk, we will explore a point of view inspired by higher order Fourier analysis. Specifically, we will investigate the behaviour of Gowers norms of some automatic sequences, and (almost) classify all automatic sequences given by generalised polynomial fomulas. The tools used will include some non-trivial results concerning dynamics of nilsystems and their connection