1 citations · 1 across the 7 of their papers we have counts for
12 papers
It is undecidable whether the growth rate of a given bilinear system is 1
Matthieu Rosenfeld
We show that there exists no algorithm that decides for any bilinear system if the growth rate of is . This answers a question of Bui who showed that if the coef…
Avoiding large squares in trees and planar graphs
Daniel Gonçalves, Pascal Ochem, Matthieu Rosenfeld
The Thue number of a graph is the minimum number of colors needed to color without creating a square on a path of . For a graph class , is the supremum…
Avoiding squares over words with lists of size three amongst four symbols
Matthieu Rosenfeld
In 2007, Grytczuk conjecture that for any sequence of alphabets of size there exists a square-free infinite word such that for all , the -th letter…
Avoiding Square-Free Words on Free Groups
Golnaz Badkobeh, Tero Harju, Pascal Ochem +1
We consider sets of factors that can be avoided in square-free words on two-generator free groups. The elements of the group are presented in terms of 0,1,2,3 such that 0 and 2 (re…
Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge
Matthieu Rosenfeld
We show that for every graph and every graph obtained by subdividing each edge of at least , is nonrepetitively 3-colorable. In fact, we show that $…
Another approach to non-repetitive colorings of graphs of bounded degree
Matthieu Rosenfeld
We propose a new proof technique that aims to be applied to the same problems as the Lovász Local Lemma or the entropy-compression method. We present this approach in the context o…