Spring 2020

Archived:

## Introduction to Discrete Mathematics

Mathematical logic and proof, mathematical induction, counting methods, recurrence relations, algorithms and complexity, graph theory and graph algorithms.

## Analysis I

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

## Abstract Algebra I

This course develops in the theme of "Arithmetic congruence, and abstract algebraic structures." There will be a very strong emphasis on theory and proofs.

## Introduction to Number Theory

Primes and unique factorization, congruences, Chinese remainder theorem, Diophantine equations, Diophantine approximations, quadratic reciprocity. Applications such as fast multiplication, factorization and encryption.

## Numerical Analysis I

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

## Classical Mathematical Methods in Engineering

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

## Complex Analysis

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

## Analysis II

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

## Topics in Linear Algebra

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.

## Introduction to Information Theory

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.