ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let 1/2<ρ<11/2<\rho<1 be a scaling factor, and let {αi}i∈I\{\alpha^i\}_{i\in I} be the reduced banned words, enumerated in nondecreasing order of length, with I⊆NI\subseteq\mathbb{N}. For each i∈Ii\in I, write

γi=αi∣[1,∣αi∣−1].\gamma^i=\alpha^i|_{[1,|\alpha^i|-1]}.

A doubled-prefix conjecture asserts that, for every i∈Ii\in I, the concatenation γiγi\gamma^i\gamma^i does not contain any αj\alpha^j with j≤ij\leq i as a subword.

This condition is intended to support the observed recursive pattern in the reduced banned words and the converse of the sufficient condition for an iterated function system to be of finite type. The source says that proving the assertion or finding a counterexample is very difficult; the supplied status evidence marks it as disproved, although no explicit counterexample is provided here.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.