Workshop 2006

The following timetable is also available in PDF format for download or printing.

Timetable for Semigroups 2006
Tues 5th Weds 6th Thurs 7th Fri 8th Sat 9th

9.30 Volkov 1: Interpreting graphs in 0-simple semigroups with involution with applications to computational complexity and the finite basis problem Pin 1: Algorithmic aspects of finite semigroup theory Pfeiffer 2: Actions on partial orders Otto 2: String-rewriting techniques for monoid-presentations cont. Pfeiffer 3: Applications to finite Coxeter groups

10.35 Auinger: A constructive proof of the type II theorem Goldberg: The finite basis problem for monoids of extensive transformations Gould: Fundamental representations for classes of semigroups containing a band of idempotents Juhasz: Magnus subsemigroups of one-relator semigroups and groups with small cancellation conditions Coffee Break

11.00 Coffee Break Coffee Break Coffee Break Coffee Break Volkov 3 (until 12.00): Interpreting graphs in 0-simple semigroups with involution with applications to computational complexity and the finite basis problem cont.

11.30 Pfeiffer 1: Algorithms for finite monoids Otto 1: String-rewriting techniques for monoid-presentations Volkov 2: Interpreting graphs in 0-simple semigroups with involution with applications to computational complexity and the finite basis problem cont. Pin 2: Algorithmic aspects of finite semigroup theory cont.

12.35 Plescheva: Complexity of identity checking in the full transformation semigroup Kobayashi: The homological finiteness properties left-, right- and bi-FP_n of monoids Vernitski: Semigroups of languages Egri-Nagy: SgpDec - A GAP package for Krohn-Rhodes Theory Pin 3 (12.00-13.00): Algorithmic aspects of finite semigroup theory cont.

13.00 Lunch Lunch Lunch Lunch

14.30 Linton 1 (LAB) Mitchell 1 (LAB) Linton 2 (LAB) Mitchell 2 (LAB)

15.30 Coffee Break Coffee Break Coffee Break Coffee Break
16.00 McAlister: Generating finite transformation semigroups: SgpWin Thomas: Automatic semigroups Delgado: On the use of GAP in finite semigroup theory Araujo: GAP and the solution of a problem on transformation semigroups

17.05 Peresse: Graph Homomorphisms and their Relative Rank Cain: Decidability for automatic semigroups TBA

18.00 Dinner Dinner Workshop Dinner at The Grill House Dinner

Timetable for Semigroups 2006
	Tues 5th	Weds 6th	Thurs 7th	Fri 8th	Sat 9th
9.30	Volkov 1: Interpreting graphs in 0-simple semigroups with involution with applications to computational complexity and the finite basis problem	Pin 1: Algorithmic aspects of finite semigroup theory	Pfeiffer 2: Actions on partial orders	Otto 2: String-rewriting techniques for monoid-presentations cont.	Pfeiffer 3: Applications to finite Coxeter groups
10.35	Auinger: A constructive proof of the type II theorem	Goldberg: The finite basis problem for monoids of extensive transformations	Gould: Fundamental representations for classes of semigroups containing a band of idempotents	Juhasz: Magnus subsemigroups of one-relator semigroups and groups with small cancellation conditions	Coffee Break
11.00	Coffee Break	Coffee Break	Coffee Break	Coffee Break	Volkov 3 (until 12.00): Interpreting graphs in 0-simple semigroups with involution with applications to computational complexity and the finite basis problem cont.
11.30	Pfeiffer 1: Algorithms for finite monoids	Otto 1: String-rewriting techniques for monoid-presentations	Volkov 2: Interpreting graphs in 0-simple semigroups with involution with applications to computational complexity and the finite basis problem cont.	Pin 2: Algorithmic aspects of finite semigroup theory cont.
12.35	Plescheva: Complexity of identity checking in the full transformation semigroup	Kobayashi: The homological finiteness properties left-, right- and bi-FP_n of monoids	Vernitski: Semigroups of languages	Egri-Nagy: SgpDec - A GAP package for Krohn-Rhodes Theory	Pin 3 (12.00-13.00): Algorithmic aspects of finite semigroup theory cont.
13.00	Lunch	Lunch	Lunch	Lunch
14.30	Linton 1 (LAB)	Mitchell 1 (LAB)	Linton 2 (LAB)	Mitchell 2 (LAB)
15.30	Coffee Break	Coffee Break	Coffee Break	Coffee Break
16.00	McAlister: Generating finite transformation semigroups: SgpWin	Thomas: Automatic semigroups	Delgado: On the use of GAP in finite semigroup theory	Araujo: GAP and the solution of a problem on transformation semigroups
17.05	Peresse: Graph Homomorphisms and their Relative Rank	Cain: Decidability for automatic semigroups		TBA
18.00	Dinner	Dinner	Workshop Dinner at The Grill House	Dinner

Please note that for those arriving on Monday 4th September dinner is served in McIntosh Hall at 18.00 that evening. Also, for those staying in the hall until Sunday 10th dinner will still be served in McIntosh Hall on the Saturday evening at 18.00.