This course develops in the theme of "Arithmetic congruence, and abstract algebraic structures." There will be a very strong emphasis on theory and proofs.
Combinatorial problem-solving techniques including the use of generating functions, recurrence relations, Polya theory, combinatorial designs, Ramsey theory, matroids, and asymptotic analysis.
This course is a problem oriented introduction to the basic concepts of probability and statistics, providing a foundation for applications and further study.
MATH 3215, MATH 3235, and MATH 3670 are mutually exclusive; students may not hold credit for more than one of these courses.
Problems from the life sciences and the mathematical methods for solving them are presented. The underlying biological and mathematical principles and the interrelationships are emphasized.
Introduction to numerical algorithms for some basic problems in computational mathematics. Discussion of both implementation issues and error analysis. Crosslisted with CX 4640 (formerly CS 4642).
A study of the linear programming problem, including the simplex method, duality, and sensitivity analysis with applications to matrix games, integer programming and networks.
Introduction to algebraic methods in topology. Includes homotopy, the fundamental group, covering spaces, simplicial complexes. Applications to fixed point theory and group theory.
