A PID that is not Euclidean (Held in ChCh, Tom Gate, Room 2)
Abstract
It is well-known that Euclidean domains are PIDs; examples proving that the inclusion is strict are not commonly known. Here is one.
Forthcoming events in this series
It is well-known that Euclidean domains are PIDs; examples proving that the inclusion is strict are not commonly known. Here is one.
Last week, I proved five theorems about fusion systems, each with a (relatively) trivial proof. All of these theorems were known, but in each case the proof was (in some cases highly) non-trivial. I will introduce fusion systems and talk a bit about why they are interesting, and then prove some, or maybe all, of the theorems I proved.
In this talk, I shall endeavour to explain to the uneducated and uninitiated the joys and pleasures one can have studying automata.
Abstract: I will talk about developments in my ongoing project to understand algebraic modules for finite groups, in particular for V_4 blocks, and their relation with the Puig finiteness conjecture. I will discuss a new (as in 5th of November) theorem of mine that generalizes results of Alperin and myself.