相关论文: Every transformation is disjoint from almost every…

We look at interval exchange transformations defined as first return maps on the set of diagonals of a flow of direction $\theta$ on a square-tiled surface: using a combinatorial approach, we show that, when the surface has at least one…

We prove that almost all digraphs not embedding an independent set of size 3 consist of two disjoint tournaments, and discuss connections with the theory of homogeneous simple structures.

We refine upper bounds on the permanent saturation time of metric graphs using interval exchange transformations (IETs). Earlier results gave bounds under incommensurable edge lengths, we improve and generalize them by using the ergodic and…

We consider interval exchange transformations of periodic type and construct different classes of recurrent ergodic cocycles of dimension $\geq 1$ over this special class of IETs. Then using Poincar\'e sections we apply this construction to…

We introduce the notion of a transformation digroup and prove that every digroup is isomorphic to a transformation digroup.

We prove that the Birkhoff pointwise ergodic theorem and the Oseledets multiplicative ergodic theorem hold for every flat surface in almost every direction. The proofs rely on the strong law of large numbers, and on recent rigidity results…

This paper investigates the algebraic and dynamical properties of the twisted cocycle, a $\mathrm{GL}(d, \mathbb{C})$-valued cocycle defined over the toral extension of the Zorich (Rauzy-Veech) renormalization for interval exchange…

The ergodic decomposition theorem is a cornerstone result of dynamical systems and ergodic theory. It states that every invariant measure on a dynamical system is a mixture of ergodic ones. Here we formulate and prove the theorem in terms…

For every integer $k \ge 3$, we determine the extremal structure of an $n$-vertex graph with at most $t$ vertex-disjoint copies of $C_{2k}$ when $n$ is sufficiently large and $t$ lies in the interval…

We examine some of the properties of uniformly rigid transformations, and analyze the compatibility of uniform rigidity and (measurable) weak mixing along with some of their asymptotic convergence properties. We show that on Cantor space,…

We give examples of rank-one transformations that are (weak) doubly ergodic and rigid (so all their cartesian products are conservative), but with non-ergodic $2$-fold cartesian product. We give conditions for rank-one infinite…

We give an affirmative answer to a long-standing conjecture of Thomassen, stating that every sufficiently highly connected graph has a $k$-vertex-connected orientation. We prove that a connectivity of order $O(k^2)$ suffices. As a key tool,…

In this paper we prove the existence of minimal non uniquely ergodic flipped IETs. In particular, we build explicitly minimal non uniquely ergodic $(10,k)$-IETs for any $1\leq k \leq 10$. This answers an open question posed in…

We show that minimal shifts with zero topological entropy are topologically conjugate to interval exchange transformations, generally infinite. When these shifts have linear factor complexity (linear block growth), the conjugate interval…

In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this…

We study the ergodic theory of non-conservative C^1-generic diffeomorphisms. First, we show that homoclinic classes of arbitrary diffeomorphisms exhibit ergodic measures whose supports coincide with the homoclinic class. Second, we show…

A sharp bound on the number of invariant components of an interval exchange transformation is provided. More precisely, it is proved that the number of periodic components n_per and the number of minimal components n_min of an interval…

We prove that if $T$ is a complete theory with weak elimination of imaginaries, then there is an explicit bijection between strict independence relations for $T$ and strict independence relations for $T^{\text{eq}}$. We use this observation…

We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…

We study mean convergence results for weighted multiple ergodic averages defined by commuting transformations with iterates given by integer polynomials in several variables. Roughly speaking, we prove that a bounded sequence is a good…