Sidon set systems
From MaRDI portal
Publication:1998671
Abstract: A family of -subsets of is a Sidon system if the sumsets , are pairwise distinct. We show that the largest cardinality of a Sidon system of -subsets of satisfies and the asymptotic lower bound . More precise bounds on are obtained for . We also obtain the threshold probability for a random system to be Sidon for .
Recommendations
Cites work
- A complete annotated bibliography of work related to Sidon sequences
- Addition theorems in acyclic semigroups
- Counting sets with small sumset, and the clique number of random Cayley graphs
- Is the multiset of \(n\) integers uniquely determined by the multiset of its \(s\)-sums?
- Large sets in finite fields are sumsets
- On the determination of numbers by their sums of a fixed order
- On the determination of sets by the sets of sums of a certain order
- Power monoids: a bridge between factorization theory and arithmetic combinatorics
- Random Sidon sequences
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(12)- Greedy Sidon sets for linear forms
- The maximum size of a Sidon set contained in a sparse random set of integers
- A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$
- Maximal Sidon sets and matroids
- Sidon sets, sum-free sets and linear codes
- Sidon sets for linear forms
- Set systems with distinct sumsets
- An example related to the Sidon property for \(m\)-dependent systems
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- On Sidon sets in a random set of vectors
- scientific article; zbMATH DE number 7674533 (Why is no real title available?)
- \(k\)-fold Sidon sets
This page was built for publication: Sidon set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1998671)