dc.contributor.author Payne, Ian dc.date.accessioned 2017-08-22 16:09:34 (GMT) dc.date.available 2017-08-22 16:09:34 (GMT) dc.date.issued 2017-08-22 dc.date.submitted 2017 dc.identifier.uri http://hdl.handle.net/10012/12171 dc.description.abstract Semilattices are algebras known to have an important connection to partially ordered sets. In particular, if a partially ordered set $(A,\leq)$ has greatest lower bounds, a semilattice $(A;\wedge)$ can be associated to the order where $a\wedge b$ is the greatest lower bound of $a$ and $b$. In this thesis, we study a class of algebras known as 2-semilattices, which is a generalization of the class of semilattices. Similar to the correspondence between partial orders and semilattices, there is a correspondence between certain digraphs and 2-semilattices. That is, to every 2-semilattice, there is an associated digraph which holds information about the 2-semilattice. Making frequent use of this correspondence, we explore the class of 2-semilattices from three perspectives: (i) Tame Congruence Theory, (ii) the residual character" of the class of 2-semilattices, and (iii), the constraint satisfaction problem. en Tame Congruence Theory, developed in , is a structure theory on finite algebras driven by understanding their prime congruence quotients. The theory assigns to each such quotient a type from 1 to 5. We show that types 3, 4, and 5 can occur in the class of 2-semilattices, but type 4 can not occur in a finite simple 2-semilattice. Classes of algebras contain subdirectly irreducible" members which hold information about the class. Specifically, the size of these members has been of interest to many authors. We show for certain subclasses of the class of 2-semilattices that there is no cardinal bound on the size of the irreducible members in that subclass. The fixed template constraint satisfaction problem" can be identified with the decision problem hom$(\mathbb{A})$ where $\mathbb{A}$ is a fixed finite relational structure. The input to hom$(\mathbb{A})$ is a finite structure $\mathbb{B}$ similar to $\mathbb{A}$. The question asked is does there exist a homomorphism from $\mathbb{B}$ to $\mathbb{A}$?" Feder and Vardi  conjectured that for fixed $\mathbb{A}$, this decision problem is either NP-complete or solvable in polynomial time. Bulatov  confirmed this conjecture in the case that $\mathbb{A}$ is invariant under a 2-semilattice operation. We extend this result. dc.language.iso en en dc.publisher University of Waterloo en dc.title 2-Semilattices: Residual Properties and Applications to the Constraint Satisfaction Problem en dc.type Doctoral Thesis en dc.pending false uws-etd.degree.department Pure Mathematics en uws-etd.degree.discipline Pure Mathematics en uws-etd.degree.grantor University of Waterloo en uws-etd.degree Doctor of Philosophy en uws.contributor.advisor Willard, Ross uws.contributor.affiliation1 Faculty of Mathematics en uws.published.city Waterloo en uws.published.country Canada en uws.published.province Ontario en uws.typeOfResource Text en uws.peerReviewStatus Unreviewed en uws.scholarLevel Graduate en
﻿

### This item appears in the following Collection(s)

UWSpace

University of Waterloo Library
200 University Avenue West