English

The largest $(k, \ell)$-sum-free sets in compact abelian groups

Combinatorics 2019-01-16 v2 Group Theory Number Theory

Abstract

A subset AA of a finite abelian group is called (k,)(k,\ell)-sum-free if kAA=.kA \cap \ell A=\emptyset. In this paper, we extend this concept to compact abelian groups and study the question of how large a measurable (k,)(k,\ell)-sum-free set can be. For integers 1k<1 \leq k <\ell and a compact abelian group GG, let λk,(G)=sup{μ(A):kAA=}\lambda_{k,\ell}(G)=\sup\{ \mu(A): kA \cap \ell A =\emptyset \} be the maximum possible size of a (k,)(k,\ell)-sum-free subset of GG. We prove that if G=I×MG=\mathbb{I} \times M, where I\mathbb{I} is the identity component of GG, then λk,(G)=max{λk,(M),λk,(I)}.\lambda_{k, \ell}(G)=\max \left\{ \lambda_{k, \ell}(M), \lambda_{k, \ell}(\mathbb{I}) \right\}. Moreover, if I\mathbb{I} is nontrivial, then λk,(I)=1k+\lambda_{k,\ell}(\mathbb{I})=\frac{1}{k+\ell}. Finally, we discuss how this problem motivates a new framework for studying (k,)(k,\ell)-sum-free sets in finite groups.

Keywords

Cite

@article{arxiv.1901.03233,
  title  = {The largest $(k, \ell)$-sum-free sets in compact abelian groups},
  author = {Noah Kravitz},
  journal= {arXiv preprint arXiv:1901.03233},
  year   = {2019}
}
R2 v1 2026-06-23T07:08:13.751Z