Personal tools
 

The Layer Lemma

— filed under:

Dave Jackson, SLU

What
  • Algebra Seminar
When Thu, Sep 14, 2006
from 02:10 PM to 03:00 PM
Where RH 222
Add event to calendar vCal
iCal

Abstract: It is well-known that the (left or right) Cayley graph for a finitely generated group has 0,1,2 or infinitely many ends. In joint work over recent years, Vesna Kilibarda and I have defined the number of ends for finitely generated semigroups and monoids. For arbitrary m,n we have constructed examples of monoids T such that the left Cayley graph for T has m ends while the right Cayley graph for T has n ends. In this talk, I will present the Layer Lemma which provides a reasonably transparent and uniform construction for vast numbers of such examples. I will outline a proof of the Layer Lemma.

« February 2018 »
February
SuMoTuWeThFrSa
123
45678910
11121314151617
18192021222324
25262728