Complex number field, elementary functions, holomorphic functions, integration, power and Laurent series, harmonic functions, conformal mappings, applications.

A continuation of Math 611. Topics in group theory (e.g., Sylow theorems, solvable and simple groups, Jordan-Holder and Schreier theorems, finitely generated Abelian groups). Topics in ring theory (matrix rings, prime and maximal ideals, Noetherian rings, Hilbert basis theorems). Modules, including cyclic, torsion, and free modules, direct sums, tensor products. Algebraic closure of fields, normal, algebraic, and transcendental field extensions, basic Galois theory. Prerequisite: Math 611 or equivalent.

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.