Abstract
We prove that there are explicit sets A that have ε-discrepancy on all rank d Bohr sets in ZN and are of size |A|=poly(( lnN)d,1/ε). This extends the result on explicit sets with ε-discrepancy on arithmetic progressions Razborov et al. [2] (1993) to Bohr sets which are the higher rank analogue of arithmetic progressions. Our proof is via a reduction to the existence of explicit small biased sets in ZN.
Original language | American English |
---|---|
Pages (from-to) | 564-567 |
Number of pages | 4 |
Journal | Information Processing Letters |
Volume | 114 |
Issue number | 10 |
DOIs | |
State | Published - Oct 2014 |
Externally published | Yes |
Keywords
- Arithmetic progressions
- Bohr sets
- Explicit construction
- ε-Biased sets
- ε-Discrepancy sets
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications