Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
This proves
L229
at author-recorded standing. Logarithms are natural. We use the following
form of the definition of Hausdorff dimension: if a set admits interval
covers with maximum length tending to zero and the sum of the sth
powers of the lengths tending to zero, its dimension is at most s.
Dimension is stable under countable unions, in the sense that the
dimension of the union is the supremum of the dimensions.
Growth and the sparse integer vector
Let (an) be one of the sequences in the statement, and put
D={n:an=pn}. For each fixed 0<η<1, density zero provides,
for all sufficiently large n, indices outside D in both
[(1−η)n,n] and [n,(1+η)n]. Monotonicity and the prime number
theorem sandwich an/pn between 1−η+o(1) and
1+η+o(1). Thus
an∼pn∼nlogn.(1)
In particular the series converges. For some integer B≥1,
an≤Bnlog(n+1),pn≤Bnlog(n+1)(n≥1).(2)
We first restrict to the class with a fixed B; the full class is its
countable union over B.
These are integers: an is odd for n≥2, and the two position
differences an−pn and an+1−pn+1 are divisible by 2qn,
because qn∣qn+1. Both hn and hn′ are positive. The
support E={n≥2:sn=0} is contained in
D∪{n:n+1∈D}, so E has density zero. Moreover, for N≥3,
For sufficiently large N, all n≥⌈N⌉ satisfy
qn≥clogn≥(c/2)logN. Consequently
n=⌈N⌉∑N∣sn∣≤CBN,CB=max(1,6B/c).(5)
For the earlier coordinates, (4) and qn≥1 give the crude but
sufficient individual bound ∣sn∣≤3BNlogN.
Counting prefixes uniformly
Fix 0<ρ<1/4 and an integer N0. Restrict the class further by
requiring
∣E∩[2,N]∣≤ρN(N≥N0).(6)
Every sequence in the class with fixed B belongs to one of these
classes for some N0, for each fixed ρ.
There are only finitely many choices of a1,a2 under (2). The first
⌈N⌉ coordinates of (sn) have at most
(6BNlogN+1)⌈N⌉=exp(oB(N))(7)
possibilities. For the remaining coordinates, put
M=⌈CBN⌉. A vector with support of size t has at most
(tN) choices of support and 2t choices of signs. The number
of positive integer t-tuples with sum at most M is
(tM), including the value 1 when t=0. By (5)--(6), an upper
bound for their total number is therefore
0≤t≤⌊ρN⌋∑(tN)2t(tM).(8)
For 1≤t≤ρN the usual bound
(tu)≤(eu/t)t and M≤(CB+1)N give
(tN)2t(tM)≤(2e2(CB+1)(N/t)2)t≤exp(NfB(ρ)),(9)
where
fB(ρ)=ρlogρ22e2(CB+1)⟶0(ρ↓0).
The last inequality follows because
ulog(2e2(CB+1)/u2) is increasing for 0<u≤1/4.
Equations (7)--(9), with the at most N+1 summands in (8), show that
the number of possible prefixes through index N is at most
exp(NfB(ρ)+oB(N)).(10)
Here we may count vectors through gap index N, since this only
overcounts position prefixes through N. Each vector and a1,a2
determine the corresponding position prefix by (3). Ignoring positivity
or congruence restrictions in the upper count causes no difficulty.
Covers of the series values
By (2), the tail after index N is bounded uniformly in this class by
0≤n>N∑2nan≤CB′NlogN2−N(11)
for a constant CB′. Each prefix counted in (10) therefore specifies
one interval of this length covering all its series values. For any
s>fB(ρ)/log2, the sum of the sth powers of these lengths is
at most
exp(N(fB(ρ)−slog2)+oB,s(N))⟶0.(12)
Thus the set of series values in the class (2), (6) has Hausdorff
dimension at most fB(ρ)/log2. Taking its countable union over
N0 gives the same bound for the entire class with fixed B.
As ρ can tend to zero, that class has dimension zero. Finally take
the countable union over B. This proves L229. □