Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T10:33:09.034Z Has data issue: false hasContentIssue false

An improved lower bound for arithmetic regularity

Published online by Cambridge University Press:  11 March 2016

KAAVE HOSSEINI
Affiliation:
Department of Computer Science and Engineering, University of California, San Diego, La Jolla, CA 92093, USA. e-mails: skhossei@cse.ucsd.edu; slovett@cse.ucsd.edu
SHACHAR LOVETT
Affiliation:
Department of Computer Science and Engineering, University of California, San Diego, La Jolla, CA 92093, USA. e-mails: skhossei@cse.ucsd.edu; slovett@cse.ucsd.edu
GUY MOSHKOVITZ
Affiliation:
School of Mathematics, Tel Aviv University, Tel Aviv 69978, Israel. e-mails: guymosko@tau.ac.il; asafico@tau.ac.il
ASAF SHAPIRA
Affiliation:
School of Mathematics, Tel Aviv University, Tel Aviv 69978, Israel. e-mails: guymosko@tau.ac.il; asafico@tau.ac.il
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 2016