@article {17665, title = {The discrepancy of permutation families}, journal = {Unpublished manuscript}, year = {2001}, month = {2001///}, abstract = {In this note, we show that the discrepancy of any family of l permutations of[n] = {1,2,...,n} is O( √ llog n), improving on the O(llog n) bound due to Bohus (Random Structures \& Algorithms, 1:215{\textendash}220, 1990). In the case where l >= n, we show that the discrepancy is Θ(min{√nlog(2l/n),n}). }, author = {Spencer,JH and Srinivasan, Aravind and Tetali,P.} }