ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T(n,k)\textbf{T}(n,k) denote the set of strings of length nn over the alphabet of symbols used in the paper. Let γ∈T(m,k)\gamma\in\textbf{T}(m,k) be a string containing a symbol a≤k−2a\leq k-2, and let S⊆T(n,k)\textbf{S}\subseteq\textbf{T}(n,k), for some n≥mn\geq m, be the set of strings not containing γ\gamma as a cyclic substring. Forbidden-substring conjecture. The greedy algorithm starting from knk^n generates a universal cycle for S\textbf{S}. This would complete the known partial classification of forbidden substrings for which the greedy algorithm generates a universal cycle; the claim concerns the remaining case in which the forbidden string contains a symbol at most k−2k-2.

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.