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
Pas d'évènements à afficher
Événements passés
27
Mai
An additive application of the resonance method
Athanasios Sourmelidis
In this talk I will describe a way to implement the resonance method in problems of analytic number theory which are not necessarily multiplicative in [...]
20
Mai
Characterisations of polynomial-time and -space complexity classes over the reals
Manon Blanc
Many recent works have studied how analogue computational models work, compared to classical digital ones. By “analogue” models of computation, we mean computing over continuous [...]
13
Mai
Frequences in self-descriptive sequences
Mai-Linh Tran-Cong
The Oldenburger-Kolakoski sequence is the only infinite sequence over the alphabet {1,2} starting with a « 1 » and equal to its own derivative. M.S. [...]
06
Mai
Markoff mod-p Graphs: Connectivity, Maximal Divisors, and Generalizations
Matthew Litman
Markoff triples were introduced in 1879 and have a rich history spanning many branches of mathematics. In 2016, Bourgain, Gamburd, and Sarnak answered a long [...]
29
Avr
Local obstructions in sequences revisited
Matthieu Rosenfeld
Consider the following problem about lacunary sequences of positive integers, i.e., nₖ₊₁>(1+e)nₖ for some e>0: Can we find a real θ such that the distances [...]
22
Avr
Minimality and computability of languages of G-shifts
Djamel Eddine Amir
Motivated by the notion of strong computable type for sets in computable analysis, we define the notion of strong computable type for G-shifts, where G [...]
