Counting generalized sum-free sets (Q1379641)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Counting generalized sum-free sets
scientific article

    Statements

    Counting generalized sum-free sets (English)
    0 references
    0 references
    0 references
    2 November 1998
    0 references
    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}\).
    0 references
    0 references
    generalized sum-free sets
    0 references
    0 references