I am currently a postdoc researcher at LIMOS. My current topic of research is enumeration on graphs. My research interests are combinatorics and theoretical computer science.

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.

One example of such a result is: There exists an infinite sequence over a finite subset of ℤ^{2} that does not
contain two consecutive factors of same size and same sum.
It is still open whether it is also possible over a finite subset of ℤ or not
(Note that Szemerédi's theorem implies that it is not possible without the "same size" condition).

## Contact

- E-mail: firstname.surname 'at' gmail.com
- Adresse postale: LIMOS - Campus Universitaire des Cézeaux 1 rue de la chebarde TSA 60125 - CS 60026 63178 Aubiere Cedex France - France.