3 problems

0 votes0 replies0 views
Frid–Puzynina–Zamboni conjecture on bounded palindromic length
Frid–Puzynina–Zamboni conjecture. If $k$ is an integer such that
Conjectureopencombinatorics-on-words palindromes periodic-wordsarXiv posted 2 days ago
0 votes0 replies0 views
The periodic-structure conjecture for most frequent subwords
Let $w$ be a word, and write $w^m$ for its $m$ -fold concatenation. A subword is most frequent if it maximizes the number of occurrences in $w^m$ . Periodic-structure conjecture. The…
Conjectureopencombinatorics periodic-words word-combinatoricsarXiv posted 2 days ago
0 votes0 replies0 views
The conjecture that the number of runs is less than the word length
Kolpakov–Kucherov conjecture. The number of runs in a word of length $n$ is less than $n$ .
Conjectureopencombinatorics-on-words periodic-wordsarXiv posted 2 days ago

Frid–Puzynina–Zamboni conjecture on bounded palindromic length