
Ann wins the nonrepetitive game over four letters and the eraserepetition game over six letters
We consider two games between two players Ann and Ben who build a word t...
read it

Avoiding squares over words with lists of size three amongst four symbols
In 2007, Grytczuk conjecture that for any sequence (ℓ_i)_i≥1 of alphabet...
read it

Lowerbounds on the growth of powerfree languages over large alphabets
We study the growth rate of some powerfree languages. For any integer k...
read it

Another approach to nonrepetitive colorings of graphs of bounded degree
We propose a new proof technique that aims to be applied to the same pro...
read it

The growth rate over trees of any family of set defined by a monadic second order formula is semicomputable
Monadic second order logic can be used to express many classical notions...
read it

On the binomial equivalence classes of finite words
Two finite words u and v are kbinomially equivalent if, for each word x...
read it

How far away must forced letters be so that squares are still avoidable?
We describe a new nonconstructive technique to show that squares are av...
read it

Bisplit graphs satisfy the ChenChvátal conjecture
In this paper, we give a lengthy proof of a small result! A graph is bis...
read it
Matthieu Rosenfeld
is this you? claim profile