Modern Combinatorics

Undergraduate

Recent developments and important questions in combinatorics. Relations to other areas of mathematics such as analysis, probability, number theory and theoretical computer science. Topics may include the probabilistic method and random graphs, first and second moment methods, symmetric polynomials, bijective methods, posets, generating functions. Prerequisite: Either MATH 2440 , or another full-semester course in discrete math together with MATH 2250 . No prior knowledge of probability is required. QR TTh 9am-10:15am