A Sidon-type condition on set systems

DOI10.4310/JOC.2013.V4.N4.A4MaRDI QIDQ2449974zbMATH OpenFDO

Authors J. Wodlinger, Peter Dukes

Publication date 13 May 2014

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.0923

zbMATH Keywords

\(t\)-design\(t\)-\(a\) designSidon problem

Mathematics Subject Classification ID

Other designs, configurations (05B30) Additive bases, including sumsets (11B13) Representation functions (11B34)

Abstract: Consider families of $k$-subsets (or blocks) on a ground set of size $v$. Recall that if all $t$-subsets occur with the same frequency $lambda$, one obtains a $t$-design with index $lambda$. On the other hand, if all $t$-subsets occur with different frequencies, such a family has been called (by Sarvate and others) a $t$-adesign. An elementary observation shows that such families always exist for $v>kget$. Here, we study the smallest possible maximum frequency $mu=mu(t,k,v)$. The exact value of $mu$ is noted for $t=1$ and an upper bound (best possible up to a constant multiple) is obtained for $t=2$ using PBD closure. Weaker, yet still reasonable asymptotic bounds on $mu$ for higher $t$ follow from a probabilistic argument. Some connections are made with the famous Sidon problem of additive number theory.

Recommendations

• On the structure of Sidon sets
• scientific article; zbMATH DE number 4071625
• scientific article; zbMATH DE number 2066400
• Sidon Sets and Perturbations
• Sidon sets and I⁰-sets
• A remark on infinite Sidon sets
• Generalized Sidon sets
• A note on Sidon sets in bounded orthonormal systems
• Sidon sets in \(\mathbb N^d\)
• An Upper Bound on the Size of Sidon Sets

Cited in

(1)

• scientific article; zbMATH DE number 3992525 (Why is no real title available?)

This page was built for publication: A Sidon-type condition on set systems

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