ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let an infinite sequence over a finite alphabet be formed either by concatenating the Fibonacci numbers in any base, by taking the Rudin–Shapiro sequence along the squares, or by taking the Thue–Morse sequence along the squares. A sequence is 1-Poisson generic if its visit statistics to shrinking targets converge to the Poisson law with parameter 11, in the sense defined in the source. The conjecture. The sequences obtained by concatenating the Fibonacci numbers in any base, the Rudin–Shapiro sequence along the squares, and the Thue–Morse sequence along the squares are 11-Poisson generic. Almost-everywhere Poisson genericity and computable examples are known, but no explicit example was known in the surrounding discussion; these proposed examples are presented as conjectural instances.

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.