|
Andrew Brooke-Taylor
It is only a decade since it was discovered that braid groups are orderable.
The original proof of this fact relies on understanding systems with a
(left) self-distributive operation, and in particular the fact that the word
problem for such systems is decidable. To obtain this latter result,
examples of such systems without cycles were needed; these examples were
originally furnished by the assumption of certain (very) large cardinal
axioms. I will go over these matters at a fairly rudimentary level.
|