Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2411.17192 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
Sommario:
- In 1965, Bollobás proved that for a Bollobás set-pair system $\{(A_i,B_i)\mid i\in[m]\}$, the maximum value of $\sum_{i=1}^m\binom{|A_i|+|B_i|}{A_i}^{-1}$ is $1$. Hegedüs and Frankl recently extended the concept of Bollobás systems to $d$-tuples, conjecturing that for a Bollobás system of $d$-tuples, $\{(A_i^{(1)},\ldots,A_i^{(d)})\mid i\in[m]\}$, the maximum value of $\sum_{i=1}^m\binom{|A_i^{(1)}|+\cdots+|A_i^{(d)}|}{|A_i^{(1)}|,\ldots,|A_i^{(d)}|}^{-1}$ is also $1$. This paper refutes this conjecture and establishes an upper bound for the sum. In the case $d=3$, the derived upper bound is asymptotically tight. Furthermore, we sharpen an inequality for skew Bollobás systems of $d$-tuples in Hegedüs and Frankl's paper. Finally, we determine the maximum size of a uniform skew Bollobás system of $d$-tuples on both sets and spaces.