ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP

DOI10.1142/S1793042109002481zbMath1231.11123arXiv0803.4486OpenAlexW2088677497MaRDI QIDQ3644235

Bajnok, Béla

Publication date: 3 November 2009

Published in: International Journal of Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

sum-free setsarithmetic progressionsKneser's theorem\((k, l)\)-sum-free sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Finite abelian groups (20K01) Arithmetic progressions (11B25) Extremal combinatorics (05D99) Inverse problems of additive number theory, including sumsets (11P70)

Related Items (4)

Large sums of high‐order characters ⋮ THE MAXIMUM SIZE OF -SUM-FREE SETS IN CYCLIC GROUPS ⋮ Regular saturated graphs and sum-free sets ⋮ The largest $(k, \ell)$-sum-free sets in compact abelian groups

Cites Work

• Summenmengen in lokalkompakten abelschen Gruppen
• Independent sets in regular graphs and sum-free subsets of finite groups
• Sum-free sets and related sets
• Large product-free subsets of finite groups
• Counting sets of integers, no \(k\) of which sum to another
• Sum-free sets in abelian groups
• Large sum-free sets in \(\mathbb Z/p\mathbb Z\)
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Large sum-free sets in ternary spaces
• On (k, l)-sets in cyclic groups of odd prime order
• Product-Free Subsets of Groups
• On the Number of Sum-Free Sets
• Maximal sum-free sets of elements of finite groups
• Sum-free sets in Abelian groups.

This page was built for publication: ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP