We introduce a new method of constructing Birkhoff sections for pseudo-Anosov flows, which uses the connection between pseudo-Anosov flows and veering triangulations. This method allows for explicit constructions, as well as control over the Birkhoff section in terms of its Euler characteristic and the complexity of the boundary orbits. In particular, we show that any transitive pseudo-Anosov flow has a Birkhoff section with two boundary components.

To any k-dimensional subspace of $\mathbb {Q}^n$ one can naturally associate a point in the Grassmannian $\mathrm {Gr}_{n,k}(\mathbb {R})$ and two shapes of lattices of rank k and $n-k$, respectively. These lattices originate by intersecting the k-dimensional subspace and its orthogonal with the lattice $\mathbb {Z}^n$. Using unipotent dynamics, we prove simultaneous equidistribution of all of these objects under congruence conditions when $(k,n) \neq (2,4)$.

In this paper, we first give a necessary and sufficient condition for a factor code with an unambiguous symbol to admit a subshift of finite type restricted to which it is one-to-one and onto. We then give a necessary and sufficient condition for the standard factor code on a spoke graph to admit a subshift of finite type restricted to which it is finite-to-one and onto. We also conjecture that for such a code, the finite-to-one and onto property is equivalent to the existence of a stationary Markov chain that achieves the capacity of the corresponding deterministic channel.

Katok’s special representation theorem states that any free ergodic measure- preserving $\mathbb {R}^{d}$-flow can be realized as a special flow over a $\mathbb {Z}^{d}$-action. It provides a multidimensional generalization of the ‘flow under a function’ construction. We prove the analog of Katok’s theorem in the framework of Borel dynamics and show that, likewise, all free Borel $\mathbb {R}^{d}$-flows emerge from $\mathbb {Z}^{d}$-actions through the special flow construction using bi-Lipschitz cocycles.

We show that there is a distortion element in a finitely generated subgroup G of the automorphism group of the full shift, namely an element of infinite order whose word norm grows polylogarithmically. As a corollary, we obtain a lower bound on the entropy dimension of any subshift containing a copy of G, and that a sofic shift’s automorphism group contains a distortion element if and only if the sofic shift is uncountable. We obtain also that groups of Turing machines and the higher-dimensional Brin–Thompson groups $mV$ admit distortion elements; in particular, $2V$ (unlike V) does not admit a proper action on a CAT$(0)$ cube complex. In each case, the distortion element roughly corresponds to the SMART machine of Cassaigne, Ollinger, and Torres-Avilés [A small minimal aperiodic reversible Turing machine. J. Comput. System Sci. 84 (2017), 288–301].

In this paper, we study centrally symmetric Birkhoff billiard tables. We introduce a closed invariant set $\mathcal {M}_{\mathcal {B}}$ consisting of locally maximizing orbits of the billiard map lying inside the region $\mathcal {B}$ bounded by two invariant curves of $4$-periodic orbits. We give an effective bound from above on the measure of this invariant set in terms of the isoperimetric defect of the curve. The equality case occurs if and only if the curve is a circle.

The construction of a spectral cocycle from the case of one-dimensional substitution flows [A. I. Bufetov and B. Solomyak. A spectral cocycle for substitution systems and translation flows. J. Anal. Math. 141(1) (2020), 165–205] is extended to the setting of pseudo-self-similar tilings in ${\mathbb R}^d$, allowing expanding similarities with rotations. The pointwise upper Lyapunov exponent of this cocycle is used to bound the local dimension of spectral measures of deformed tilings. The deformations are considered, following the work of Treviño [Quantitative weak mixing for random substitution tilings. Israel J. Math., to appear], in the simpler, non-random setting. We review some of the results of Treviño in this special case and illustrate them on concrete examples.

We prove that any strongly mixing action of a countable abelian group on a probability space has higher-order mixing properties. This is achieved via the utilization of $\mathcal R$-limits, a notion of convergence which is based on the classical Ramsey theorem. $\mathcal R$-limits are intrinsically connected with a new combinatorial notion of largeness which is similar to but has stronger properties than the classical notions of uniform density one and IP$^*$. While the main goal of this paper is to establish a universal property of strongly mixing actions of countable abelian groups, our results, when applied to ${\mathbb {Z}}$-actions, offer a new way of dealing with strongly mixing transformations. In particular, we obtain several new characterizations of strong mixing for ${\mathbb {Z}}$-actions, including a result which can be viewed as the analogue of the weak mixing of all orders property established by Furstenberg in the course of his proof of Szemerédi’s theorem. We also demonstrate the versatility of $\mathcal R$-limits by obtaining new characterizations of higher-order weak and mild mixing for actions of countable abelian groups.

We say that $S\subseteq \mathbb Z$ is a set of k-recurrence if for every measure-preserving transformation T of a probability measure space $(X,\mu )$ and every $A\subseteq X$ with $\mu (A)>0$, there is an $n\in S$ such that $\mu (A\cap T^{-n} A\cap T^{-2n}\cap \cdots \cap T^{-kn}A)>0$. A set of $1$-recurrence is called a set of measurable recurrence. Answering a question of Frantzikinakis, Lesigne, and Wierdl [Sets of k-recurrence but not (k+1)-recurrence. Ann. Inst. Fourier (Grenoble) 56(4) (2006), 839–849], we construct a set of $2$-recurrence S with the property that $\{n^2:n\in S\}$ is not a set of measurable recurrence.

We investigate tameness of Toeplitz shifts. By introducing the notion of extended Bratteli–Vershik diagrams, we show that such shifts with finite Toeplitz rank are tame if and only if there are at most countably many orbits of singular fibres over the maximal equicontinuous factor. The ideas are illustrated using the class of substitution shifts. A body of elaborate examples shows that the assumptions of our results cannot be relaxed.

We prove a generalization of Krieger’s embedding theorem, in the spirit of zero-error information theory. Specifically, given a mixing shift of finite type X, a mixing sofic shift Y, and a surjective sliding block code $\pi : X \to Y$, we give necessary and sufficient conditions for a subshift Z of topological entropy strictly lower than that of Y to admit an embedding $\psi : Z \to X$ such that $\pi \circ \psi $ is injective.

Given a dynamical system, we prove that the shortest distance between two n-orbits scales like n to a power even when the system has slow mixing properties, thus building and improving on results of Barros, Liao and the first author [On the shortest distance between orbits and the longest common substring problem. Adv. Math. 344 (2019), 311–339]. We also extend these results to flows. Finally, we give an example for which the shortest distance between two orbits has no scaling limit.

We study infinite systems of mean field weakly coupled intermittent maps in the Pomeau–Manneville scenario. We prove that the coupled system admits a unique ‘physical’ stationary state, to which all absolutely continuous states converge. Moreover, we show that suitably regular states converge polynomially.

Inspired by a twist map theorem of Mather. we study recurrent invariant sets that are ordered like rigid rotation under the action of the lift of a bimodal circle map g to the k-fold cover. For each irrational in the rotation set’s interior, the collection of the k-fold ordered semi-Denjoy minimal sets with that rotation number contains a $(k-1)$-dimensional ball with the weak topology on their unique invariant measures. We also describe completely their periodic orbit analogs for rational rotation numbers. The main tool used is a generalization of a construction of Hedlund and Morse that generates symbolic analogs of these k-fold well-ordered invariant sets.

Reflection in a strictly convex bounded planar billiard acts on the space of oriented lines and preserves a standard area form. A caustic is a curve C whose tangent lines are reflected by the billiard to lines tangent to C. The famous Birkhoff conjecture states that the only strictly convex billiards with a foliation by closed caustics near the boundary are ellipses. By Lazutkin’s theorem, there always exists a Cantor family of closed caustics approaching the boundary. In the present paper, we deal with an open billiard, whose boundary is a strictly convex embedded (non-closed) curve $\gamma $. We prove that there exists a domain U adjacent to $\gamma $ from the convex side and a $C^\infty $-smooth foliation of $U\cup \gamma $ whose leaves are $\gamma $ and (non-closed) caustics of the billiard. This generalizes a previous result by Melrose on the existence of a germ of foliation as above. We show that there exists a continuum of above foliations by caustics whose germs at each point in $\gamma $ are pairwise different. We prove a more general version of this statement for $\gamma $ being an (immersed) arc. It also applies to a billiard bounded by a closed strictly convex curve $\gamma $ and yields infinitely many ‘immersed’ foliations by immersed caustics. For the proof of the above results, we state and prove their analogue for a special class of area-preserving maps generalizing billiard reflections: the so-called $C^{\infty }$-lifted strongly billiard-like maps. We also prove a series of results on conjugacy of billiard maps near the boundary for open curves of the above type.

A left orderable monster is a finitely generated left orderable group all of whose fixed point-free actions on the line are proximal: the action is semiconjugate to a minimal action so that for every bounded interval I and open interval J, there is a group element that sends I into J. In his 2018 ICM address, Navas asked about the existence of left orderable monsters. By now there are several examples, all of which are finitely generated but not finitely presentable. We provide the first examples of left orderable monsters that are finitely presentable, and even of type $F_\infty $. These groups satisfy several additional properties separating them from the previous examples: they are not simple, they act minimally on the circle, and they have an infinite-dimensional space of homogeneous quasimorphisms. Our construction is flexible enough that it produces infinitely many isomorphism classes of finitely presented (and type $F_{\infty }$) left orderable monsters.

Let $S=\{p_1, \ldots , p_r,\infty \}$ for prime integers $p_1, \ldots , p_r.$ Let X be an S-adic compact nilmanifold, equipped with the unique translation-invariant probability measure $\mu .$ We characterize the countable groups $\Gamma $ of automorphisms of X for which the Koopman representation $\kappa $ on $L^2(X,\mu )$ has a spectral gap. More specifically, let Y be the maximal quotient solenoid of X (thus, Y is a finite-dimensional, connected, compact abelian group). We show that $\kappa $ does not have a spectral gap if and only if there exists a $\Gamma $-invariant proper subsolenoid of Y on which $\Gamma $ acts as a virtually abelian group,

Given a locally finite graph $\Gamma $, an amenable subgroup G of graph automorphisms acting freely and almost transitively on its vertices, and a G-invariant activity function $\unicode{x3bb} $, consider the free energy $f_G(\Gamma ,\unicode{x3bb} )$ of the hardcore model defined on the set of independent sets in $\Gamma $ weighted by $\unicode{x3bb} $. Under the assumption that G is finitely generated and its word problem can be solved in exponential time, we define suitable ensembles of hardcore models and prove the following: if $\|\unicode{x3bb} \|_\infty < \unicode{x3bb} _c(\Delta )$, there exists a randomized $\epsilon $-additive approximation scheme for $f_G(\Gamma ,\unicode{x3bb} )$ that runs in time $\mathrm {poly}((1+\epsilon ^{-1})\lvert \Gamma /G \rvert )$, where $\unicode{x3bb} _c(\Delta )$ denotes the critical activity on the $\Delta $-regular tree. In addition, if G has a finite index linearly ordered subgroup such that its algebraic past can be decided in exponential time, we show that the algorithm can be chosen to be deterministic. However, we observe that if $\|\unicode{x3bb} \|_\infty> \unicode{x3bb} _c(\Delta )$, there is no efficient approximation scheme, unless $\mathrm {NP} = \mathrm {RP}$. This recovers the computational phase transition for the partition function of the hardcore model on finite graphs and provides an extension to the infinite setting. As an application in symbolic dynamics, we use these results to develop efficient approximation algorithms for the topological entropy of subshifts of finite type with enough safe symbols, we obtain a representation formula of pressure in terms of random trees of self-avoiding walks, and we provide new conditions for the uniqueness of the measure of maximal entropy based on the connective constant of a particular associated graph.

We study the asymptotic behavior of the family of holomorphic correspondences $\lbrace \mathcal {F}_a\rbrace _{a\in \mathcal {K}}$, given by

$$ \begin{align*}\bigg(\frac{az+1}{z+1}\bigg)^2+\bigg(\frac{az+1}{z+1}\bigg)\bigg(\frac{aw-1}{w-1}\bigg)+\bigg(\frac{aw-1}{w-1}\bigg)^2=3.\end{align*} $$

$\mathcal {F}_a$

$\operatorname {PSL}_2(\mathbb {Z})$

$a\in \mathcal {K}$

$\mathcal {F}_a$

$\mathcal {F}_a$

We show that, under finitely many ergodicity assumptions, any multicorrelation sequence defined by invertible measure-preserving $\mathbb {Z}^d$-actions with multivariable integer polynomial iterates is the sum of a nilsequence and a nullsequence, extending a recent result of the second author. To this end, we develop a new seminorm bound estimate for multiple averages by improving the results in a previous work of the first, third, and fourth authors. We also use this approach to obtain new criteria for joint ergodicity of multiple averages with multivariable polynomial iterates on ${\mathbb Z}^{d}$-systems.