Minimum Critical Exponents for Palindromes
Jeffrey Shallit
TL;DR
This paper investigates the lowest critical exponent achievable by palindromic sequences over finite alphabets, providing insights into their combinatorial properties.
Contribution
It establishes the minimum critical exponents for all palindromes over finite alphabets, a novel combinatorial characterization.
Findings
Identifies the minimum critical exponents for palindromes
Provides a comprehensive classification over finite alphabets
Advances understanding of palindrome complexity
Abstract
We determine the minimum possible critical exponent for all palindromes over finite alphabets.
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
Topicssemigroups and automata theory · Coding theory and cryptography · Advanced Combinatorial Mathematics