activity
20042022
most citedEverything is illuminated

30 citations · 73 across the 9 of their papers we have counts for

collaborators

9 papers

math.CO2022★ 1 cited

Asymptotics for connected graphs and irreducible tournaments

Thierry Monteil, Khaydar Nurligareev

We compute the whole asymptotic expansion of the probability that a large uniform labeled graph is connected, and of the probability that a large uniform labeled tournament is irre…

math.DS2014★ 30 cited

Everything is illuminated

Samuel Lelievre, Thierry Monteil, Barak Weiss

We study geometrical properties of translation surfaces: the finite blocking property, bounded blocking property, and illumination properties. These are elementary properties which…

cs.CC2012★ 5 cited

Symmetric Determinantal Representations in Characteristic 2

Bruno Grenet, Thierry Monteil, Stéphan Thomassé

This paper studies Symmetric Determinantal Representations (SDR) in characteristic 2, that is the representation of a multivariate polynomial P by a symmetric matrix M such that P=…

cs.DM2011★ 3 cited

The complexity of tangent words

Thierry Monteil

In a previous paper, we described the set of words that appear in the coding of smooth (resp. analytic) curves at arbitrary small scale. The aim of this paper is to compute the com…

math.DS2006★ 13 cited

Quasiperiodic infinite words : multi-scale case and dynamical properties

Thierry Monteil, Solomon Marcus

An infinite word x is said to be quasiperiodic if there exists a finite word q such that x is covered by occurrences of q (such a q is called a quasiperiod of x). Using the notion…

math.DS2006★ 7 cited

A homological condition for a dynamical and illuminatory classification of torus branched coverings

Thierry Monteil

We prove that, for translation surfaces whose homology is generated by the periodic orbits, the notions of - finite blocking property - pure periodicity - torus branched covering a…