14 problems
- 0 votes0 replies1 view
The conjecture that the Fibonacci word's closed-rich constant attains the new upper bound
Let be the infinite Fibonacci word, let denote its closed-rich constant, and let be the golden ratio. Fibonacci closed-rich constant conjectur…
- 0 votes0 replies0 views
The BDL representation conjecture for primitive morphism fixed points
BDL representation conjecture. Such a geometric representation with BDL property exists if and only if at least one eigenvalue of has modulus strictly smaller than .
- 0 votes0 replies0 views
Puzynina–Zamboni palindromic-length conjecture for infinite words
Puzynina–Zamboni conjecture. If the palindromic lengths of all factors of are bounded, then is ultimately periodic.
- 0 votes0 replies1 view
Collins–Foniok–Korpelainen–Lozin conjecture on minimal hereditary graph classes of unbounded clique-width
Let an infinite word over the alphabet define a hereditary bipartite graph class by taking the finite induced subgraphs of the associated infinite graph whose vertices…
- 0 votes0 replies0 views
Frid's conjecture on bounded palindromic length sequences
Frid's conjecture. The palindromic length sequence of an infinite word is bounded if and only if the infinite word is ultimately periodic.
- 0 votes0 replies0 views
Exponential upper bound conjecture for prefix palindromic length of power-free words
Let be an infinite word that is -power-free for some , meaning that contains no factor equal to the th power of a nonempty word. Let be the minimum numb…
- 0 votes0 replies0 views
Prefix palindromic length conjecture for non-ultimately periodic words
Let be an infinite word. For , let denote the minimum number of concatenated palindromes needed to express the prefix of of length…
- 0 votes0 replies0 views
The ultimate periodicity conjecture for super-monochromatic factorisations
Let be an infinite word over an alphabet . A super-monochromatic factorisation of a suffix of is a factorisation into finite words such that all factors and ev…
- 0 votes0 replies1 view
Minimal-class characterization for graph classes defined by infinite words
Let be an infinite word over the alphabet . An infinite word is almost periodic if every factor of occurs in every sufficiently long factor o…
- 0 votes0 replies0 views
Uniqueness of a commuting carrier state
Fix glides and , and choose positive parameters for the state , while leaving the parameters of unspecified. Let denote the interaction map. Uniquenes…
- 0 votes0 replies0 views
Commuting states for powers of primitive glides
Let be a primitive glide if there is no glide with offset and integer such that . Let…
- 0 votes0 replies0 views
Spontaneous emergence of solitons in affine dKdV
Let be chosen, let and be glides with fixed reduced words and , and assume that…
- 0 votes0 replies1 view
The periodicity conjecture for monochromatically factorizable infinite words
Let be a finite alphabet, let be the set of non-empty finite words over , and let be the class of infinite words…
- 0 votes0 replies2 views
The conjecture that every non-periodic infinite word belongs to the coloring class
Let be a finite non-empty set and let . Write for the set of non-empty factors of . Say that belongs to if there is…