On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a prime

DOI10.1007/s10474-011-0124-0zbMath1249.11018arXiv1109.2934OpenAlexW1993424366MaRDI QIDQ653939

Olof Sisask, Pablo Candela

Publication date: 20 December 2011

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.2934

zbMATH Keywords

Fourier analysisremoval lemmasets free from solutions to linear equations

Mathematics Subject Classification ID

Fourier and Fourier-Stieltjes transforms on locally compact and other abelian groups (43A25) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (6)

On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs ⋮ A continuous model for systems of complexity 2 on simple abelian groups ⋮ An application of the sum-product phenomenon to sets avoiding several linear equations ⋮ Maximal sets with no solution to \(x+y=3z\) ⋮ A removal lemma for linear configurations in subsets of the circle ⋮ On sets with small sumset and m-sum-free sets in Z/pZ

Cites Work

• Unnamed Item
• Unnamed Item
• Linear equations in primes
• A combinatorial proof of the removal lemma for groups
• A Szemerédi-type regularity lemma in abelian groups, with applications
• A new proof of Roth’s theorem on arithmetic progressions
• Solving a linear equation in a set of integers I
• Solving a linear equation in a set of integers II
• The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit
• The true complexity of a system of linear equations

This page was built for publication: On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a prime