Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy

Michael Gnewuch

Abstract

We improve the best known upper bound for the bracketing number of $d$-dimensional axis-parallel boxes anchored in $0$ (or, put differently, of lower left orthants intersected with the $d$-dimensional unit cube $[0,1]^d$). More precisely, we provide a better upper bound for the cardinality of an algorithmic bracketing cover construction due to Eric Thiémard, which forms the core of his algorithm to approximate the star discrepancy of arbitrary point sets from [E. Thiémard, An algorithm to compute bounds for the star discrepancy, J.~Complexity 17 (2001), 850 -- 880]. Moreover, the new upper bound for the bracketing number of anchored axis-parallel boxes yields an improved upper bound for the bracketing number of arbitrary axis-parallel boxes in $[0,1]^d$. In our upper bounds all constants are fully explicit.

Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy

Abstract

We improve the best known upper bound for the bracketing number of -dimensional axis-parallel boxes anchored in (or, put differently, of lower left orthants intersected with the -dimensional unit cube ). More precisely, we provide a better upper bound for the cardinality of an algorithmic bracketing cover construction due to Eric Thiémard, which forms the core of his algorithm to approximate the star discrepancy of arbitrary point sets from [E. Thiémard, An algorithm to compute bounds for the star discrepancy, J.~Complexity 17 (2001), 850 -- 880]. Moreover, the new upper bound for the bracketing number of anchored axis-parallel boxes yields an improved upper bound for the bracketing number of arbitrary axis-parallel boxes in . In our upper bounds all constants are fully explicit.
Paper Structure (2 sections, 6 theorems, 62 equations)

This paper contains 2 sections, 6 theorems, 62 equations.

Table of Contents

  1. Introduction
  2. Revisiting an Algorithm of Eric Thiémard

Key Result

Theorem 2.1

For each call of decompose$(P,j)$ during the decomposition process of $I^d$, where $P = [\alpha^P, \beta^P)$, we have where

Theorems & Definitions (14)

  • Theorem 2.1: Thi01a
  • Corollary 2.2: Thi01a
  • Remark 2.3
  • Lemma 2.4
  • proof
  • Definition 2.5
  • Definition 2.6
  • Theorem 2.7: Thi01a
  • Lemma 2.8
  • proof
  • ...and 4 more