A note on minimal matrix representation of closure operations

DOI10.1007/BF02579291zbMath0526.06004MaRDI QIDQ594908

Gy. Gyepesi, Janos Demetrovics

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

closure operators

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (9)

New type of coding problem motivated by database theory ⋮ A survey of some combinatorial results concerning functional dependencies in database relations. ⋮ Recent combinatorial results in the theory of relational databases ⋮ SPT(q, k, n)-Codes ⋮ Codes that attain minimum distance in every possible direction ⋮ On the Existence of Armstrong Instances with Bounded Domains ⋮ Coding Theory Motivated by Relational Databases ⋮ Design type problems motivated by database theory ⋮ Minimum matrix representation of closure operations

Cites Work

• Extremal properties of collections of subsets containing no two sets and their union
• Unnamed Item

This page was built for publication: A note on minimal matrix representation of closure operations