Poisson genericity of Fibonacci, Rudin–Shapiro, and Thue–Morse sequences
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 , 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 -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.