Reading courses for upper division students of high standing.

Reading courses for upper division students of high standing.

Reading courses for upper division students of high standing.

Reading courses for upper division students of high standing.

Reading courses for upper division students of high standing.

Reading courses for upper division students of high standing.

Reading courses for upper division students of high standing.

A basic course in the theory of counting and graph theory. Topics in enumerative combinatorics may include: generating functions, compositions, partitions, Fibonacci numbers, permutations, cycle structure of permutations, permutations statistics, Stirling numbers of the first and second kind, Bell numbers, or inclusion-exclusion. Topics in graph theory may include: Eulerian and Hamiltonian cycles, matrix tree theorem, planar graphs and the 4-color theorem, chromatic polynomial, Hall's marriage theorem, stable marriage theorem, Ramsey theory, or electrical networks.

The course is an introduction to modern operations research and includes discussion of modeling, linear programming, dynamic programming, integer programming, scheduling and inventory problems and network algorithms.

A careful and vigorous investigation of the calculus of functions of a single variable. Topics will include elementary topological properties of the real line, convergence limits, continuity, differentiation and integration. Prereq: MA 213 and MA 322; or consent of the instructor.