m

F Nous contacter

0

Documents  Frid, Anna | enregistrements trouvés : 6

O
     

-A +A

P Q

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Research schools;Dynamical Systems and Ordinary Differential Equations

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

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Research schools;Dynamical Systems and Ordinary Differential Equations

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

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Research schools;Dynamical Systems and Ordinary Differential Equations

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

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

- vi; 139 p.
ISBN 978-2-271-12611-5

Localisation : Colloque 1er étage (MARS);Ouvrage RdC (INFO)

informatique mathématique # transduction # mot sturmien # maillage 3D # poset, polynôme, polytope (popopo) # algorithmique distribuée # système d'agents mobiles

68Q45 ; 68R15 ; 68P20 ; 94A08 ; 52A25 ; 06A07

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Research schools;Analysis and its Applications;Combinatorics;Dynamical Systems and Ordinary Differential Equations;Number Theory

28A80 ; 37A30 ; 37B10 ; 37E05 ; 11B85 ; 11B83 ; 68R15

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Research schools;Combinatorics;Computer Science;Dynamical Systems and Ordinary Differential Equations

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

... Lire [+]

Z