Estimated Costs of Attendance

These are the estimated costs of attending the University of Iowa for an undergraduate student
enrolled full time (for 12 or more semester hours) for the fall and spring semesters.
Tuition and fees vary for International Students and for undergraduate students in business,
engineering, nursing, pharmacy, and medicine. Tuition and fees for Part-Time Students (enrolled
for fewer than 12 semester hours per semester) are assessed based on the number of semester
hours.
Estimated Costs of Attendance - Living On Campus, 2015-16
Billed expenses
Tuition & fees *
Housing & meals**
Subtotal
Other estimated expenses
Books & supplies
Personal expenses***

Iowa Residents
$8,104

$27,890

9,728

9,728

$17,832

$37,618

Iowa Residents

Total estimated costs

Nonresidents

$1,240

$1,240

1,482

1,482

456

456

$3,178

$3,178

$21,010

$40,796

Transportation
Subtotal

Nonresidents

* Tuition varies for students in these areas of study:

Tuition and fees vary for International Students and for undergraduate students in business,
engineering, nursing, pharmacy, and medicine. Tuition and fees for Part-Time Students (enrolled
for fewer than 12 semester hours per semester) are assessed based on the number of semester
hours.
Estimated Costs of Attendance - Living Off Campus, 2015-16
Billed expenses
Tuition & fees *
Housing & meals**
Subtotal
Other estimated expenses
Books & supplies
Personal expenses***
Transportation

Iowa Residents

Nonresidents

$8,104

$27,890

8,588

8,588

$16,692

$36,478

Iowa Residents

Nonresidents

$1,240

$1,240

2,242

2,242

950

950

Estimated Costs of Attendance - Living Off Campus, 2015-16

Billed expenses
Subtotal
Total estimated costs

Iowa Residents

Nonresidents

$4,432

$4,432

$21,124

$40,910

* Tuition varies for students in these areas of study:

Program Information

Applied Mathematical and Computational Sciences (AMCS) at The University of Iowa is a

broad-based interdisciplinary Ph.D. program for students desiring to study mathematics and a
companion science so that they can apply their mathematical skills to significant scientific
problems. The main goal of the program is to nurture applied mathematicians with sufficient
professional experience and versatility to meet the research, teaching, and industrial needs of our
technology-based society.
While building a base in the Mathematical Sciences, students acquire skills in another area of
their own interest, chosen from the behavioral, biological, business, engineering, medical,
physical, or social science areas. Most students concentrate on applied mathematics such as
differential equations, numerical analysis or optimization, but a few students have used statistics
as their mathematical science base.
The University of Iowa has become a center for the computational sciences. Because of expertise
in fields such as numerical analysis, mathematical programming, parallel and vector processing,
hydraulics and fluid mechanics, heat transfer, dynamic simulation of mechanical systems,
optimization in management sciences and industrial engineering, discrete event simulation,
robotics, atmospheric and environmental studies, climate/chemistry modeling, geographical
decision making, theoretical and plasma physics, and pharmacological and biological modeling,
the computational sciences are now an important part of the program. There is a demand for
mathematical scientists who are trained to use a computational sciences approach in relevant
problems
MAA 6406-7 Complex Analysis
Introduction

The topics below will give you a general idea of what is required for the PhD exam in Complex
Analysis. The exam may vary a bit year to year depending on who has taught MAA 6406/7 and
the text that was used. The most common text is Conways Functions of One Complex Variable
(Graduate Texts in Mathematics Vol 11), Second Edition. The topics below are organized by
chapters in Conways book. Other books may organize things a bit
differently, but most of the basic topics will be the same.

MAA 6616-7 Analysis

Suggested references

There is no prescribed text, but the following textbooks are suggested:

Gerald B. Folland, Real Analysis: Modern Techniques and their Applications,

Wiley, 1999

Walter Rudin, Real and Complex Analysis, McGraw-Hill, 1986

Topics

The PhD examination covers both abstract integration theory and basic
functional analysis. The precise content varies with instructor, but
will include the following:

Measure: -algebras, construction of measures (the Caratheodory

and Hahn-Kolmogorov theorems), Lebesgue measure on Rn, product
measures, signed measures and the Hahn-Jordan decomposition

Integration: measurable functions, the Lebesgue integral, modes of

convergence, the Vitali convergence theorem, the Fubini-Tonelli
theorem, the Radon-Nikodym theorem

Functional Analysis: normed vector spaces and Banach spaces, bounded

linear operators, the Hahn-Banach theorem and its corollaries, dual
spaces, the Baire Category theorem and its applications (Open Mapping
theorem, Closed Graph theorem, Banach isomorphism theorem), the
Banach-Steinhaus theorem, Hilbert spaces,

Lp spaces.

As noted above, additional topics may appear, according to time and

taste; these have included the Lebesgue Differentiation Theorem,
Banach-Mazur distance between normed spaces, and basic results in
Fourier analysis and probability. Students preparing to take the
examination should consult the most recent instructor of the course
for additional information.

MAD 6206-7 Combinatorics

There is no adopted text, but the following are suggested textbooks:

Combinatorics: Topics, Techniques, Algorithms, by Cameron, 1995.

A Course in Combinatorics, by van Lint and Wilson, 2001.

Enumerative Combinatorics, by Stanley, Volume I (2011) and Volume II (2001).

The topics of the PhD Exam vary based upon what was covered during the most recent offering
of MAD 6206/6207, and it is therefore highly recommended that students preparing for the test
meet with the most recent instructor of MAD 6206/6207. At a minimum, students should
demonstrate mastery of the undergraduate sequence MAD 4203/4204, which uses the text A
Walk Through Combinatorics by Bona, 2011.
The topics are roughly divided into five parts:
1. Enumerative combinatorics: generating functions, the binomial theorem, inclusionexclusion, enumeration under group action.
2. Graph theory: connectivity, trees, matchings, coloring, planarity, Eulers theorem,
Ramseys theorem.
3. Order theory: posets, Dilworths theorem, lattice theory, Moebius inversion.
4. Extremal combinatorics: intersecting families, Sperners theorem, the de Bruijn-Erdos
theorem, the probabilistic method (as applied to extremal combinatorics).
5. Designs: Latin squares, Steiner triple systems, projective planes and finite geometries,
block designs, error-correcting codes.
6. Combinatorial algorithms: bubblesort, quicksort, shortest paths, P, NP.

MAS 6331-2
The topics are divided into six general areas:
1. Group Theory
o Nilpotent groups
o Free groups
o Linear groups
2. Category theory
o Categories, subcategories

o Functors, equivalence of categories

o Adjoint functors
o Universal properties, representability
3. Galois theory
o Algebraic closure
o Algebraic, normal and separable extensions
o Galois correspondence (finite extensions)
o Solvability of equations
o Cubic and quartic equations; cyclotomic fields
4. Field theory
o Algebraic and transcendental extensions
o Transcendence basis of an extension
5. Commutative ring theory
o Localization; support of a module
o Spectrum of a commutative ring
o Noetherian and Artinian rings
o Hilbert Nullstellensatz
o Hilbert Basis Theorem
o Integral extensions; integral closure
o Associated primes of a module
o Discrete valuation rings; Dedekind domains
o Projective, injective and flat modules; invertible ideals
6. Noncommutative ring theory

o Tensor products
o Tensor, symmetric and exterior algebras
o Primitive rings; density theorem
o Semisimple rings
o Wedderburns theorem on finite division rings
Bibliography:
In recent years, one of the following has served as the core text for the course.
1. David S. Dummit and Richard M. Foote, Abstract Algebra, 3rd edition, Wiley
2. Thomas W. Hungerford, Algebra, Springer Graduate Texts in Mathematics 73
3. Serge Lang, Algebra, Springer Graduate Texts in Mathematics 211
Supplementary material can be drawn from the following books.
1. Irving Kaplansky, Fields and Rings,
(supplementary material for Galois theory, particularly cubic and quartic equations and
cyclotomic fields; supplementary material for noncommutative rings, particularly
Noetherian and Artinian rings, the Hilbert Nullstellensatz and Hilbert Basis Theorem)
2. Hideyuki Matsumura, Commutative Ring Theory, Cambridge University Press
(supplementary material in the area of commutative ring theory, particularly the first two
and last three subtopics)

MTG 6346-7 Topology

The topics are divided into two modules:
1. General Topology
o Topological spaces, open and closed sets, continuous maps, homeomorphism.
o Connected, path connected, and locally connected spaces. Connected subspaces of
R.
o Compact and locally compact spaces. Compact subspaces of Rn. Compactness in
metric spaces.

o Countability axioms.
o Separation axioms. The Urysohn Lemma.
o The Urysohn Metrization Theorem.
o The Tychonoff Theorem.
o The Stone-Cech compactification.
o Complete metric spaces. Contraction theorem.
o Functional spaces and their topologies. The Arzela-Ascolli Theorem.
o The Baire property and the Baire Theorem.
2. Algebraic Topology
o Homotopy and homotopy type. Deformation retracts and deformation retractions.
Contractible spaces.
o The fundamental group. The fundamental groups of the circle. A topological proof
of the Fundamental Theorem of Algebra.
o The Seifert-van Kampen Theorem.
o Surfaces and their fundamental groups.
o Covering spaces.
o Exact sequences, 5-lemma. Homology groups, homology exact sequence.
Homotopy invariance of homology groups. Excision.
o Homology groups of n-dimensional sphere. The Brouwer Fixed Point Theorem.
The degree of a map SnSn. Vector fields on Sn.
o The Euler characteristic. Lefschetz Fixed Point Theorem
o Cohomology. The cup product and the cap product. The Borsuk-Ulam Theorem.
o The Universal Coefficient theorem.
o Universal Coefficient Formula, The Knneth Formula.

o Manifolds. Orientation. Homology and cohomology of manifolds. Poincar

Duality. The degree of a map.
Literature:
1. J. Munkres, Topology, 2nd edition, Prentice Hall
2. A. Hatcher, Algebraic Topology, Cambridge University Press;
Additional Resources:

Hatchers page on his book

GMA page on past PhD Topology Exa

MAD 6407 Numerical Analysis

There is no adopted text, but the following are suggested textbooks:

Introduction to Numerical Analysis, by J. Stoer and R. Bulirsch, 1992.

Numerical Analysis: Mathematics of Scientific Computing (3rd edition) by David Kincaid

and Ward Cheney, 2002.

An introduction to numerical analysis, by Kendall Atkinson, 1988.

The topics are divided into four modules:

1. Iterative algorithms, convergence, contraction mapping theorem, Newtons method.
2. Lagrange and Hermite interpolation problems, error of polynomial interpolation.
3. Weierstrass theorem, Chebyshev equioscillation theorem, minimax and least square
polynomial approximation, orthogonal polynomial families.
4. Newton-Cotes and Gaussian quadratures, error estimates.

Numerical Linear Algebra Exam Resources

These resources should be helpful to those taking PhD or First Year exam in Numerical Linear
Algebra. A few things may be relevant to just the January, 2015 exam, but they should be
generally useful.
The material is based on class lectures and the text Numerical Linear Algebra by Trefethen and
Bau.

An important note on the text and the exam: The textbook sometimes uses informal, heuristic
or sketches of proofs. However, all answers on a mathematics exam must consist of complete
and rigorous proofs.
Disclaimer: While the exam questions will certainly be in the areas given in the topics below,
there is no guarantee that any specific problem or problems will be on the actual exam.
Some resources:

A list of topics

The previous exams in the GMA archive.

A collection of homework problems assigned during Fall, 2014

Some additional practice problems

A practice final exam for the course which you should take with no notes or
books in two hours maximum.

MAA 5228 Modern Analysis 1

The text for the course is Rudin, Principles of Mathematical Analysis (third edition). The topics
covered fall into five modules, as follows.
1. A review of the real number system, including suprema and infima; a review of the
complex number system, including the Cauchy-Schwarz inequality.
2.

The notions of countability and uncountability. Metric spaces; open sets and closed sets.
Compactness; the Heine-Borel and Bolzano-Weierstrass theorems. Connectedness.

3.

Sequences in metric spaces; subsequences and convergence. Cauchy sequences and

complete spaces. Real sequences, including limsup and liminf, with examples. Real and
complex series: convergence and absolute convergence.

4. Continuous functions between metric spaces. Uniform continuity and continuity on

compact spaces. Continuity on connected spaces and the Intermediate Value theorem.
Discontinuities and monotonic functions.
5. Differentiation of real-valued functions. Fundamental properties, including the chain rule.
The Mean Value theorem, with applications including the lHopital rule. Higher
derivatives and the Taylor theorem.
Note: These modules (in order) closely match the first five chapters of Rudin. Students are
encouraged to supplement their study of the text by attempting problems from previous Firstyear examinations (for which,

MAS 5311 Introduction to Algebra 1

The text for the course is Dummit and Foote, but the topics should be essentially the same
whichever text, if any, is used.
This exam is on Group theory. The exam will test for:

Ability to write clear, rigorous proofs.

A solid understanding of the basic definitions.

Thorough understanding of the statements and proofs of theorems.

Ability to apply theorems to specific situations.

Familiarity with a broad range of examples and ability to do computations with them.

All topics are examinable except for those explicitly excluded. In the case of very long proofs,
exam questions may involve only a part of the argument. In exams it is generally allowed to
apply main theorems by quoting them correctly, as long as doing so does not result in circular
logic, as would be the case if the question is really asking for part of the proof of the theorem
quoted.
The modules below (in order) correspond to the first six chapters of Dummit and Foote.
1. The section on generators and relations is not examinable. Topics: Definition of groups,
basic examples, dihedral groups, symmetric groups, matrix groups, the quaternion group,
homomorphisms and isomorphisms, group actions.
2. Subgroup lattices of particular groups should be studied but not
memorized Topics: Subgroups, centralizers and normalizers, cyclic groups, subgroup
generated by a subset, the subgroup lattice.

3. Topics: Cosets, normal subgroups, quotient groups, cosets and Lagranges Theorem,
isomorphism theorems, simple groups, composition series, Jordan Hoelder theorem,
Alternating groups.
4. Topics: Permutation representations, actions on coset spaces, action by conjugation,
automorphisms, Sylow theorems, simplicity of alternating groups.
5. The lists of small groups in 5.3 should be studied, but not memorized. Topics: Direct
products, the fundamental theorem for finite abelian groups (statement and applications
are examinable, but not the proof), semidirect products, examples of groups of small
order.
6. Sections 6.2 and 6.3 are optional and not examinable. Topics: p-groups, nilpotent groups,
solvable groups; Not for Examination: Free groups, generators and relations

http://www.math.ufl.edu/graduate-program/first-year-exam-syllabi/

PartTime Instructors Department of Mathematics The University of Georgia

The Department of Mathematics at the University of Georgia seeks to hire nontenure track part
time instructors beginning August 2015. Typical teaching load is up to four courses per
semester. Position may be renewable based upon annual performance evaluations, student
demand, and instructional funding.
Qualifications: M.A. or Ph.D. (preferable) in Mathematics or related discipline and
demonstrated teaching experience.