Skip to content

Erdős problem 996

Let n1<n2<⋯n_1<n_2<\cdots be a lacunary sequence of integers and f∈L2([0,1])f\in L^2([0,1]) with nnth Fourier partial sum fnf_n. Is there an absolute constant C>0C>0 such that if ∥f−fn∥2≪(log⁡log⁡log⁡n)−C\| f-f_n\|_2 \ll (\log\log\log n)^{-C} then 1N∑k≤Nf({αnk})→∫01f\frac{1}{N}\sum_{k\leq N}f(\{\alpha n_k\})\to\int_0^1 f for almost every α\alpha? A preprint answers this negatively via a dyadic spike-block counterexample.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:ec8d032985f4a8646e41a8170d21e58199c51593d43a0d8ffcfc43c0ea59a4a2
Metadata
sha256:8a0e2bcae289551a812ed0afd0af456fc11ae05f6b7b10176944b4d41127c2ec
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:00fe7a7752179b9b172f96e419e9189fd84c851bdfe867a96231ce2ca940bb44
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb