CMSC 27400 - Honors Combinatorics and Probability

Institution:
University of Chicago
Subject:
Description:
PQ: MATH 25000 or 25400, or CMSC 27100, or consent of instructor. Experience with mathematical proofs. Methods of enumeration, construction, and proof of existence of discrete structures are discussed in conjunction with the basic concepts of probability theory over a finite sample space. Enumeration techniques are applied to the calculation of probabilities, and, conversely, probabilistic arguments are used in the analysis of combinatorial structures. Other topics include basic counting, linear recurrences, generating functions, Latin squares, finite projective planes, graph theory, Ramsey theory, coloring graphs and set systems, random variables, independence, expected value, standard deviation, and Chebyshev's and Chernoff' s inequalities . L. Babai. Spring.
Credits:
3.00
Credit Hours:
Prerequisites:
Corequisites:
Exclusions:
Level:
Instructional Type:
Lecture
Notes:
Additional Information:
Historical Version(s):
Institution Website:
Phone Number:
(773) 702-1234
Regional Accreditation:
North Central Association of Colleges and Schools
Calendar System:
Quarter

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.

Detail Course Description Information on CollegeTransfer.Net

Copyright 2006 - 2025 AcademyOne, Inc.