论文信息 - The discrepancy of permutation families

The discrepancy of permutation families

In this note, we show that the discrepancy of any family of ‘ permutations of [n] = f1; 2;:::;ng is O( p ‘ logn), improving on the O(‘ logn) bound due to Bohus (Random Structures & Algorithms, 1:215{220, 1990). In the case where ‘ n, we show that the discrepancy is (min f p n log(2‘=n);ng).

Aravind Srinivasan | Prasad Tetali | Joel Spencer

[1] J. Beck. Irregularities of Distribution, Ii , 1988 .

[2] A. Odlyzko. Asymptotic enumeration methods , 1996 .

[3] J. Spencer. Six standard deviations suffice , 1985 .

[4] J. Spencer. Ten lectures on the probabilistic method , 1987 .

[5] J. Beck,et al. Discrepancy Theory , 1996 .

[6] Jiří Matoušek,et al. Discrepancy in arithmetic progressions , 1996 .

[7] Joel Spencer. Ten Lectures on the Probabilistic Method: Second Edition , 1994 .

[8] József Beck,et al. Roth’s estimate of the discrepancy of integer sequences is nearly sharp , 1981, Comb..

[9] Géza Bohus,et al. On the Discrepancy of 3 Permutations , 1990, Random Struct. Algorithms.