The prime stems of rooted circuits of closure spaces and minimum implicational bases

zbMath1264.06006MaRDI QIDQ1953403

Masataka Nakamura, Kenji Kashiwabara

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i1p22

zbMATH Keywords

closure operatorantimatroidclosure systemconvex geometryArmstrong's axiomsrooted circuitprecedence structurepseudo-closed set

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (4)

Optimum basis of finite convex geometry ⋮ A representation of antimatroids by Horn rules and its application to educational systems ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Translating between the representations of a ranked convex geometry

This page was built for publication: The prime stems of rooted circuits of closure spaces and minimum implicational bases