Counting generalized sum-free sets
type: Item
instance of: scholarly article
title: Counting generalized sum-free sets
zbMATH Open document ID: 0898.11005
author: Neil J. Calkin
author: Jan McDonald Thomson
published in: Journal of Number Theory
publication date: 1998-11-02T00:00:00Z
review text: Let \(k\), \(l\), \(n\) be nonnegative integers such that \(k\geq 4l- 1\). The authors show that the number of subsets of \(\{1,\dots, n\}\) which have no solutions to the equation \[ x_1+ x_2+\cdots+ x_k= x_1+ x_2+\cdots+ x_l \] is at most \(c2^{(k- 1)n/k}\).
reviewed by: Yahya Ould Hamidoune
Mathematics Subject Classification ID: 11B75
zbMATH DE Number: 1121273
zbMATH Keywords: generalized sum-free sets
MaRDI profile type: Publication
full work available at URL: jnth.1997.2191
OpenAlex ID: W2082980644
cites work: Independent sets in regular graphs and sum-free subsets of finite groups
cites work: Sum-free sets and related sets
cites work: On the Number of Sum-Free Sets
cites work: Counting sets of integers, no \(k\) of which sum to another
cites work: Q3470561
cites work: On sets of integers containing k elements in arithmetic progression
DOI: 10.1006/JNTH.1997.2191
description: scientific article; zbMATH DE number 1121273