The Prime Stems of Rooted Circuits of Closure Spaces and Minimum Implicational Bases

A rooted circuit is firstly introduced for convex geometries (antimatroids). We generalize it for closure systems or equivalently for closure operators. A rooted circuit is a specific type of a pair $(X,e)$ of a subset $X$, called a stem, and an element $e\not\in X$, called a root. We introduce a no...

Full description

Saved in:
Bibliographic Details
Published in:The Electronic journal of combinatorics 2013-01, Vol.20 (1)
Main Authors: Nakamura, Masataka, Kashiwabara, Kenji
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A rooted circuit is firstly introduced for convex geometries (antimatroids). We generalize it for closure systems or equivalently for closure operators. A rooted circuit is a specific type of a pair $(X,e)$ of a subset $X$, called a stem, and an element $e\not\in X$, called a root. We introduce a notion called a 'prime stem', which plays the key role in this article. Every prime stem is shown to be a pseudo-closed set of an implicational system. If the sizes of stems are all the same, the stems are all pseudo-closed sets, and they give rise to a canonical minimum implicational basis. For an affine convex geometry, the prime stems determine a canonical minimum basis, and furthermore  gives rise to an optimal basis. A 'critical rooted circuit' is a special case of a rooted circuit defined for an antimatroid. As a precedence structure, 'critical rooted circuits' are necessary and sufficient to fix an antimatroid whereas critical rooted circuits are not necessarily sufficient to restore the original antimatroid as an implicational system. It is shown through an example.
ISSN:1077-8926
1077-8926
DOI:10.37236/3068