Not available at this time

Not available at this time

Not available at this time

Not available at this time

Not available at this time

Not available at this time

We learn how to build, use, and critique mathematical models. In modeling we translate scientific questions into mathematical language, and thereby we aim to explain the scientific phenomena under investigation. Models can be simple or very complex, easy to understand or extremely difficult to analyze. We introduce some classic models from different branches of science that serve as prototypes for all models. Student groups will be formed to investigate a modeling problem themselves and each group will report its findings to the class in a final presentation.

This is a rigorous introduction to some topics in mathematics that underlie areas in computer science and computer engineering, including: graphs and trees, spanning trees, colorings and matchings, the pigeonhole principle, induction and recursion, generating functions, and (if time permits) combinatorial geometry. The course integrates mathematical theories with applications to concrete problems from other disciplines using discrete modeling techniques.

Complex numbers and functions, analytic functions, complex integration, series, residues, conformal mappings. Applications: computation of real integrals, Dirichlet's boundary value problem and its application to physics and engineering. Prerequisite: MATH 233.

Continuation of MATH 411.