Algebra and computation (27 February – 2 March)

This week deals with interactions between algebraic combinatorics and rewriting theory: algebraic invariants in computation, relating homological and algorithmic properties of rewriting systems, and the use of rewriting in algebraic combinatorics, offering effective computation and proof techniques. Themes of interest includes the use of ordered structures (lattices, event structures, directed homotopy) in logic and concurrency theory, as well as recent work on interpretations of type theory in homotopy.


Invited speakers