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

DOI10.1016/0097-3165(95)90095-0zbMath0821.11010OpenAlexW2056241035MaRDI QIDQ1805059

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

sumsetscombinatorial number theorysumfree sets

Mathematics Subject Classification ID

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

Related Items (5)

Symmetric complete sum-free sets in cyclic groups ⋮ 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 ⋮ On the regular sum-free sets

Cites Work

• Unnamed Item
• Cyclic automorphisms of a countable graph and random sum-free sets
• On the structure of a random sum-free set
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• On the Number of Sum-Free Sets
• The Cardinalities of A+A and A-A
• On A Conjecture of Conway

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