Prefer a chat interface with context about you and your work?
A concrete upper bound in the uniform law of the iterated logarithm
Kaufman and Philipp [6] and Dhompongsa [3] proved a uniform law of the iterated logarithm for ∑ f ( n k t ). In this paper, we give a concrete upper bound for these results. Our bound is best possible in some cases.