Show simple item record

dc.contributor.author Arpin, Peter Robert en_US
dc.date.accessioned 2007-05-22T15:16:10Z
dc.date.available 2007-05-22T15:16:10Z
dc.date.issued 1999-02-01T00:00:00Z en_US
dc.identifier.uri http://hdl.handle.net/1993/2093
dc.description.abstract In this thesis we will be concerned with determining the best possible representations of finite distributive lattices as congruence lattices of lattices. We first find lower and upper bounds for a finite algebra given its congruence lattice. Secondly, we use the lower bound to determine the minimal representation of a finite product of finite distributive lattices as a congruence lattice of a lattice. This in turn reduces the problem to finding the minimal representation of a product to the minimal representation of the product's directly indecomposable factors. We will then give constructions of minimal representations of particular kinds of directly indecomposable lattices, namely chains of length n. From this we will be able to determine the size of a minimal representation of a product of chains and also a construction for the representation. en_US
dc.format.extent 930523 bytes
dc.format.extent 184 bytes
dc.format.mimetype application/pdf
dc.format.mimetype text/plain
dc.language en en_US
dc.language.iso en_US
dc.rights info:eu-repo/semantics/openAccess
dc.title Minimal congruence representations of finite distributive lattices en_US
dc.type info:eu-repo/semantics/masterThesis
dc.degree.discipline Mathematics en_US
dc.degree.level Master of Science (M.Sc.) en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

View Statistics