2000 character limit reached
The Non-Cancelling Intersections Conjecture (2401.16210v1)
Published 29 Jan 2024 in math.CO and cs.DM
Abstract: In this note, we present a conjecture on intersections of set families, and a rephrasing of the conjecture in terms of principal downsets of Boolean lattices. The conjecture informally states that, whenever we can express the measure of a union of sets in terms of the measure of some of their intersections using the inclusion-exclusion formula, then we can express the union as a set from these same intersections via the set operations of disjoint union and subset complement. We also present a partial result towards establishing the conjecture.
- Amarilli, A. (2019). Lighting up all elements of a poset by toggling upsets. Theoretical Computer Science Stack Exchange. URL:https://cstheory.stackexchange.com/q/45679 (version: 2019-10-12).
- Amarilli, A. (2023). Code. https://gitlab.com/Gruyere/mobius-unions-differences/-/blob/master/code_a3nm/brute_sets.cpp.
- Which sets can be expressed as disjoint union and subset complement without möbius cancellations? https://mikael-monet.net/share/note.pdf. Unpublished.
- Disjoint-union partial algebras. Log. Methods Comput. Sci., 13(2).
- Monet, M. (2020a). Solving a special case of the intensional vs extensional conjecture in probabilistic databases. In PODS.
- Monet, M. (2020b). Sperner families generator. https://gitlab.com/Gruyere/sperner-families-generator.
- Rota, G.-C. (1964). On the foundations of combinatorial theory I. Theory of Möbius functions. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 2(4).
- Stanley, R. P. (2011). Enumerative Combinatorics: Volume 1. 2nd edition.