Séminaire Ernest
Intitulé
Dynamique, Arithmétique, Combinatoire (Ernest)
Responsables
Fréquence
Hebdomadaire
Jour-Horaires
Mardi, 11h-12h
Lieu
Luminy, salle 304-306 (accès)
Une liste de diffusion (modérée) pour être tenu au courant des exposés de ce séminaire : i2m-seminaire-ernest@univ-amu.fr
Pour s’inscrire, contacter l’un des responsables.
Les prochains séminaires
10
Fév
On the topological structure of the space of ℤᵈ-subshifts
Alonso Herrera Nuñez (LIX)
The space 𝓢ᵈ of ℤᵈ-subshifts, d≥1, endowed with the Hausdorff topology, provides a natural framework for the study of generic properties, as it admits an [...]
Événements passés
13
Mar
Fixing monotone boolean networks asynchronously
Adrien Richard (I3S, University of Nice-Sophia Antipolis)
A monotone boolean network with n components is a directed graph on [n]≔{1,…,n} where each vertex is labeled by a binary variable and a local [...]
Systèmes sturmiens de numération et palindromes
Anna Frid (I2M, Aix-Marseille Université)
Je généralise les systèmes de numération d'Ostrowski pour décrire les occurrences des palindromes à un mot sturmien caractéristique et démontrer une conjecture sur les décompositions [...]
Maximum of the Riemann ζ function in typical intervals
Maksym Radziwill (McGill University in Montreal)
An outstanding problem in analytic number theory is to understand the maximum of the Riemann ζ function on the critical line. The problem is poorly [...]
Constructing space-filling curves of self-similar sets
Hui Rao (Central China Normal University, Wuhan)
We give a general method to construct space-filling curves of self-similar sets. First, we introduce a notion of skeleton of self-similar sets. As soon as [...]
On the topological entropy of the subshifts of finite type on free semigroups
Jung-Chao Ban (National Dong Hwa University)
In this talk, we provide an effective method to compute the topological entropies of G-subshifts of finite type (G-SFTs) with G = Fd or Sd, [...]
Nilpotent endomorphisms of expansive group actions
Ilkka Törmä (University of Turku, Finland)
Consider a cellular automaton with a special quiescent state 0. The automaton is called nilpotent if it sends every initial configuration to the 0-uniform configuration [...]
