Discrepancy and distance between sets

DOI10.1016/0019-3577(92)90008-9MaRDI QIDQ1196262zbMATH OpenOpenAlexFDO

Authors Gerald Myerson

Publication date 15 December 1992

Published in Indagationes Mathematicae. New Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0019-3577(92)90008-9

zbMATH Keywords

\(L^ p\)-discrepancy \(L^ p\)-distance discrepancy finite subsets of equal cardinality

Mathematics Subject Classification ID

Irregularities of distribution, discrepancy (11K38)

Review text

Let \(S,T\) denote finite subsets of \([0,1]\) of equal cardinality. Then \(| S-T|=\min_ f \max_{s\in S}| f(s)-s|\) denotes the distance of the two sets, where the min runs through all bijections \(f: S\to T\). \textit{J. G. van der Corput} and \textit{C. Pisot} [Indag. Math. 1, 476-486, 554-565, 713-722 (1939; Zbl 0021.29701, Zbl 0022.11604, Zbl 0022.11605)] have shown that \(| D(S)-D(T)|\leq| S-T|\), where \(D(S)\) denotes the usual discrepancy of the point set \(S\) (and similarly for \(T\)). The present paper starts with a partial converse \[ | S-T|\leq D(S)+D(T)-1/n, \] \(n\) denoting the common cardinality of \(S\) and \(T\). Then similar results are proved for the \(L^ p\)-discrepancy \(D_ p(S)\) and the \(L^ p\)-distance \[ \| S-T\|_ p=\min_ f \sum_{s\in S}| f(s)-s|^ p. \] For instance, it is shown that \(| D_ p^ p(S)-D_ p^ p(T)|\leq c | S-T|\) with some constant \(1\leq c\leq 2\).

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Discrepancy and distance between sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196262)