Premium
On the discrepancy of combinatorial rectangles
Author(s) -
Alon Noga,
Doerr Benjamin,
Łuczak Tomasz,
Schoen Tomasz
Publication year - 2002
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.10055
Subject(s) - struct , combinatorics , mathematics , combinatorial analysis , discrete mathematics , computer science , programming language
Let ℬ d ndenote the family which consists of all subsets S 1 × … × S d , where S i ⊆ [ n ], and S i ≠ ∅, for i = 1, … , d . We compute the L 2 ‐discrepancy of ℬ d nand give estimates for the L p ‐discrepancy of ℬ d nfor 1 ≤ p ≤ ∞.© 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 205–215, 2002