AMS talk 10/24/15

About two months ago I gave a talk at the AMS Fall Western Sectional Meeting.  While I could have safely rehashed my QPL talk, I decided to push forward instead.  That may or may not have been the best idea – the results were certainly less polished.  On the other hand, I was able to describe controllability and observability of a control system in terms of string diagrams.  This is something that was painfully missing from my QPL talk’s results in July.  Seeing the nontrivial constants in the string diagrams the quantum folk were using provided the key insight, and I wanted to capitalize on it as soon as possible.

The punchline of the AMS talk is that the duality between controllability and observability noticed by Kalman in the late 50s and early 60s can be expressed in terms of a PROP, which is a kind of symmetric monoidal category.  In particular, this PROP includes a subPROP of finite-dimensional vector spaces and linear relations, which is basically what Paweł Sobociński deals with here under the name of Interacting Hopf monoids.  Okay, so the actual punchline is that the duality Kalman noticed six and a half decades ago between controllability and observability? it’s simply time-reversed bizarro duality.

Bizarro is Sobociński’s term (seen in episode 7 of his blog), but I’m kind of partial to it.

QPL 2015

On July 17 I gave a talk at Oxford in the Quantum Physics and Logic 2015 conference.  It was recently released on the Oxford Quantum Group youtube channel.  There were a bunch of other really cool talks that week.  In my talk I refer to Pawel Sobocinski’s Graphical Linear Algebra tutorial on Monday and Tuesday, as well as Sean Tull’s talk on Categories of relations as models of quantum theory.  There are benefits to speaking near the end of the conference.

CSUSB colloquium

I’m giving a talk tomorrow afternoon at the CSUSB Mathematics department.  I will explain some of the stuff I’ve been working on, then shift gears to show how the general machinery can be applied to another mathematical landscape: knots.  Sticking purely with knots is a bit restrictive, so I almost immediately skip ahead to the open version of knots, i.e. tangles.  Luckily John Armstrong posted an article on arXiv in 2005, where he showed (among other very nice things) that tangle groups really are tangle invariants.

While I probably will not mention it tomorrow, another landscape that is being opened up (in the same sense that tangles open up knots) is Markov processes.  Blake Pollard is doing exciting work on this front, and the same general machinery I’ll be talking about should have some interesting things to say about Markov processes as well.