AbstractThiémard (J. Complexity 17(4) (2001) 850) suspects that his upper bound for the discrepancy B(P,x⇒) is bounded below by a measure for the tightness of the partition P. We present a counterexample but also prove that for a certain class of partitions the assumption is valid. The partitions used in Thiémard's algorithm are all part of this class
AbstractK. F. Roth (1964, Acta. Arith.9, 257–260) proved that the discrepancy of arithmetic progress...
In [LOO08], it was proposed that a concentration-of-measure inequality known as Mc-Diarmid’s inequal...
AbstractIn 2001 Heinrich, Novak, Wasilkowski and Woźniakowski proved that for every s≥1 and N≥1 ther...
International audienceLet $d\ge 2$ be an integer. We prove that for almost all partitions of an inte...
AbstractWe show new lower bounds for the star-discrepancy and its inverse for subsets of the unit cu...
AbstractIn many applications it has been observed that hybrid-Monte Carlo sequences perform better t...
A mixed sequence is a sequence in the $s$-dimensional unit cube which one obtains by concatenating a...
AbstractWe propose an algorithm to compute upper and lower bounds for the star discrepancy of an arb...
A mixed sequence is a sequence in the $s$-dimensional unit cube which one obtains by concatenating a...
AbstractFor numerical integration in higher dimensions, bounds for the star-discrepancy with polynom...
AbstractWe prove a lemma that is useful for obtaining upper bounds for the number of partitions with...
AbstractThe well-known star discrepancy is a common measure for the uniformity of point distribution...
AbstractIn the first part of this paper we derive lower bounds and constructive upper bounds for the...
AbstractWe provide a deterministic algorithm that constructs small point sets exhibiting a low star ...
13 pagesIt is proved that the summands of almost all unequal partitions of $n$ are well-distributed ...
AbstractK. F. Roth (1964, Acta. Arith.9, 257–260) proved that the discrepancy of arithmetic progress...
In [LOO08], it was proposed that a concentration-of-measure inequality known as Mc-Diarmid’s inequal...
AbstractIn 2001 Heinrich, Novak, Wasilkowski and Woźniakowski proved that for every s≥1 and N≥1 ther...
International audienceLet $d\ge 2$ be an integer. We prove that for almost all partitions of an inte...
AbstractWe show new lower bounds for the star-discrepancy and its inverse for subsets of the unit cu...
AbstractIn many applications it has been observed that hybrid-Monte Carlo sequences perform better t...
A mixed sequence is a sequence in the $s$-dimensional unit cube which one obtains by concatenating a...
AbstractWe propose an algorithm to compute upper and lower bounds for the star discrepancy of an arb...
A mixed sequence is a sequence in the $s$-dimensional unit cube which one obtains by concatenating a...
AbstractFor numerical integration in higher dimensions, bounds for the star-discrepancy with polynom...
AbstractWe prove a lemma that is useful for obtaining upper bounds for the number of partitions with...
AbstractThe well-known star discrepancy is a common measure for the uniformity of point distribution...
AbstractIn the first part of this paper we derive lower bounds and constructive upper bounds for the...
AbstractWe provide a deterministic algorithm that constructs small point sets exhibiting a low star ...
13 pagesIt is proved that the summands of almost all unequal partitions of $n$ are well-distributed ...
AbstractK. F. Roth (1964, Acta. Arith.9, 257–260) proved that the discrepancy of arithmetic progress...
In [LOO08], it was proposed that a concentration-of-measure inequality known as Mc-Diarmid’s inequal...
AbstractIn 2001 Heinrich, Novak, Wasilkowski and Woźniakowski proved that for every s≥1 and N≥1 ther...
DOI
Add to ORKG