论文信息 - Constructing Small Sets that are Uniform in Arithmetic Progressions

Constructing Small Sets that are Uniform in Arithmetic Progressions

For every integer N , we explicitly construct a subset of residues mod N of size(log N ) o (1) which is nearly uniformly distributed in every arithmetic progression modulo N .

[1] K. F. Roth. Remark concerning integer sequences , 1964 .

[2] J. Beck,et al. Irregularities of distribution , 1987 .

[3] F. Chung. Diameters and eigenvalues , 1989 .

[4] Noam Nisan,et al. Approximations of general independent distributions , 1992, STOC '92.

[5] N. Katz. An estimate for character sums , 1989 .

[6] József Beck,et al. Irregularities of distribution: Index of theorems and corollaries , 1987 .

[7] E. Szemerédi,et al. Construction of a thin set with small fourier coefficients , 1990 .

[8] Vojtech Rödl,et al. Two lower bounds for branching programs , 1986, STOC '86.

[9] Noga Alon,et al. Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.

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

[11] William W. L. Chen. On irregularities of distribution. , 1980 .

[12] Endre Szemerédi,et al. On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines , 1986, STOC '86.