A solution to a problem of Cameron on sum-free complete sets

DOI10.1016/0097-3165(95)90095-0MaRDI QIDQ1805059zbMATH OpenOpenAlexFDO

Authors Garth Payne

Publication date 11 May 1995

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(95)90095-0

zbMATH Keywords

combinatorial number theorysumfree setssumsets

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Additive bases, including sumsets (11B13) Other combinatorial number theory (11B75)

Recommendations

• The Cameron-Erdős conjecture
• Sum-free sets and related sets
• Solution of the Cameron-Erdős problem for groups of prime order

Cites work

• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Cyclic automorphisms of a countable graph and random sum-free sets
• scientific article; zbMATH DE number 4108825 (Why is no real title available?)
• On A Conjecture of Conway
• On the Number of Sum-Free Sets
• On the structure of a random sum-free set
• The Cardinalities of A+A and A-A

Cited in

(4)

• On the regular sum-free sets
• Groups whose locally maximal product-free sets are complete
• On the three questions of Bertram on locally maximal sum-free sets
• Sum-free sets generated by the period-\(k\)-folding sequences and some Sturmian sequences

This page was built for publication: A solution to a problem of Cameron on sum-free complete sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805059)