L’École de Jeunes Chercheurs en Informatique Mathématique 2021

Session

Présentations Doctorants

DOC1

8 juin 2021, 15:30

En Ligne

Présidents de session

Présentations Doctorants: Présentations Etudiants 1

• Il n'a pas de président de session pour ce bloc

Présentations Doctorants: Présentations Doctorants 2

• Il n'a pas de président de session pour ce bloc

Présentations Doctorants: Présentations Doctorants 3

• Olivier Blazy

9. Algorithme de dénombrement de points fixes

M. Charles Balthazar

08/06/2021 15:30

10. On the Besicovitch-Stability of Noisy Random Tilings

Léo Gayral (Université de Toulouse)

08/06/2021 15:55

we introduce a noisy framework for SFTs, allowing some amount of forbidden patterns to appear. Using the Besicovitch distance, which permits a global comparison of configurations, we then study the closeness of noisy measures to non-noisy ones as the amount of noise goes to 0. Our first main result is the full classification of the (in)stability in the one-dimensional case. Our second main...

11. Asymptotic probability of connected labeled objects and virtual species

Khaydar Nurligareev (Université Paris 13)

08/06/2021 16:20

There are a number of combinatorial structures that admit a notion of connectivity, including graphs
as the most commonly used example. We are interested in the probability that a random labeled object
is connected, as its size tends to in?nity. We will show that the asymptotics for these probabilities can
be obtained in a common manner and that asymptotic coe?cients have a combinatorial...

12. Construction de coloriages de produits de groupes en dynamique symbolique

Sacha Huriot (ENS Paris Scalay)

08/06/2021 16:45

13. Aperiodic Subshifts of Finite Type on Baumslag-Solitar Groups

Julien Esnay (ENS-Lyon)

09/06/2021 09:00

The Cayley graph of a group is a way to visualize its structure as a graph. A Subshift of Finite Type (SFT) on a group is the set of all the colorings of the Cayley graph that use a given finite number of colors and respect a given finite number of adjacency rules between colored vertices. Initially studied on $\mathbb{Z}$ as tilings of the biinfinite line with dominoes, the notion was...

14. Augmented Broadcast Encryption with constant size ciphertext, from standard assumption

Anaïs Barthoulot (Orange)

09/06/2021 09:25

15. Algorithmes de fractions continues multidimensionnelle

Dr Mélodie Andrieu-Estevez (Institut de Mathématiques de Marseille)

10/06/2021 09:30