1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
The Lovász Local Lemma Is Sharp for the Hat Guessing Number
Thomas Delépine, Matthieu Rosenfeld
In the hat guessing game on a graph , each vertex is occupied by a player wearing a hat whose color is chosen from a set of colors. Each player knows the graph and their pos…
The lonely runner conjecture holds for eight runners
Matthieu Rosenfeld
We prove that the lonely runner conjecture holds for eight runners. Our proof relies on a computer verification and on recent results that allow bounding the size of a minimal coun…
Local obstructions in sequences revisited
Matthieu Rosenfeld, Alexander Shen
In this article, we consider some simple combinatorial game and a winning strategy in this game. This game is then used to prove several known results about non-repetitive sequence…
Upper bounds on the average edit distance between two random strings
Matthieu Rosenfeld
We study the average edit distance between two random strings. More precisely, we adapt a technique introduced by Lueker in the context of the average longest common subsequence of…