Metraipolis › archive › dc_c449b5cbc402
On union-closed families with prescribed number of $k$-sets — arXiv:2609.11358
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11358
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:13:51.775Z
- SHA-256 of the archived text
7cbbd04c6b67ae9ce0c452fb21520ee9805c81a3b1d33f69b87c575f1d69733d- Stable URL of this page
https://metraipolis.com/documento/dc_c449b5cbc402
How to cite
On union-closed families with prescribed number of $k$-sets — arXiv:2609.11358 — arXiv (en), https://arxiv.org/abs/2609.11358 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c449b5cbc402 (Metraipolis archive dc_c449b5cbc402, sha256 7cbbd04c6b67ae9ce0c452fb21520ee9805c81a3b1d33f69b87c575f1d69733d)
BibTeX
@misc{dcc449b5cbc402,
title = {On union-closed families with prescribed number of $k$-sets — arXiv:2609.11358},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11358},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c449b5cbc402; sha256 7cbbd04c6b67ae9ce0c452fb21520ee9805c81a3b1d33f69b87c575f1d69733d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11358. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Fix positive integers $N,k,n$ with $n\ge k$. We seek the minimum number of members of size at least $n$ in a finite family of finite sets closed under union and containing exactly $N$ distinct sets of size $k$. This problem is a specialization of the Leck--Roberts--Simpson weighted conjecture: assign weight one to sets of size at least $n$ and zero to smaller sets. The predicted minimizer consists of the unions of nonempty subfamilies of the first $N$ $k$-subsets of the natural numbers, ordered by their largest elements and, when these agree, by their increasing lists lexicographically. For an integer $t\ge 1$, call the range \[ \binom{n+t-1}{k}<N\le\binom{n+t}{k} \] the $t$-th strip. We prove the layered conjecture throughout the first strip, and throughout the second strip for $k=3$. For arbitrary $k$, we prove the second strip for families of subsets of an $(n+2)$-element set. For $k,t\ge 3$, we prove the $t$-th strip for families of subsets of an $(n+t)$-element set whenever $n\ge(t+1)(k-1)$. With no restriction on the ground set, we prove it for $k\ge 3$ and $t\ge 2$ whenever $n>\frac{5}{2} k^2t$. For sufficiently large $k$, we obtain a sufficient bound of order $k^2t/\log k$, uniformly in $t\ge2$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.11358 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:59:08.302Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).