Non-property-PP conjecture for the Tribonacci word
Statement
Let denote the property that, for infinitely many , every factor of length is a product of two palindromes. Let the Tribonacci word be the standard infinite word generated by the Tribonacci substitution. Tribonacci non-property-PP conjecture. The Tribonacci word does not have property . This would show that the property studied for Sturmian words does not extend to episturmian words; the source presents the claim as open and notes that it might in principle be resolved using the Walnut Prover.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.