◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Matthieu Rosenfeld

5 papers hereh-index 216 citations4 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3
  • first author1
  • last author1

Across the 5 of 5 papers where every author was matched, so the position is known.

fields
  • math.CO4
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20242026
most citedUpper bounds on the average edit distance between two random strings

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

collaborators
Showing 2026Show all

2 papers · 1 filter

math.CO2026

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 G, each vertex is occupied by a player wearing a hat whose color is chosen from a set of q colors. Each player knows the graph and their pos…

cs.DM2026

The lonely runner conjecture holds for nine runners

Matthieu Rosenfeld

We prove that the lonely runner conjecture holds for nine runners. Our proof is based on a couple of improvements of the method we used to prove the conjecture for eight runners.

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.