2000 character limit reached
On series $\sum c_k f(kx)$ and Khinchin's conjecture
Published 16 Oct 2012 in math.CA | (1210.4326v2)
Abstract: We prove the optimality of a criterion of Koksma (1953) in Khinchin's conjecture, settling a long standing open problem in analysis. Using this result, we also give a near optimal condition for the a.e.\ convergence of series $\sum_{k=1}\infty c_k f(kx)$ for $f\in L2$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.