Maximal run-length function with constraints: a generalization of the Erdos-R\'enyi limit theorem and the exceptional sets

Abstract

Let A=\Ai\i=1∞ be a sequence of sets with each Ai being a non-empty collection of 0-1 sequences of length i. For x∈ [0,1), the maximal run-length function n(x,A) (with respect to A) is defined to the largest k such that in the first n digits of the dyadic expansion of x there is a consecutive subsequence contained in Ak. Suppose that n∞(2|An|)/n=τ for some τ∈ [0,1] and one additional assumption holds, we prove a generalization of the Erdos-R\'enyi limit theorem which states that \[n∞n(x,A)2n=11-τ\] for Lebesgue almost all x∈ [0,1). For the exceptional sets, we prove under a certain stronger assumption on A that the set \[\x∈ [0,1): n∞n(x,A)2n=0 and n∞n(x,A)=∞\\] has Hausdorff dimension at least 1-τ.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…