An elementary proof of a lower bound for the inverse of the star discrepancy

DOI10.1016/J.JCO.2022.101713OpenAlexW4320169707MaRDI QIDQ2685069

Stefan Steinerberger

Publication date: 17 February 2023

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.13471

zbMATH Keywords

inversecurse of dimensionalitystar discrepancy

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Irregularities of distribution, discrepancy (11K38)

Cites Work

• Covering numbers, dyadic chaining and discrepancy
• Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy
• Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples
• A lower bound for the discrepancy of a random point set
• On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• The inverse of the star-discrepancy depends linearly on the dimension
• Irregularities of Distributions and Extremal Sets in Combinatorial Complexity Theory
• Probabilistic Lower Bounds for the Discrepancy of Latin Hypercube Samples
• A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy
• Improving a constant in high-dimensional discrepancy estimates

This page was built for publication: An elementary proof of a lower bound for the inverse of the star discrepancy