Résumé : Say, you have a fixed set of tiles and want to count how many ways you can tile a rectangle of a fixed height, or a square. What kind of sequences can be obtained? This seeming innocent question is related to a number of beautiful problems in enumerative and asymptotic combinatorics. I will give a broad overview of the subject and discuss the types of integer sequences that arise along the way. I will also mention a few curious conjectures.

 [Slides.pdf] [vidéo]

Dernière modification : Monday 18 March 2024

Contact pour cette page : Cyril.Banderier at lipn.univ-paris13.fr