Corpus ID: 2999662

ALGORITHMS FOR FINITE, FINITELY PRESENTED AND FREE LATTICES

@inproceedings{Freese1999ALGORITHMSFF,
  title={ALGORITHMS FOR FINITE, FINITELY PRESENTED AND FREE LATTICES},
  author={R. Freese},
  year={1999}
}
In this talk we will present and analyze the efficiency of various algorithms in lattice theory. For finite lattices this will include recognition of various properties such as subdirect irreducibility, semidistributivity, and boundedness (in the sense of McKenzie) as well as efficient algorithms for computing the congruence lattice. For free and finitely presented lattices we will discuss algorithms for such things as finding all the lower and upper covers of an element and recognizing if a… Expand

Figures and Tables from this paper

Lattice decompositions through methods using congruence relations
TLDR
This chapter proposes to investigate factor lattices as a tool to get meaningful parts of the whole lattice and presents pieces of lattice theory and formal concept analysis, namely compatible sub-contexts, arrow-closed sub- contexts and congruence relations. Expand
The reverse doubling construction
TLDR
This paper proposes to investigate factor lattices as a tool to get meaningful parts of the whole lattice and presents a new decomposition called reverse doubling construction that exploits the above three notions used for the doubling convex construction investigated by Day. Expand
Subdirect Decomposition of Contexts into Subdirectly Irreducible Factors
TLDR
In this paper a walkthrough from a finite reduced context to its subdirect decomposition into subdirectly irreducible sub contexts and factors is given and a polynomial algorithm is proposed to generate the decomposition of an initial context into subcontexts. Expand
Complexity of Strict Implication
  • F. Bou
  • Computer Science, Mathematics
  • Advances in Modal Logic
  • 2004
The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner’s Theorem remains valid when we restrict theExpand
Strict-weak languages: an analysis of strict implication
Esta tesis docotral introduce los aqui llamados lenguajes estricto-debiles, y los analiza desde diversos puntos de vista,Los lenguajes estricto debiles son aquellos lenguajes formales que constan deExpand

References

SHOWING 1-10 OF 36 REFERENCES
Equational bases and nonmodular lattice varieties
This paper is focused on equational theories and equationally defined varieties of lattices which are not assumed to be modular. It contains both an elementary introduction to the subject and aExpand
Finitely presented lattices: canonical forms and the covering relation
A canonical form for elements of a lattice freely generated by a partial lattice is given. This form agrees with Whitman's canonical form for free lattices when the partial lattice is an antichain.Expand
Doubling constructions in lattice theory
This paper examines the simultaneous doubling of multiple intervals of a lattice in great detail. In the case of a finite set of W-failure intervals, it is shown that there is a unique smallestExpand
Computing congruence lattices of finite lattices
An inequality between the number of coverings in the ordered set J(Con L) of join irreducible congruences on a lattice L and the size of L is given. Using this inequality it is shown that thisExpand
Congruence Lattices of Congruence Semidistributive Algebras
Nearly twenty years ago, two of the authors wrote a paper on congruence lattices of semilattices [9]. The problem of finding a really useful characterization of congruence lattices of finiteExpand
Covers in free lattices
In this paper we study the covering relation ( u > v ) in finitely generated free lattices. The basic result is an algorithm which, given an element w e FL( X), finds all the elements which cover orExpand
Tree Structure for Distributive Lattices and its Applications
TLDR
This representation (called ideal tree) can be efficiently computed and compared with respect to time and space complexity and allow us to achieve best running time algorithms for most of the applications in which distributive lattices are involved. Expand
A CHARACTERIZATION OF IDENTITIES IMPLYING CONGRUENCE MODULARITY I
0. In t roduc t ion . In his thesis and [24], J. B. Nation showed the existence of certain lattice identities, strictly weaker than the modular law, such that if all the congruence lattices of aExpand
The factorization and representation of lattices
For a complete lattice L, in which every element is a join of completely join-irreducibles and a meet of completely meet-irreducibles (we say L is a fm-lattice) we define the poset of irreduciblesExpand
The Lattice of Permutations is Bounded
  • N. Caspard
  • Mathematics, Computer Science
  • Int. J. Algebra Comput.
  • 2000
TLDR
This result strengthens the semi-distributive nature of the lattice Sn of permutations on a n-element set is bounded by using a characterization of the class of bounded lattices in terms of arrows relations defined on the join-irreductible elements of a lattice. Expand
...
1
2
3
4
...