The course covers monoids and groups and their actions. Topics covered include finite state machines, orbits and stabilizers, applications in combinatorics (e.g. vertex colorings), Sylow theory, finite simple groups.
Learning Outcomes 1. Define monoid actions; state and prove fundamental theorems about them 2. Determine regular languages for finite automata 3. Use orbit-stabilizer theory to compute automorphism groups of graphs 4. State and prove Sylow's theorems 5. Prove there is no finite non-abelian simple group of order less than 60