Sum-free sets in vector spaces over \(GF(2)\) (Q1199997)

From MaRDI portal
Revision as of 02:29, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Sum-free sets in vector spaces over \(GF(2)\)
scientific article

    Statements

    Sum-free sets in vector spaces over \(GF(2)\) (English)
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    Let \(V(n)\) denote the standard \(n\)-dimensional vector space of \(n\)-tuples over the field \(GF(2)\). A subset \(S\) of \(V(n)\) is sum-free if \((S+S)\cap S=\emptyset\); for example, the set of all vectors with an odd number of components equal to 1 is a sum-free subset of largest size, namely \(2^{n-1}\). The authors show that any sum-free subset of size less than \(2^{n-1}\) has size at most \(5\times 2^{n-4}\) and find bounds for the size of the smallest maximal sum-free subsets. By constructing various classes of sum-free subsets they are able to give a complete list of the maximal sum-free subsets of \(V(n)\) for \(n\leq 6\) and partial information for \(n>6\).
    0 references
    0 references
    vector spaces over \(GF(2)\)
    0 references
    sum-free sets
    0 references

    Identifiers