Sciweavers

3 search results - page 1 / 1
» Arithmetic Progressions in Sets with Small Sumsets
Sort
View
JCSS
2008
87views more  JCSS 2008»
13 years 4 months ago
Finding large 3-free sets I: The small n case
There has been much work on the following question: given n, how large can a subset of {1, . . . , n} be that has no arithmetic progressions of length 3. We call such sets 3-free....
William I. Gasarch, James Glenn, Clyde P. Kruskal
FOCS
2009
IEEE
13 years 11 months ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson