Tuesday, March 24, 2015 2:30 pm
-
2:30 pm
EDT (GMT -04:00)
Ian Payne, Department of Pure Mathematics, University of Waterloo
I will talk about a CSP algorithm that works when each potato has a special congruence. That is, the quotient by it is a semilattice, and each block of it is Maltsev (plus a bit more). After that, I’ll talk about some effort to weaken the word semilattice in the previous sentence.
MC 5479