Georgia Institute of Technology College of Sciences

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. 

Elementary combinatorial techniques and proof methods used in discrete problem solving.

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).

Fourier series, Fourier integrals, boundary value problems for partial differential equations, eigenvalue problems

Topics from complex function theory, including contour integration and conformal mapping

Differentiation of functions of one real variable, Riemann-Stieltjes integral, the derivative in R^n and integration in R^n

Real numbers, topology of Euclidean spaces, Cauchy sequences, completeness, continuity and compactness, uniform continuity, series of functions, Fourier series

Linear algebra in R^n, standard Euclidean inner product in R^n, general linear spaces, general inner product spaces, least squares, determinants, eigenvalues and eigenvectors, symmetric matrices.

The measurement and quantification of information. These ideas are applied to the probabilistic analysis of the transmission of information over a channel along which random distortion of the message occurs.