Metraipolis › archive › dc_84f07e978465

Non-redundant Independence Atoms — arXiv:2611.05568

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05568
License (as archived)
CC0-1.0
Archived
2026-11-05T18:28:22.134Z
SHA-256 of the archived text
a564bc9d06318efb0b8214545fec0ce644ae7aef6829a9c6fd8c25913d8544b3
Stable URL of this page
https://metraipolis.com/documento/dc_84f07e978465

How to cite

Non-redundant Independence Atoms — arXiv:2611.05568 — arXiv (en), https://arxiv.org/abs/2611.05568 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_84f07e978465 (Metraipolis archive dc_84f07e978465, sha256 a564bc9d06318efb0b8214545fec0ce644ae7aef6829a9c6fd8c25913d8544b3)
BibTeX
@misc{dc84f07e978465,
  title = {Non-redundant Independence Atoms — arXiv:2611.05568},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05568},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_84f07e978465; sha256 a564bc9d06318efb0b8214545fec0ce644ae7aef6829a9c6fd8c25913d8544b3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05568. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Independence atom is a key concept in relational database theory. In the present paper, we prove that the maximum possible size of a non-redundant set of independence atoms on $n$ attributes is asymptotically $(1+o(1))\binom{n}{\floor{n/2}}$. It turns out that this problem is closely related to two extremal set theory problems, the Katona-Tarján question on ``V''-free families of subsets of $[n]$ for the lower bound, and Kleitman's bound on union-free families for the upper bound.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Databases (cs.DB).
Pagina del lavoro: https://arxiv.org/abs/2611.05568 — 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-11-05T18:18:33.994Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).