Shape of the asymptotic maximum sum-free sets in integer lattice grids
From MaRDI portal
Publication:2080236
DOI10.1016/j.ejc.2022.103614OpenAlexW4296142733WikidataQ114184709 ScholiaQ114184709MaRDI QIDQ2080236
Donglei Yang, Laurence Wilkes, Hong Liu, Guang-Hui Wang
Publication date: 7 October 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.10526
Other combinatorial number theory (11B75) Ramsey theory (05D10) Arithmetic combinatorics; higher degree uniformity (11B30)
Cites Work
- Unnamed Item
- Unnamed Item
- On the structure of large sum-free sets of integers
- Sharp bound on the number of maximal sum-free subsets of integers
- Research problems from the 19th British Combinatorial Conference
- Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice
- On solution-free sets of integers
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Solving a linear equation in a set of integers I
- Solving a linear equation in a set of integers II
- Maximal sum-free sets of integer lattice grids
- On Certain Sets of Integers
This page was built for publication: Shape of the asymptotic maximum sum-free sets in integer lattice grids
