Principle of inclusion-exclusion on semilattices
Publication:1846879
DOI10.1016/0097-3165(74)90006-5zbMath0289.05013OpenAlexW2095407242MaRDI QIDQ1846879
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(74)90006-5
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Formal languages and automata (68Q45) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Combinatorial aspects of matroids and geometric lattices (05B35) Structure theory of lattices (06B05) Other combinatorial set theory (03E05) Structure theory of Boolean algebras (06E05) Logical aspects of Boolean algebras (03G05) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Designs and configurations (05B99)
Related Items (7)
Cites Work
- Parallel concepts in graph theory
- Incidence functions as generalized arithmetic functions. II, III
- Principles of combinatorics
- The power group enumeration theorem
- The matrix group of two permutation groups
- A Census of Finite Automata
- The Burnside algebra of a finite group
- Order algebras
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Principle of inclusion-exclusion on semilattices