Pages that link to "Item:Q616150"
From MaRDI portal
The following pages link to A probabilistic technique for finding almost-periods of convolutions (Q616150):
Displayed 21 items.
- Long arithmetic progressions in \(A+A+A\) with \(A\) a prime subset (Q415260) (← links)
- A quantitative version of the non-Abelian idempotent theorem (Q633235) (← links)
- On Roth's theorem on progressions (Q640798) (← links)
- Sumsets of dense sets and sparse sets (Q1760400) (← links)
- The structure of approximate groups. (Q1927933) (← links)
- Higher moments of convolutions (Q1937309) (← links)
- Roth's theorem in many variables (Q2017118) (← links)
- Sums of multiplicative characters with additive convolutions (Q2362410) (← links)
- Noncommutative sets of small doubling (Q2509730) (← links)
- Finite field models in arithmetic combinatorics -- ten years on (Q2512891) (← links)
- ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS (Q2794648) (← links)
- ARITHMETIC PROGRESSIONS IN SETS OF SMALL DOUBLING (Q2810742) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- New bounds on cap sets (Q2879894) (← links)
- Some Properties of Lower Level-Sets of Convolutions (Q2908126) (← links)
- From Affine to Two-Source Extractors via Approximate Duality (Q3451757) (← links)
- The structure theory of set addition revisited (Q4918444) (← links)
- Arithmetic Progressions in Sumsets and <i>L<sup>p</sup></i>-Almost-Periodicity (Q4921566) (← links)
- Growth in groups: ideas and perspectives (Q5254458) (← links)
- An Additive Combinatorics Approach Relating Rank to Communication Complexity (Q5501927) (← links)
- Extractors in Paley graphs: a random model (Q5964262) (← links)