Articles by Matthieu Rosenfeld

A simple counting argument applied to lower bounds on the growth of subshifts

-- Matthieu Rosenfeld (LIRMM (Montpellier))

summary: Given a group G, a set of colors A and a set of forbidden patterns F, the subshift X_F is the set of colorings of G by A that avoid the patterns in F. I recently obtained a simple condition on the set of forbidden patterns F that implies ...

Binary pattern of length greater than 14 are abelian-2-avoidable

-- Matthieu Rosenfeld (GALAC, LRI)

Summary: Two words u and v are abelian equivalent if they are permutation of each other ("aabc" and "baca" are abelian equivalent). Let w be a word and P= P1...Pn (where the Pi are the letters of P) a pattern (a word over another alphabet), we say that w ...

Binary pattern of length greater than 14 are abelian-2-avoidable

-- Matthieu Rosenfeld (GALAC, LRI)

Summary: Two words u and v are abelian equivalent if they are permutation of each other ("aabc" and "baca" are abelian equivalent). Let w be a word and P= P1...Pn (where the Pi are the letters of P) a pattern (a word over another alphabet), we say that w ...