The exponent of discrepancy is at least 1. 0669 (Q1279909): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710362833254
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcom.1998.0485 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987221836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON IRREGULARITIES OF DISTRIBUTION II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences, discrepancies and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for computing the $L_2$-discrepancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mean square discrepancy of randomized nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4767350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On irregularities of distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On irregularities of distribution, IV / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4322621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exponent of discrepancy is at most 1.4778... / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case complexity of multivariate integration / rank
 
Normal rank

Latest revision as of 17:25, 28 May 2024

scientific article
Language Label Description Also known as
English
The exponent of discrepancy is at least 1. 0669
scientific article

    Statements

    The exponent of discrepancy is at least 1. 0669 (English)
    0 references
    23 August 1999
    0 references
    Let \(P\subset[0,1)^d\) be an \(n\)-point set and \(B_x=\prod^d_{k=1}[0,x_k)\subset[0,1)^d\). Let \[ D(x)=\text{vol}(B_x)-w(P\cap B_x), \] where \(w\) is a weighted function, for example \(w(x)=1/n\) \((n\in P)\). Let \(p^*\) be the infimum of \(p\) such that for all \(d\geq 1\) and \(\varepsilon>0\) there exists a weighted set of at most \(K(p)\varepsilon^{-p}\) points in \([0,1)^d\) with \(L_2\)-discrepancy at most \(\varepsilon\). The author proves that \(p^*\geq 1.0488 z\) by use of Roth's method on the lower estimation of discrepancy.
    0 references
    0 references
    \(L_2\)-discrepancy
    0 references
    weighted set
    0 references
    lower estimation of discrepancy
    0 references
    0 references

    Identifiers