Dejean's conjecture holds for n >= 30
James Currie, Narad Rampersad
TL;DR
This paper proves that Dejean's conjecture is valid for alphabet sizes of 30 or more, extending previous results to a broader range.
Contribution
It establishes the truth of Dejean's conjecture for all n >= 30, advancing the understanding of repetitive patterns in words.
Findings
Dejean's conjecture holds for n >= 30
Extended previous results to larger alphabet sizes
Confirmed conjecture for all n >= 30
Abstract
We extend Carpi's results by showing that Dejean's conjecture holds for n >= 30.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories · Analytic Number Theory Research · graph theory and CDMA systems