Algorithms for finite, finitely presented and free lattices
by
Ralph Freese
University of Hawaii

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 finitely presented lattice is finite. Several interesting open problems will be given.

We will also discuss how (computer implimentations of) these algorithms have been used to prove results in various branches of lattice theory.

http://www.math.hawaii.edu/~ralph/

Date received: July 20, 1999

Copyright © 1999 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cadj-17.