Finitely generated solvable groups and descriptive set theory

03/25/2014 - 12:15pm
03/25/2014 - 1:10pm
Jay Williams (CalTech)

Descriptive set theory gives us tools for comparing the complexity of various classification problems throughout mathematics. Thomas and Velickovic used this framework to show that classifying finitely generated groups up to isomorphism is as complicated as it could be, using a construction involving group-theoretically "large" groups. I will describe what exactly the descriptive set-theoretic tools are, and then use them to show that classifying finitely generated solvable groups is still very complicated.

Mudd Science Library 126, 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