activity
20152023
most citedFinding lower bounds on the growth and entropy of subshifts over countable groups

1 citations · 2 across the 10 of their papers we have counts for

collaborators
Showing 2020 · math.COShow all

2 papers · 2 filters

math.CO2020

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…

math.CO2020

Nice formulas, -formulas, and palindrome patterns

Pascal Ochem, Matthieu Rosenfeld

We characterize the formulas that are avoided by every -free word for some . We study the avoidability index of formulas whose fragments are of the form . The largest…