Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 102 tok/s Pro
Kimi K2 166 tok/s Pro
GPT OSS 120B 436 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Some properties of lower level-sets of convolutions (1108.1578v4)

Published 7 Aug 2011 in math.CO

Abstract: In the present paper we prove a certain lemma about the structure of "lower level-sets of convolutions", which are sets of the form ${x \in \Z_N : 1_A*1_A(x) \leq \gamma N}$ or of the form ${x \in \Z_N : 1_A*1_A(x) < \gamma N}$, where $A$ is a subset of $\Z_N$. One result we prove using this lemma is that if $|A| = \theta N$ and $|A+A| \leq (1-\eps) N$, $0 < \eps < 1$, then this level-set contains an arithmetic progression of length at least $Nc$, $c = c(\theta, \eps,\gamma) > 0$. It is perhaps possible to obtain such a result using Green's arithmetic regularity lemma (in combination with some ideas of Bourgain); however, our method of proof allows us to obtain non-tower-type quantitative dependence between the constant $c$ and the parameters $\theta$ and $\eps$. For various reasons (discussed in the paper) one might think, wrongly, that such results would only be possible for level-sets involving triple and higher convolutions.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube