Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Improved inclusion-e ...
Article

Improved inclusion-exclusion identities via closure operators

Klaus Dohmen ORCID (1)
(1) Department of Computer Science [Berlin]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2000
Last modified on
March 31, 2025
Volume 4
vol. 4:1
DOI
10.46298/dmtcs.275
License
https://about.hal.science/hal-authorisation-v1
Indicators
698
Views
575
Downloads

Improved inclusion-exclusion identities via closure operators

Klaus Dohmen ORCID (1)
(1) Department of Computer Science [Berlin]
Abstract
Let (A_v)_v ∈ V be a finite family of sets. We establish an improved inclusion-exclusion identity for each closure operator on the power set of V having the unique base property. The result generalizes three improvements of the inclusion-exclusion principle as well as Whitney's broken circuit theorem on the chromatic polynomial of a graph.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Inclusion-Exclusion
  • Sieve Formula
  • Closure Operator
  • Convex Geometry
  • Broken Circuit
  • Reliability
Preview
Loading PDF preview...