Tomaž Pisanski: Antilattices, Their Substructures, Congruences and Automorphisms
Source: Discrete mathematics seminar
Povzetek. Antilattices form one of the simplest class of non-commutative lattices. In this talk we will present strategies for generating all subantilattices, congruences and automorphisms of a given finite antilattice. These strategies are realized as python programs.
This is joint work with Karin Cvetko Vah.