Pavol is visiting from Vancouver, and we are talking about a problem with a paper. We would like a polynomial algorithm to decide if a graph has a semilattice polymorphism. I say that I think a Lexicographic breadth

I'm in my office fighting with the notation on a paper I'm writing. Portrayed on television, Math is: Furiously writing long equations on a whiteboard. Then pausing and look thoughtfully at an integral. Then

‌M: Wow. That's your aura? It's way brighter than it used to be.‌ ‌G: I'm in heaven now. So I'm in my natural state-- glowing.‌

We host a combinatorial seminar. A certain David is giving a talk on 1-factorisations of graphs. He makes the absurd claim that "It is hard to decide if a graph has a 1-factorisation." "Not cliques,

I tell the students in my topology class that we will have an aural final exam, or is it 'oral'? Both seem appropriate, but I'll go with 'aural'.

I'm talking with Jarik about polymorphisms. Me: We can always assume that they are idempotent. Bulatov Jeavons and Krohkin do this. Jarik: Then your essentially sub-unary automatically gives projective. Me: Yeah. Jarik: Then we have it.

Keevash gets the Birmingham post-doc. I get a NSERC post-doc fellowship.  It easily beats the Korean one, but how do I convince Eunjoo of this? I will spend 2 years at SFU. Turns out that Eunjoo expected this,

I learn that Ross Kang, who was also at the Birmingham interviews, has got the NSERC post-doc fellowship that I am waiting to hear about. This disturbs me. There will probably be 200-300 of them given out, but