Multi-Color Discrepancies - Extended Abstract -
暂无分享,去创建一个
Abstract Abstract We investigate the discrepancy problem in arbitrary numbers of colors, that is, we try to color the vertices of a hypergraph in such a way that each hyperedge contains the same number of vertices in each color. In this paper we present new results extending [DS99]. In particular, we exhibit near-tight multi-color discrepancy bounds for several classical problems. They extend Spencer's ‘six standard deviations’ result and the upper bound for the discrepancy of the arithmetic progressions due to Matousek and Spencer to arbitrary numbers of colors. We also give lower bounds for these discrepancies.
[1] J. Spencer. Six standard deviations suffice , 1985 .
[2] Thomas P. Hayes,et al. The Cost of the Missing Bit: Communication Complexity with Help , 1998, STOC '98.
[3] K. F. Roth. Remark concerning integer sequences , 1964 .
[4] Jiří Matoušek,et al. Discrepancy in arithmetic progressions , 1996 .
[5] Anand Srivastav,et al. Approximation of Multi-color Discrepancy , 1999, RANDOM-APPROX.