Spherical cap L2 discrepancy – Blessing of dimensionality and a distance-kernel variant

We prove a dimension-explicit upper bound for the information-complexity (also called the inverse of the discrepancy) of the classical spherical cap 𝐿 2 discrepancy on the d -dimensional sphere 𝕊 𝑑 . For every fixed 𝜀 ∈ ( 0 , 1 ) , this bound implies that a single point suffices in all sufficiently large dimensions, which shows a “blessing of dimensionality” for the associated numerical integration problem. We then introduce a one-parameter family of distance reproducing kernels for the Sobolev space 𝐻 ( 𝑑 + 1 ) / 2 ⁡ ( 𝕊 𝑑 ) . For the balanced kernel 𝐾 ⁡ ( 𝒙 , 𝒚 ) = 1 − 1 √ 2 ⁢ ‖ 𝒙 − 𝒚 ‖ , a lower bound together with a random-point upper bound shows that the normalized information-complexity is Θ 𝜀 ⁡ ( 𝑑 ) for every fixed 𝜀 ∈ ( 0 , 1 ) . Thus its dependence on d is determined up to constants depending only on ε . Finally, we study the one-sided spherical cap discrepancy obtained by restricting the height parameter to [ 0 , 1 ] . We derive its kernel and Stolarsky's invariance principle explicitly. A sharp mean-distance inequality, attained by regular simplices, determines its normalized information-complexity exactly in all sufficiently large dimensions and proves strong polynomial tractability with optimal ε -exponent two.

Authors

Institutions

Publication Details

Journal
Journal of Complexity
Published
2026-11-13
DOI
https://doi.org/10.1016/j.jco.2026.102107
Citations
1
Primary Topic
Mathematical Approximation and Integration
Type
article
Field-Weighted Citation Impact
1.87

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Spherical cap L2 discrepancy – Blessing of dimensionality and a distance-kernel variant

Johann S. Brauchart, Friedrich Pillichshammer, Josef Dick
1 citations
Journal of Complexity
Mathematical Approximation and Integration
1.87
article

Spherical cap L2 discrepancy – Blessing of dimensionality and a distance-kernel variant

Johann S. Brauchart, Friedrich Pillichshammer, Josef Dick
article en
1 citations

Abstract

We prove a dimension-explicit upper bound for the information-complexity (also called the inverse of the discrepancy) of the classical spherical cap 𝐿 2 discrepancy on the d -dimensional sphere 𝕊 𝑑 . For every fixed 𝜀 ∈ ( 0 , 1 ) , this bound implies that a single point suffices in all sufficiently large dimensions, which shows a “blessing of dimensionality” for the associated numerical integration problem. We then introduce a one-parameter family of distance reproducing kernels for the Sobolev space 𝐻 ( 𝑑 + 1 ) / 2 ⁡ ( 𝕊 𝑑 ) . For the balanced kernel 𝐾 ⁡ ( 𝒙 , 𝒚 ) = 1 − 1 √ 2 ⁢ ‖ 𝒙 − 𝒚 ‖ , a lower bound together with a random-point upper bound shows that the normalized information-complexity is Θ 𝜀 ⁡ ( 𝑑 ) for every fixed 𝜀 ∈ ( 0 , 1 ) . Thus its dependence on d is determined up to constants depending only on ε . Finally, we study the one-sided spherical cap discrepancy obtained by restricting the height parameter to [ 0 , 1 ] . We derive its kernel and Stolarsky's invariance principle explicitly. A sharp mean-distance inequality, attained by regular simplices, determines its normalized information-complexity exactly in all sufficiently large dimensions and proves strong polynomial tractability with optimal ε -exponent two.

Journal of ComplexityVol. 99
Johannes Kepler University of Linz (AT), UNSW Sydney (AU), Graz University of Technology (AT)
Servicestelle für Mobilitätsprogramme des österreichischen Bundesministeriums für Bildung, Wissenschaft und Forschung, KulturKontakt Austria, Austrian Science Fund, Australian Research Council
Openalex Percentile: Top 23%
Mathematical Approximation and Integration
1.87
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon