CMSC 36500
Algorithms in Finite Groups (MATH 37500)Prerequisites: Linear algebra, finite fields and a first course in group theory (Jordan-Holder and Sylow theorems); prior knowledge of algorithms not required.
Catalog Description: We consider the asymptotic complexity of some of the basic problems of computational group theory. The course demonstrates the relevance of a mix of mathematical techniques, ranging from combinatorial ideas, the elements of probability theory, and elementary group theory, to the theories of rapidly mixing Markov chains, applications of simply stated consequences of the Classification of Finite Simple Groups (CFSG), and, occasionally, detailed information about finite simple groups. No programming problems are assigned.
Instructors: Laszlo BabaiQuarter offered: Not offered 2009-2010; will be offered 2010-11.
Last Verified by Sharon Salveter on 8 April, 2003.