ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let α∈T\alpha\in\mathbb{T} be a parameter, and let GCSn(α)GCS_n(\alpha) denote the generalized cylinder set associated with the first n+1n+1 letters of the itinerary I(α)I(\alpha). Say that α\alpha is strongly recurrent according to the preceding definition, and call it pre-periodic when its associated itinerary is pre-periodic. Digit-determining conjecture. If α\alpha is not strongly recurrent and is not pre-periodic, then the statement of Proposition~ still holds: for every integer L>0L>0, there exists an integer Lα>0L_\alpha>0 such that

GCSn(α)∩{hi(α)}i=1L=∅for all n≥Lα.GCS_n(\alpha)\cap\{h^i(\alpha)\}_{i=1}^L=\emptyset\quad\text{for all }n\geq L_\alpha.

The conjecture removes the non-weakly-pre-periodic hypothesis from Proposition~. If true, the paper notes that all points on T\mathbb{T} except for a set of Hausdorff dimension zero would satisfy CCECCE; the claim remains open in the supplied text.

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.