Cayley graphs in surprising places

04/16/2013 - 12:15pm
04/16/2013 - 1:10pm
Rena Levitt (Pomona College)

Cayley graph is a powerful tool that encodes the structure of a finitely generated group. In fact, the word problem for a finitely generated group G is solvable if and only if there exists an algorithm to construct any finite portion of the Cayley graph of G. This suggests the following questions. Can the notion of a Cayley graph be extended to other algebraic objects? If so, what does this imply for the word problem in these objects? In this talk I will review some of the algebraic objects where this approach has been fruitful, focusing on involutory quandles, or kei. This is joint work with Pomona senior Ben Fish.

Millikan 208 (Pomona College)

Claremont Graduate University | Claremont McKenna | Harvey Mudd | Pitzer | Pomona | Scripps
Proudly Serving Math Community at the Claremont Colleges Since 2007
Copyright © 2018 Claremont Center for the Mathematical Sciences