ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ω=(ω0,ω1,…,ωk)∉F\pmb{\omega}=(\omega_0,\omega_1,\ldots,\omega_k)\notin\mathcal{F} be a finite-length word that contains no τ∈F\pmb{\tau}\in\mathcal{F} as a subsequence of consecutive symbols. Positive-density conjecture. The limit

lim⁡n→∞∣{M≤n:  ∥M−j∥∞=ωj for j=0,1,…,k}∣n\lim_{n\to\infty}\frac{\left|\left\{M\leq n:\;\|M-j\|_\infty=\omega_j\text{ for }j=0,1,\ldots,k\right\}\right|}{n}

exists and is strictly positive. This is the formal version of the paper’s stronger density claim for admissible words. Its status is not resolved in the supplied material.

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.