Maximal sum-free sets of integer lattice grids

DOI10.1112/JLMS.12006MaRDI QIDQ5357264zbMATH OpenOpenAlexFDO

Authors Christian Elsholtz, Laurence Rackham

Publication date 14 September 2017

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms.12006

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Other combinatorial number theory (11B75)

Recommendations

• Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice
• On the maximal density of sum-free sets
• Shape of the asymptotic maximum sum-free sets in integer lattice grids
• On sets of integers which are both sum-free and product-free
• scientific article; zbMATH DE number 409908

Cited in

(7)

• Caps and progression-free sets in \(\mathbb{Z}_m^n\)
• Shape of the asymptotic maximum sum-free sets in integer lattice grids
• Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice
• Maximum line-free set geometry in Z^d₃
• scientific article; zbMATH DE number 1439463 (Why is no real title available?)
• Size of the largest sum-free subset of \([n]^3\) and \([n]^4\)
• Additive closedness in subsets of \(\mathbb{Z}_n\)

This page was built for publication: Maximal sum-free sets of integer lattice grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357264)