Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 22 min ago
PreprintCC BY 4.0arXiv

Exact universal normalizations for the Gál--Koksma lemma

Abstract

The Gál--Koksma lemma is a standard tool for converting quadratic-mean estimates on consecutive blocks into almost-everywhere bounds for partial sums, without assumptions of independence, mixing, or orthogonality. A natural open problem is to determine exactly which universal growth normalizations are forced by this hypothesis alone. The corresponding universal normalization problem under the abstract consecutive-block second-moment hypothesis is resolved by characterizing exactly which non-decreasing normalizations are valid uniformly over the entire admissible class. The resulting necessary-and-sufficient summability criterion is sharp even for bounded exactly centred systems with constant majorants and exact linear block variance, and determines the critical logarithmic and iterated-logarithmic thresholds.

Related

  1. An exact hierarchy for Lebesgue's universal covering constant and a certified 0.834 lower bound
    Shuai Zeng
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  2. Exact fillings using universal covers in Floer theory
    Shahnaz Shamim Shahul
    arXivPreprintCC BY 4.0Full textGeometry & topologyarXiv
  3. Universal Asymptotics and Exact Enumeration of Eulerian Maps
    Ahmad Barhoumi, Roozbeh Gharakhloo, Nathan Hayford
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  4. The triangular lattice minimises the planar Yukawa energy at every density and for every finite mixture of screening lengths: kernel-checked corollaries of planar universal optimality, a human proof, and an exact-potential CVODE consistency study
    Xavier Callens
    Zenodo (CERN European Organization for Nuclear Research)PreprintCC BY11 citedNumerical analysis & scientific computingOpenAlex
  5. The Composition Lemma for n-dependence
    Artem Chernikov, Yuyan He
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsLogic & foundationsarXiv
BibTeX
@misc{lee2026exact,
  title = {{Exact universal normalizations for the Gál--Koksma lemma}},
  author = {Ying Wai Lee},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.18198},
  eprint = {2609.18198},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.18198},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Exact universal normalizations for the Gál--Koksma lemma
AU  - Ying Wai Lee
PY  - 2026
DA  - 2026/09/16
PB  - arXiv
DO  - 10.48550/arxiv.2609.18198
UR  - https://arxiv.org/abs/2609.18198
AB  - The Gál--Koksma lemma is a standard tool for converting quadratic-mean estimates on consecutive blocks into almost-everywhere bounds for partial sums, without assumptions of independence, mixing, or orthogonality. A natural open problem is to determine exactly which universal growth normalizations are forced by this hypothesis alone. The corresponding universal normalization problem under the abstract consecutive-block second-moment hypothesis is resolved by characterizing exactly which non-decreasing normalizations are valid uniformly over the entire admissible class. The resulting necessary-and-sufficient summability criterion is sharp even for bounded exactly centred systems with constant majorants and exact linear block variance, and determines the critical logarithmic and iterated-logarithmic thresholds.
ER  -