Answers are grounded in this paper and cite their sources.
A recent note of Goda disproves the Kazashi--Sloan counting conjecture and proves, without that conjecture, the dimension-independent averaged squared worst-case-error estimate \(^2(n)=O(n-1/2log n)\) for unshifted rank-one lattice rules in weighted unanchored Sobolev spaces of smoothness one, under the corresponding summability condition on the weights. The same note asks whether this rate can be improved. We give an affirmative answer. The key observation is the exact identity \(∑κ=1ⁿ⁻¹T_n(κ)=2H(n-1)/2^2\), combined with the uniform Kazashi--Sloan estimate \(T_n(κ)≤ π^2/6\). This replaces threshold counting by a first-moment-to-all-moments estimate. Consequently, for every odd prime \(n\) and every finite dimension \(d\), the averaged squared worst-case error is bounded by \(n⁻¹(log n)^2\) times an explicit weighted subset sum. For product weights, this proves the existence of an unshifted rank-one lattice rule satisfying \(e(n, z)=O_γ(n-1/2log n)\), uniformly in \(d\), whenever \(∑j≥1γ_j<∞\). Numerical experiments confirm the exact arithmetic identity, illustrate the resulting moment conversion, and compare the new bounds with the previous rate scale.
No takes yet. Share an insight, caveat, or question.
Yang et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: