Non-Cancelling-Intersections conjecture
Non-Cancelling-Intersections conjecture
For every finite set and every finite family of subsets , let be the set of distinct nonempty intersections for . For each , let be its Möbius coefficient in the inclusion–exclusion expansion of the indicator function of , and call non-cancelling when . The conjecture asserts that can be constructed from the non-cancelling intersections using finitely many disjoint unions and subset complements with .
References
Primary source
Additional references
- The Non-Cancelling-Intersections Conjecture Fails for Left-Linear Trees — arXiv — Wilhelm, Hermann
Progress summary
A new counterexample rules out a more restrictive version of the conjecture, but the original conjecture remains open.
The Non-Cancelling-Intersections conjecture asks whether every union represented by non-cancelling intersections can be constructed from those intersections using disjoint union and subset complement. A 2024 preprint established partial cases but did not resolve the general conjecture.
Known results
- The conjecture holds when there are no cancelling intersections (2024 preprint).
- It holds with exactly one cancelling intersection, by Theorem (2024 preprint).
- Exhaustive computation verified the stronger left-linear version for underlying sets of size at most ; searches at size were incomplete (2024 preprint).
- The unrestricted case with multiple zero-valued nodes remains unresolved (2024 preprint).
August 2026 left-linear counterexample
Hermann Wilhelm reported that the constructive representation fails when witnessing trees are required to be left-linear. This refutes that proposed strengthening, but the argument is non-constructive and leaves the unrestricted NCI conjecture untouched.
Current status (as of August 2026): The left-linear strengthening is refuted, while the original Non-Cancelling-Intersections conjecture remains open beyond its known partial cases.
Solutions 0
No solutions have been posted yet.