Skip to main content
eScholarship
Open Access Publications from the University of California

An improved lower bound for arithmetic regularity

  • Author(s): Hosseini, K
  • Lovett, S
  • Moshkovitz, G
  • Shapira, A
  • et al.

Published Web Location

http://arxiv.org/pdf/1405.4409
No data is associated with this publication.
Abstract

Copyright © 2016 Cambridge Philosophical Society. The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemerédi regularity lemma in graph theory. It shows that for any abelian group G and any bounded function f : G → [0, 1], there exists a subgroup H ≤ G of bounded index such that, when restricted to most cosets of H, the function f is pseudorandom in the sense that all its nontrivial Fourier coefficients are small. Quantitatively, if one wishes to obtain that for 1 - ϵ fraction of the cosets, the nontrivial Fourier coefficients are bounded by ϵ, then Green shows that |G/H| is bounded by a tower of twos of height 1/ϵ3. He also gives an example showing that a tower of height Ω(log 1/ϵ) is necessary. Here, we give an improved example, showing that a tower of height Ω(1/ϵ) is necessary.

Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.

Item not freely available? Link broken?
Report a problem accessing this item