Peter Cameron, University of St. Andrews

Abstract

There has been a lot of recent work about graphs defined on groups so as to reflect some of the group structure; the most famous is the commuting graph, where two group elements are joined if they commute. These graphs typically have huge automorphism groups, but can be tamed by twin reduction. I will describe one case where a beautiful graph is obtained.

Link to video: https://vimeo.com/1025297778?share=copy

Presented Via Zoom: https://rutgers.zoom.us/j/91865817691

Password: 6564120420

For further information see: https://sites.math.rutgers.edu/~zeilberg/expmath/