Home

Since september 2021, I am an assistant professor (Maître de conférence) in Montpellier at LIRMM. I am member of the ESCAPE team and I teach in the computer-science department of IUT Montpellier-Sète.

My research interests are combinatorics, theoretical computer science and discrete mathematics. More precisely, I study combinatorics on words and graph theory. I frequently use computer assisted proofs.


In 2020-2021, I was a postdoc (ATER) at LIRMM.

In 2019-2020, I was a postdoc (ATER) at LIS.

In 2018-2019, I was a postdoc with the group of discrete mathematics of the University of Liège.

In 2017-2018, I was a postdoc at LIMOS.

I did my PhD thesis under the direction of Michaël Rao at the LIP. I worked on the avoidability of substructures in words. In particular, I studied the avoidability of patterns and powers in the usual, the abelian or the additive sens.


Contact

E-mail: firstname.surname 'at' gmail.com

Research

Publications
J14
Avoiding Square-Free Words on Free Groups, with Golnaz Badkobeh, Tero Harju and Pascal Ochem
Accepted in Theoretical Computer Science (arXiv)
J13
Avoiding squares over words with lists of size three amongst four symbols
Accepted in Mathematics of Computation (arXiv)
J12
Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge
In The Electronic Journal of Combinatorics (arXiv)
J11
Lower bounds on the growth of power-free languages over large alphabets
In Theory of Computing Systems (pdf)
J10
Avoidability of Palindrome Patterns, with Pascal Ochem
In The Electronic Journal of Combinatorics (arXiv)
C7
The growth rate over trees of any family of sets defined by a monadic second order formula is semi-computable
At SODA 2021 (pdf, the code)
J9
Another approach to non-repetitive colorings of graphs of bounded degree
In The Electronic Journal of Combinatorics (pdf)
C6
Avoidability of Additive Cubes over Alphabets of Four Numbers, with Florian Lietard
At DLT 2020 (pdf)
J8
On the binomial equivalence classes of finite words, with Marie Lejeune and Michel Rigo
In International Journal of Algebra and Computation (arXiv)
J7
How far away must forced letters be so that squares are still avoidable ?
In Mathematics of Computation (pdf, the C++ codes: lemma 7, check solution, lower bounds on d)
J6, C5
Templates for the k-binomial complexity of the Tribonacci word, with Marie Lejeune and Michel Rigo
In Advances in Applied Mathematics (pdf)
A preliminary version was presented at: Words 2019
J5
Bisplit graphs satisfy the Chen-Chvátal conjecture, with Laurent Beaudou and Giacomo Kahn
In Discrete Mathematics & Theoretical Computer Science
J4, C4
On Some Interesting Ternary Formulas, with Pascal Ochem
In The Electronic Journal of Combinatorics
A preliminary version was presented at: Words 2017
J3
Avoiding two consecutive blocks of same size and same sum over ℤ2, with Michaël Rao
In SIAM Journal on Discrete Mathematics (pdf, the C++ code)
J2, C3
Avoidability of formulas with two variables, with Pascal Ochem
In The Electronic Journal of Combinatorics
A preliminary version was presented at: Developments in Language Theory, 2016
C2
Every binary pattern of length greater than 14 is abelian-2-avoidable
At Mathematical Foundations of Computer Science, 2016 (html)
J1, C1
Avoidability of long k-abelian repetitions, with Michaël Rao
In Mathematics of Computation (arXiv)
A preliminary version was presented at: Mons Theoretical Computer Science Days 2014 (html)
Submited or In Progress
  • Avoiding large squares in trees and planar graphs, with Daniel Gonçalves and Pascal Ochem
    arXiv
  • Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters
    arXiv
  • It is undecidable whether the growth rate of a given bilinear system is 1
    arXiv
  • Finding lower bounds on the growth and entropy of subshifts over countable groups
    arXiv
Other manuscript
  • Bounding the number of (σ, ρ)-dominating sets in trees, forests and graphs of bounded pathwidth
    (pdf, the C++ code)
  • Avoiding or Limiting Regularities in Words, with Pascal Ochem and Michaël Rao.
    Book chapter of Berthé V., Rigo M. (eds) Sequences, Groups, and Number Theory. Trends in Mathematics. (html)
  • My PhD Thesis, under the direction of Michaël Rao.
Talks and Seminars
  • Compter différentes structures discrètes, CIEL seminar, LIRMM
    Online, January, 2022
  • A simple counting argument, Journées SDA2 2021
    Caen, November, 2021
  • Avoidability of Additive Cubes over Alphabets of Four Numbers, DLT 2021
    Online, August, 2021
  • Bounding the number of sets defined by a given MSO formula on trees, Séminaire ALGCo
    Online, July 7, 2021
  • A counting argument for combinatorics on words, ECO/Escape Séminar
    Online, April 28, 2021
  • The growth rate over trees of any family of sets defined by a monadic second order formula is semi-computable, Facets of Complexity Seminar
    Online, April 26, 2021
  • A simple counting argument, Entropy Compression and Related Methods meeting
    Online, March 10, 2021
  • The growth rate over trees of any family of sets defined by a monadic second order formula is semi-computable, SODA 2021
    Online, January 11, 2021
  • A simple proof technique to study avoidability of repetitions, One World Combinatorics on Words Seminar
    Online, October 26, 2020
  • A new Approach to Non-Repetitive Colorings of Graphs of Bounded Degree, Séminaire ALGCo
    Montpellier, October 8, 2020
  • Evitabilité des cubes additifs sur Z, Seminaire du thème Combinatoire Énumérative et Algébrique du LABRI
    Bordeaux, February 3, 2020
  • Éviter les cubes additifs sur des alphabets entiers, Séminaire Ernest
    Marseille, October 1, 2019
  • Avoiding additive powers in words, Séminaire de Théorie des nombres
    Nancy, April 25, 2019
  • Bounding the number of (σ, ρ)-dominating sets in trees, forests and graphs of bounded pathwidth, Séminaire ACRO
    Marseille, April 8, 2019
  • Bisplit graphs satisfy the Chen-Chvátal conjecture, GAMoC's team seminar
    Orléans. March 18, 2019
  • Bisplit graphs satisfy the Chen-Chvátal conjecture, Comprehensible Seminar
    Liège. January 29, 2019
  • Entropy compression and Thue list coloring number, Séminaire de l'équipe de math Discrète
    Liège. December 17, 2018
  • Avoidility of binary patterns in the abelian sens, Séminaire d'équipe GALAC
    Orsay. June 29, 2018
  • The Additive K'th Power Problem and Generalizations, 2018 SIAM conference on Discrete Math
    Denver. June 7, 2018
  • Avoidility of binary patterns in the abelian sens, Words and Complexity
    Lyon 1. February 23, 2018
  • Avoiding long abelian powers in words, Combinatorics on Words and Tilings
    CRM, Montréal. April 6, 2017
  • Éviter les carrés additifs sur ℤ², Seminaire Ernest
    Marseille. March 21, 2017
  • Every binary pattern of length greater than 14 is abelian-2-avoidable, MFCS 2016
    Krakow, August 23, 2016
  • Avoidability of formulas with two variables, DLT 2016
    Montréal, July 28, 2016
  • Avoiding repetitions in words, One Day Meeting in Discrete Structures 2
    LIP, Lyon. April 2016
  • Every long enough binary pattern is abelian 2-avoidable, Séminaire AlGCo
    LIRMM, Montpellier. February 2016
  • Avoidability of long abelian-squares, SeqBio, 2015
    Orsay. November 26, 2015
  • Décider si un mot morphic évite les puissances abeliennes, Séminaire de l'équipe Combinatoire & Algorithmes
    LITIS, Rouen. November 5, 2015
  • Décider si un mot morphic évite les puissances abeliennes, Séminaire MC2
    LIP, Lyon. July 9, 2015
  • Avoidability of long k-abelian repetitions, (html)
    Mons Theoretical Computer Science Days in Nancy, 2014

Teaching

2021-... (IUT Montpellier-Sète)

  • Interface web (HTML/CSS)
  • Programmation web côté serveur (PHP)
  • Programmation web côté client (JavaScript)
  • Algorithmique avancée

2020-2021 (IUT Montpellier-Sète)

  • UML
  • Bases de données
  • ASR - Introduction à Linux et au fonctionnement des ordinateurs
  • Algo1 et Algo1bis - Initiation à l'algorithmique et au java

2019-2020 (Aix-Marseille université)

  • Programmation C et système
  • Aspects probabilistes pour l’informatique
  • Calculabilité
  • Logique
  • Introduction à l'informatique
  • Mise en œuvre informatique - initiation à la programmation (en Python)

2017-2018

  • Système d'exploitation (à l'UCA)

2016-2017

  • LIFASR2 - Introduction réseaux et programmation web (à l'université de Lyon 1)
  • LIFAP1 - Initiation à la programmation en C (à l'université de Lyon 1)
  • FDI - Fondements de l'informatique (Automates, grammaires, machines de Turing, calculabilité...)
  • Accompagnateur de la visite de laboratoire au LIRMM des L3.

2015-2016

  • Rappels de math
  • Accompagnateur de la semaine sport-études
  • Projet Concours ACM - TP d'algorithmique sur thème de concours ACM

2014-2015