Related papers: An Ergodic Result

In the framework of infinite ergodic theory, we derive equidistribution results for suitable weighted sequences of cusp points of Hecke triangle groups encoded by group elements of constant word length with respect to a set of natural…

We study multiple ergodic averages along IP sets, meaning we restrict iterates in the averages to all finite sums of some infinite sequence of natural numbers. We give criteria for convergence and divergence in mean of these multiple…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

Monodromy in analytic families of smooth complex surfaces yields groups of isotopy classes of orientation preserving diffeomorphisms for each family member X. For all deformation classes of minimal elliptic surfaces with p_g>q=0, we…

We study the notion of geometric structures for toposes: This generalizes the notion of (X,G) manifolds. We give some applications to algebraic geometry

We provide an ergodic theory framework to study statistical properties of smooth sequences over the odd alphabet {1, 3}. The arithmetic nature of this alphabet yields a partition of the subshift of smooth sequences based on their local…

We define a class of dynamical maps on the quasi-local algebra of a quantum spin system, which are quantum analogues of probabilistic cellular automata. We develop criteria for such a system to be ergodic, i.e., to possess a unique…

Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…

Ergodic Optimization is the process of finding invariant probability measures that maximize the integral of a given function. It has been conjectured that "most" functions are optimized by measures supported on a periodic orbit, and it has…

Results concerning recurrence and ergodicity are proved in an abstract Hilbert space setting based on the proof of Khintchine's recurrence theorem for sets, and on the Hilbert space characterization of ergodicity. These results are carried…

We give a general account of family algebras over a finitely presented linear operad, this operad together with its presentation naturally defining an algebraic structure on the set of parameters.

A topology is defined on the mapping class group of a compact connected orientable surface. It is shown that a notion of "genericity" on subsets of the mapping class group arises from this definition. Many plausible results follow from this…

We study the collection of group structures that can be realized as a group of rational points on an elliptic curve over a finite field (such groups are well known to be of rank at most two). We also study various subsets of this collection…

It is well known that ergodic theory can be used to formally prove a weak form of relaxation to equilibrium for finite, mixing, Hamiltonian systems. In this Letter we extend this proof to any dynamics that preserves a mixing equilibrium…

We consider ergodic $\mathrm{Sym}(\mathbb{N})$-invariant probability measures on the space of $L$-structures with domain $\mathbb{N}$ (for $L$ a countable relational language), and call such a measure a properly ergodic structure when no…

We prove ergodicity of a class of infinite measure preserving systems, called skew-products. More precisely, we consider systems of the form \[ {T_f}:{[0, 1) \times \mathbb{R}}\to{[0, 1) \times \mathbb{R}},\quad {T_f(x, t)}:={(T(x),…

The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we…

We study mixing properties of epimorphisms of a compact connected finite-dimensional abelian group $X$. In particular, we show that a set $F$, $|F|>\dim X$, of epimorphisms of $X$ is mixing iff every subset of $F$ of cardinality $(\dim…

In this article, we introduce an ergodic optimization problem inspired by information theory, which can be presented informally as follows: given a factor map $\pi : (X, T) \to (Y, S)$ of topological dynamical systems, and a continuous…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…