On Circular Threshold Words and Dejean's Conjecture
Research Paper#Combinatorics, Theoretical Computer Science🔬 Research|Analyzed: Jan 3, 2026 08:54•
Published: Dec 31, 2025 03:16
•1 min read
•ArXivAnalysis
This paper revisits and improves upon the author's student work on Dejean's conjecture, focusing on the construction of threshold words (TWs) and circular TWs. It highlights the use of computer verification and introduces methods for constructing stronger TWs with specific properties. The paper's significance lies in its contribution to the understanding and proof of Dejean's conjecture, particularly for specific cases, and its exploration of new TW construction techniques.
Key Takeaways
- •The paper focuses on Dejean's conjecture and the construction of threshold words (TWs).
- •It presents improvements to the author's previous student work.
- •The paper introduces methods for constructing circular TWs and stronger TWs.
- •Computer verification is used in the proof methods.
- •The work contributes to the understanding and proof of Dejean's conjecture.
Reference / Citation
View Original"The paper presents an edited version of the author's student works (diplomas of 2011 and 2013) with some improvements, focusing on circular TWs and stronger TWs."