En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK

Documents Durand, Fabien 12 résultats

Filtrer
Sélectionner : Tous / Aucun
Q
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Confined subgroups and high transitivity - Matte Bon, Nicolás (Auteur de la conférence) | CIRM H

Multi angle

A subgroup of a group is confined if the closure of its conjugacy class in the Chabauty space does not contain the trivial subgroup. Such subgroups arise naturally as stabilisers for non-free actions on compact spaces. I will explain a result establishing a relation between the confined subgroup of a group with its highly transitive actions. We will see how this result allows to understand the highly transitive actions of a class of groups of dynamical origin. This is joint work with Adrien Le Boudec.[-]
A subgroup of a group is confined if the closure of its conjugacy class in the Chabauty space does not contain the trivial subgroup. Such subgroups arise naturally as stabilisers for non-free actions on compact spaces. I will explain a result establishing a relation between the confined subgroup of a group with its highly transitive actions. We will see how this result allows to understand the highly transitive actions of a class of groups of ...[+]

20B22 ; 37B05 ; 22F05

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Palindromes patterns - Brlek, Srecko (Auteur de la conférence) | CIRM H

Multi angle

The study of palindromes and their generalizations in a word has gained a lot of interest in the last 20 years, motivated by applications in physics, biology, discrete geometry, to name only a few. Using Sebastien Ferenczi as an example, we illustrate the computation of its palindromic complexity and its relation with the usual factor complexity, via an identity attributed to Brlek and Reutenauer involving also the palindromic defect. Periodic infinite words as well as the family of words with language closed by reversal also satisfy the identity. The identity remains valid when palindromic is replaced by $\sigma$-palindromic, and we also discuss some other patterns.[-]
The study of palindromes and their generalizations in a word has gained a lot of interest in the last 20 years, motivated by applications in physics, biology, discrete geometry, to name only a few. Using Sebastien Ferenczi as an example, we illustrate the computation of its palindromic complexity and its relation with the usual factor complexity, via an identity attributed to Brlek and Reutenauer involving also the palindromic defect. Periodic ...[+]

68Q45 ; 68R15

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Number of ergodic and generic measures for minimal subshifts - Fickenscher, Jon (Auteur de la conférence) | CIRM H

Virtualconference

Subshifts on finite alphabets form a class of dynamical systems that bridge topological/ergodic dynamical systems with that of word combinatorics. In 1984, M. Boshernitzan used word combinatorics to provide a bound on the number of ergodic measures for a minimal subshift with bounds on its linear factor complexity growth rate. He further asked if the correct bound for subshifts naturally coded by interval exchange transformations (IETs) could be obtained by word combinatoric methods. (The ”correct” bound is roughly half that obtained by Boshernitzan's work.) In 2017 and joint with M. Damron, we slightly improved Boshernitzan's bound by restricting to a smaller class of subshifts that still contained IET subshifts. In recent work, we have further proved the ”correct” bound to subshifts whose languages satisfy a specific word combinatoric condition, which we called the Regular Bispecial Condition. (This condition is equivalent to being Eventually Dendric as independently introduced by F. Dolce and D. Perrin.)
During the same time we worked on our 2017 paper, V. Cyr and B. Kra were independently improving Boshernitzan's results. In 2019, they relaxed the conditions to no longer require minimality and extended Boshernitzan's bound to generic measures. (Generic measures are those that have generic points, meaning they satisfy the averaging limits as stated in Pointwise Ergodic Theorem. However, there are non-ergodic generic measures.) We have obtained the improved 2017 bound but for generic measures (and on a more general class of subshifts). It should be noted that, to our current knowledge, there does not exist a proof of the correct bound of generic measures for minimal IETs (by any method).In this talk, I will discuss these recent results and highlight related open problems.[-]
Subshifts on finite alphabets form a class of dynamical systems that bridge topological/ergodic dynamical systems with that of word combinatorics. In 1984, M. Boshernitzan used word combinatorics to provide a bound on the number of ergodic measures for a minimal subshift with bounds on its linear factor complexity growth rate. He further asked if the correct bound for subshifts naturally coded by interval exchange transformations (IETs) could be ...[+]

37B10 ; 28D05 ; 37A05

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Rotated odometers - Lukina, Olga (Auteur de la conférence) | CIRM H

Virtualconference

We consider infinite interval exchange transformations (IETs) obtained as a composition of a finite IET and the von Neumann-Kakutani map, called rotated odometers, and study their dynamical and ergodic properties by means of an associated Bratteli-Vershik system. We show that every rotated odometer is measurably isomorphic to the first return map of a rational parallel flow on a translation surface of finite area with infinite genus and a finite number of ends, with respect to the Lebesgue measure. This is one motivation for the study of rotated odometers. We also prove a few results about the factors of the unique minimal subsystem of a rotated odometer. This is joint work with Henk Bruin.[-]
We consider infinite interval exchange transformations (IETs) obtained as a composition of a finite IET and the von Neumann-Kakutani map, called rotated odometers, and study their dynamical and ergodic properties by means of an associated Bratteli-Vershik system. We show that every rotated odometer is measurably isomorphic to the first return map of a rational parallel flow on a translation surface of finite area with infinite genus and a finite ...[+]

37C83 ; 37E05 ; 28D05

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Nilpotent endomorphisms of expansive group actions - Salo, Ville (Auteur de la conférence) | CIRM H

Virtualconference

We say a pointed dynamical system is asymptotically nilpotent if every point tends to zero. We study group actions whose endomorphism actions are nilrigid, meaning that for all asymptotically nilpotent endomorphisms the convergence to zero is uniform. We show that this happens for a large class of expansive group actions on a large class of groups. The main examples are cellular automata on subshifts of finite type.

37B05 ; 37B15 ; 54H15

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
2y

Interview au Cirm : Fabien Durand - Durand, Fabien (Personne interviewée) | CIRM H

Post-edited

Interview de Fabien Durand, mathématicien à l'Université de Picardie Jules Verne, président de la Société Mathématique de France depuis le 1er juillet 2020.

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Interview au Cirm : Fabien Durand & Samuel Petite - Durand, Fabien (Personne interviewée) ; Petite, Samuel (Personne interviewée) | CIRM H

Multi angle

This conference will gather researchers working on different topics such as combinatorics, computer science, probability, geometry, physics, quasicrystallography, ... but sharing a common interest: dynamical systems and more precisely subshifts, tilings and group actions. It will focus on algebraic and dynamical invariants such as group automorphisms, growth of symbolic complexity, Rauzy graphs, dimension groups, cohomology groups, full groups, dynamical spectrum, amenability, proximal pairs, ... With this conference we aim to spread out these invariants outside of their original domains and to deepen their connections with combinatorial and dynamical properties.[-]
This conference will gather researchers working on different topics such as combinatorics, computer science, probability, geometry, physics, quasicrystallography, ... but sharing a common interest: dynamical systems and more precisely subshifts, tilings and group actions. It will focus on algebraic and dynamical invariants such as group automorphisms, growth of symbolic complexity, Rauzy graphs, dimension groups, cohomology groups, full groups, ...[+]

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
2y
I will speak about multidimensional shifts of finite type and their measures of maximal entropy. In particular, I will present results about computability of topological entropy for SFTs and measure-theoretic entropy. I'll focus on various mixing hypotheses, both topological and measure-theoretic, which imply different rates of computability for these objects, and give applications to various systems, including the hard square model, k-coloring, and iceberg model.[-]
I will speak about multidimensional shifts of finite type and their measures of maximal entropy. In particular, I will present results about computability of topological entropy for SFTs and measure-theoretic entropy. I'll focus on various mixing hypotheses, both topological and measure-theoretic, which imply different rates of computability for these objects, and give applications to various systems, including the hard square model, k-coloring, ...[+]

37B50 ; 37B10 ; 37B40

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
I will speak about multidimensional shifts of finite type and their measures of maximal entropy. In particular, I will present results about computability of topological entropy for SFTs and measure-theoretic entropy. I'll focus on various mixing hypotheses, both topological and measure-theoretic, which imply different rates of computability for these objects, and give applications to various systems, including the hard square model, k-coloring, and iceberg model.[-]
I will speak about multidimensional shifts of finite type and their measures of maximal entropy. In particular, I will present results about computability of topological entropy for SFTs and measure-theoretic entropy. I'll focus on various mixing hypotheses, both topological and measure-theoretic, which imply different rates of computability for these objects, and give applications to various systems, including the hard square model, k-coloring, ...[+]

37B50 ; 37B10 ; 37B40

Sélection Signaler une erreur