Paper Info
Title
Disengagement Algorithm Or A New Generalization Of Exclusion Algorithm
Abstract
Let us consider a finite inf semilattice G with a set ∗ of internal binary operations ∗ 1 , isotono, satisfying certain conditions of no dispersion, of increasing and of substitution, and so that the greatest lower bound is distributive relatively to ∗ 1 . A finite subset A of G being given, this article gives a method for enumerating the maximal elements of the sub-algebra A ∗ generated by A with regard to ∗, when A ∗ is finite. This method, called disengagement algorithm, allows to examine each element once; it generalizes an algorithm giving the maximal n -rectangles of a part of a product of distributive lattices algorithm which already generalized a conjecture of Tison in Boolean algebra. Two applications are developed.
Year
DOI
Venue
1977
10.1016/0012-365X(77)90023-1
DISCRETE MATHEMATICS
Field
DocType
Volume
Discrete mathematics,Distributive property,Combinatorics,Lattice (order),Upper and lower bounds,Algorithm,Boolean algebra,Semilattice,Maximal element,Conjecture,Binary operation,Mathematics
Journal
17
Issue
ISSN
Citations 
1
0012-365X
2
PageRank 
References 
Authors
0.85
1
1
Name
Order
Citations
PageRank
E. Pichat1104.46