Inclusion-Exclusion(3) Implies Inclusion-Exclusion(n)

Authors

  • Devdatt P. Dubhashi

DOI:

https://doi.org/10.7146/brics.v2i14.21670

Abstract

We consider a natural generalisation of the familiar inclusion-exclusion formula for sets in the setting of ranked lattices. We show that the generalised inclusion-exclusion formula holds in a lattice if and only if the lattice is distributive and the rank function is modular. As a consequence it turns out (perhaps surprisingly) that the inclusion-exclusion formula for three elements implies the inclusion-exclusion formula for an arbitrary number of elements.

Downloads

Published

1995-02-03

How to Cite

Dubhashi, D. P. (1995). Inclusion-Exclusion(3) Implies Inclusion-Exclusion(n). BRICS Report Series, 2(14). https://doi.org/10.7146/brics.v2i14.21670