Metraipolis › archive › dc_6c0754fbefa2

Boolean building set arrangements — arXiv:2609.21874

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.21874
License (as archived)
CC0-1.0
Archived
2026-10-10T02:10:31.858Z
SHA-256 of the archived text
b1f004abcecf5891023a0316321b2d9eb4bb7ce20064726d7fbb04d45f87d9a5
Stable URL of this page
https://metraipolis.com/documento/dc_6c0754fbefa2

How to cite

Boolean building set arrangements — arXiv:2609.21874 — arXiv (en), https://arxiv.org/abs/2609.21874 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6c0754fbefa2 (Metraipolis archive dc_6c0754fbefa2, sha256 b1f004abcecf5891023a0316321b2d9eb4bb7ce20064726d7fbb04d45f87d9a5)
BibTeX
@misc{dc6c0754fbefa2,
  title = {Boolean building set arrangements — arXiv:2609.21874},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.21874},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6c0754fbefa2; sha256 b1f004abcecf5891023a0316321b2d9eb4bb7ce20064726d7fbb04d45f87d9a5},
  year = {2026}
}

Archived text

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

In this article, we generalize the notion of connected subgraph arrangements, established by Cuntz and Kühne by allowing edges of cardinality greater than two, with a focus on local properties. We show that the class of free connected hypersubgraph arrangements is larger than the class of free connected subgraph arrangements, but that there exists a necessary condition for freeness that refers back to the graphic case. Furthermore, we obtain a unique description of these arrangements by associating them with Boolean building sets. We study the nested complex of the building set in relation to the lattice of intersections, and characterize all simplicial arrangements within this new class.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.21874 — 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-10T01:48:20.604Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).