On the removal lemma for linear systems over abelian groups

DOI10.1016/j.ejc.2012.07.003zbMath1282.11008DBLPjournals/ejc/KralSV13arXiv1106.4243OpenAlexW1964393859WikidataQ57601360 ScholiaQ57601360MaRDI QIDQ691583

Daniel Král', Oriol Serra, Lluís Vena

Publication date: 3 December 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

linear equationsremoval lemma

Mathematics Subject Classification ID

Hypergraphs (05C65) Finite abelian groups (20K01) Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (9)

Online containers for hypergraphs, with applications to linear equations ⋮ On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs ⋮ Counting configuration-free sets in groups ⋮ A removal lemma for linear configurations in subsets of the circle ⋮ Hypergraph containers ⋮ Kneser graphs are like Swiss cheese ⋮ Counting configuration-free sets in groups ⋮ On the number of monochromatic solutions of integer linear systems on abelian groups ⋮ Sum-avoiding sets in groups

This page was built for publication: On the removal lemma for linear systems over abelian groups