Almost Odd Random Sum-Free Sets

DOI10.1017/S096354839700312XMaRDI QIDQ4383734zbMATH OpenFDO

Authors Neil J. Calkin, Peter J. Cameron

Publication date 6 January 1999

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S096354839700312X

zbMATH Keywords

probability measuresrandom sum-free setsrepresentations of integersstrictly complete sum-free sets

Mathematics Subject Classification ID

Ramsey theory (05D10) Representation functions (11B34) Special sequences and polynomials (11B83) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99)

Recommendations

• On the structure of a random sum-free set
• Notes on Sum-Free and Related Sets
• On the Number of Sum-Free Sets
• A note on the number of \((k,l)\)-sum-free sets
• An improved upper bound for the sum-free subset constant
• On the Density of Universal Sum-Free Sets
• THE CAMERON–ERDOS CONJECTURE
• The Cameron-Erdős conjecture
• On the structure of a random sum-free set of positive integers
• An improved lower bound on the greatest element of a sum-distinct set of fixed order

Cited in

(6)

• On the structure of a random sum-free set of positive integers
• On the structure of a random sum-free set
• On the Number of Sum-Free Sets
• Groups whose locally maximal product-free sets are complete
• Sum-free sets of integers with a forbidden sum
• On the number of primes yielding square-free sums with given numbers

This page was built for publication: Almost Odd Random Sum-Free Sets

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