Login

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

Jun 7 – 10, 2021
En Ligne
Europe/Paris timezone

Contact

Session

Présentations Doctorants

DOC1
Jun 8, 2021, 3:30 PM
En Ligne

En Ligne

https://greenlight.lal.cloud.math.cnrs.fr/b/oli-yhz-7hx

Conveners

Présentations Doctorants: Présentations Etudiants 1

  • There are no conveners in this block

Présentations Doctorants: Présentations Doctorants 2

  • There are no conveners in this block

Présentations Doctorants: Présentations Doctorants 3

  • Olivier Blazy

Presentation materials

There are no materials yet.

  1. 9. Algorithme de dénombrement de points fixes
    Mr Charles Balthazar
    6/8/21, 3:30 PM
  2. 10. On the Besicovitch-Stability of Noisy Random Tilings
    Léo Gayral (Université de Toulouse)
    6/8/21, 3:55 PM

    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...

    Go to contribution page
  3. 11. Asymptotic probability of connected labeled objects and virtual species
    Khaydar Nurligareev (Université Paris 13)
    6/8/21, 4:20 PM

    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...

    Go to contribution page
  4. 12. Construction de coloriages de produits de groupes en dynamique symbolique
    Sacha Huriot (ENS Paris Scalay)
    6/8/21, 4:45 PM
  5. 13. Aperiodic Subshifts of Finite Type on Baumslag-Solitar Groups
    Julien Esnay (ENS-Lyon)
    6/9/21, 9:00 AM

    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...

    Go to contribution page
  6. 14. Augmented Broadcast Encryption with constant size ciphertext, from standard assumption
    Anaïs Barthoulot (Orange)
    6/9/21, 9:25 AM
  7. 15. Algorithmes de fractions continues multidimensionnelle
    Dr Mélodie Andrieu-Estevez (Institut de Mathématiques de Marseille)
    6/10/21, 9:30 AM
Building timetable...