An asterisk by a 800level course number indicates it is not open to mathematics graduate students.
2014 Fall  2015 Spring  2015 Fall  2016 Spring  2016 Fall  2017 Spring  2017 Fall  2018 Spring  2018 Fall  2019 Spring  2019 Fall  2020 Spring 

221/821*  221/821*  221/821*  221/821*  221/821*  221/821*  221/821*  221/821*  221/821*  221/821*  221/821*  221/821* 
310  310  310  310  310  310  310  310  310  310  310  310 
314/814*  314/814*  314/814*  314/814*  314/814*  314/814*  314/814*  314/814*  314/814*  314/814*  314/814*  314/814* 
325  325  325  325  325  325  325  325  325  325  325  325 
350  350  350  350  350  350  
405  405  405  405  405  
407/807*  407/807*  407/807*  407/807*  407/807*  407/807*  
408/808*  408/808*  408/808*  408/808*  408/808*  408/808*  
415/815  415/815  415/815  415/815  415/815  415/815  
417  417  417  417  417  417  
423/823  423/823  423/823  423/823  423/823  423/823  
424/824*  424/824*  424/824*  424/824*  424/824*  424/824*  
425  425  
428/828  428/828  428/828  428/828  428/828  428/828  
430>  430  430  
433/833  433/833  433/833  
435  435  435  435  435  435  
439/839  439/839  439/839  
445/845  445/845  445/845  
447/847  447/847  447/847  
450  450  450  
452  452  452  
471  471  471  
487/887  487/887  487/887  
489/889  489/889  489/889  
817  818  817  818  817  818  817  818  817  818  817  818 
825  826  825  826  825  826  825  826  825  826  825  826 
830  831  830  831  830  831  830  831  830  
842  842  842  842  
850  852  850  852  850  852  850  852  850  852  
856  856  856  
870  872  871  872  871  872  871  872  871  872  871  872 
901  902  901  902  901  902  901  902  901  902  901  902 
905  
911  911  911  911  
918  918  918  918  918  918  
921  922  921  922  921  922  921  922  921  922  921  922 
923  923  923  923  
924  925  924  925  924  
928  929  928  929  928  929  
932  933  
934  934  934  934  
941  937  941  937  
953  
958  958  958  958  958  958  
990  990  990  
996 
Announcements for Fall 2018 courses
 Math 911

The goal of this course will be an introduction to the theory of groups, with an emphasis on infinite groups.
Groups are a useful mathematical tool which originated in the study of symmetry. For example, reflections, rotations, and translations of the plane R^n that preserve infinite tilings form examples of infinite groups.
Several methods for studying groups, including topological, geometric, and combinatorial techniques, will be discussed in this course. Many of these methods have applications in other areas of algebra and mathematics in general, as well. There will be two main topics for the course:
1) Geometric and combinatorial group theory: Geometric and combinatorial group theory encompasses a wide variety of geometric, combinatorial, topological, and algorithmic methods in the study of finitely generated (and finitely presented) groups. In GGT a distance function (metric) is placed on the group, and information about the group (eg subgroup structure, complexity of algorithms for solving problems, etc.) are obtained from this function.
2) Homology of groups: Homology for groups can be defined either using algebra or using topology. In addition to being a widely applied invariant for distinguishing groups, homology gives a useful way to measure how close an infinite group is to being finite.
In all of the topics covered, I'll discuss applications to finding computational algorithms for answering questions about the groups, and to finding bounds on how efficient those algorithms can be. Prerequisites: Math 872 and Math 817, or permission of instructor. Text: There will be no formal text for the course, but much of the material we will cover in the first topic of the course can be found in the blog at berstein.wordpress.com/, and material for the second part of the course can be found in "Cohomology of Groups" by K.S. Brown (Springer, 1982).  Math 918
 Topics in algebra: finite dimensional algebras
We plan to talk about finite dimensional algebras (both commutative and noncommutative), their modules, homomorphisms, exact sequences, projective resolutions, derived categories, and tilting theory. After touching general theories, we would consider objects like (commutative) Artinian Gorenstein rings, the rings of regular functions vanishing on fat points, (noncommutative) path algebras, and preprojective algebras. We will try our best to make everything as explicit as possible. Each student is expected to give at least two short presentations.
Prerequisites: Math 817/818, or permission of instructor. Text: There will be no formal text for the course, but part of the material will be based on the following notes.  Math 958
Topics in discrete math: Probabilistic methods in combinatorics. This course is an invitation to explore the exciting world of probabilistic combinatorics and random discrete structures.
Motivation: The probabilistic method is a very powerful tool that can be used to obtain nonconstructive proofs of the existence of a prescribed kind of mathematical object. It works by building an appropriate probability space and showing that a random outcome in that space has the desired properties with nonzero probability. The method was pioneered by Paul Erdős and has been widely used in combinatorics and many other areas of mathematics, such as number theory, linear algebra and real analysis, as well as in computer science and information theory.
While the original method uses probabilistic ideas to prove deterministic results, it can also be applied to analyze random discrete structures, which model a large variety of objects in physics, biology, or computer science (e.g., social networks). As a result, probabilistic combinatorics has become one of the most exciting and fruitful areas of research in recent years, and the field continues to grow, in an interplay with other disciplines.
Potential topics: First and second moment methods, Lovasz local lemma, correlation inequalities, martingales, concentration of measure, pseudorandomness and branching processes.
Text: There will be no formal text for the course, but much of the material will be based on the excellent book "The probabilistic method" by N. Alon and J. Spencer (Wiley 4th edition 2016).
Prerequisites: * Math 850/852 is recommended but not required (an exposure to discrete math and proof techniques at a graduate level will be helpful). * A basic background in probability theory (measure theory not required). * A reasonable level of mathematical maturity and enthusiasm.
If you'd like more information, please feel free to email the instructor or stop by.