MATHEMATICS
(AS) {MATH}

CALCULUS: MATH 104, the first calculus course, assumes that students have had AB Calculus or the equivalent. Students who have not had AB Calculus or did poorly in AB Calculus should take MATH 103, which provides an introduction to calculus. There are two second-semester calculus courses. Students are advised to check their major department or their program for the specific requirements. In general, Math 114 is taken by students in the natural sciences, engineering and economics. Math 114 prepares students for the more advanced Calculus courses Math 240 and 241. Those who do not plan to take Math 240 may still want to consider taking Math 114. Math 115 is for students who do not plan to take more calculus like Math 240, and want an introduction to probability and matrices. Premed students who do not need Math 114 for their majors could take Math 115. Most Wharton students may take either Calculus II course.

MATH 103, 104, 114, 115, and 170 fulfill the FORMAL REASONING & ANALYSIS General Requirement. Also, MATH 170 satisfies the NATURAL SCIENCE & MATHEMATICS General Requirement.

Students may not receive credit for two courses at the same level where the content is similar. For example, a student may not receive credit for both MATH 114 and MATH 115. The list of FORBIDDEN PAIRS of courses is (114, 115), (312, 370), (312, 412), (360, 508), (361, 509), (370, 502), (371, 503), and several statistics courses. Students are allowed to take a "topics course" such as MATH 480 more than once if the topics are different.

PROSPECTIVE MATH MAJORS should note that the "proof in mathematics" courses, 202 and 203, are recommended for the major. These are courses that are taken concurrently with Calculus. Potential majors who begin Calculus with MATH 114 or 240 usually take at least one of these courses during their freshman year. Potential majors who begin with MATH 104 often postpone their proof courses until the following year.Please see http//www.math.upenn.edu/ugrad/major.html for more information. To find out the requirements for MATH MINORS, please visit our web site http//www.math.upenn.edu/ugrad/minor.html for details. Majors and Minors could also find the most current listing of the cognate courses Majors or Minors may take at http//www.math.upenn.edu/ugrad/cognates.html

L/R 103. Introduction to Calculus. (C) Staff.

Introduction to concepts and methods of calculus for students with little or no previous calculus experience. Polynomial and elementary transcendental functions and their applications, derivatives, extremum problems, curve-sketching, approximations; integrals and the fundamental theorem of calculus.

L/R 104. Calculus, Part I. (C) Staff.

Brief review of High School calculus, applications of integrals, transcendental functions, methods of integration, infinite series, Taylor's theorem. Use of symbolic manipulation and graphics software in calculus.

L/R 114. Calculus, Part II. (C) Staff. Prerequisite(s): Math 104.

Functions of several variables, vector-valued functions, partial derivatives and applications, double and triple integrals, conic sections, polar coordinates, vectors and analytic geometry, first and second order ordinary differential equations. Applications to physical sciences. Use of symbolic manipulation and graphics software in calculus.

L/R 115. Calculus, Part II with Probability and Matrices. (C) Staff. Prerequisite(s): Math 104.

Functions of several variables, partial derivatives, multiple integrals, differential equations; introduction to linear algebra and matrices with applications to linear programming and Markov processes. Elements of probability and statistics. Applications to social and biological sciences. Use of symbolic manipulation and graphics software in calculus.

L/L 123. Community Math Teaching Project. (M) Staff.

This course allows Penn students to teach a series of hands-on activities to students in math classes at University City High School. The semester starts with an introduction to successful approaches for teaching math in urban high schools. The rest of the semester will be devoted to a series of weekly hands-on activities designed to teach fundamental aspects of geometry. The first class meeting of each week, Penn faculty teach Penn students the relevant mathematical background and techniques for a hands-on activity. During the second session of each week, Penn students will teach the hands-on activity to a small group of UCHS students. The Penn students will also have an opportunity to develop their own activity and to implement it with the UCHS students.

L/R 170. Ideas in Mathematics. (C) Natural Science & Mathematics Sector. Class of 2010 and beyond. Staff. May also be counted toward the General Requirement in Natural Science & Mathematics.

Topics from among the following: logic, sets, calculus, probability, history and philosophy of mathematics, game theory, geometry, and their relevance to contemporary science and society.

180. (PPE 180) Analytical Methods in Economics, Law, and Medicine. (M) Staff.

Elementary applications of decision analysis, game theory, probability and statistics to issues in accounting, contracting, finance, law, and medicine, amongst others.

L/L 202. Proving Things: Analysis. (C) Staff. Corequisite(s): Math 104, 114 or 240.

This course focuses on the creative side of mathematics, with an emphasis on discovery, reasoning, proofs and effective communication, while at the same time studying real and complex numbers, sequences, series, continuity, differentiability and integrability. Small class sizes permit an informal, discussion-type atmosphere, and often the entire class works together on a given problem. Homework is intended to be thought-provoking, rather than skill-sharpening.

L/L 203. Proving things: Algebra. (C) Staff. Corequisite(s): Math 104, 114 or 240.

This course focuses on the creative side of mathematics, with an emphasis on discovery, reasoning, proofs and effective communication, while at the same time studying arithmetic, algebra, linear algebra, groups, rings and fields. Small class sizes permit an informal, discussion-type atmosphere, and often the entire class works together on a given problem. Homework is intended to be thought-provoking, rather than skill-sharpening.

210. Mathematics in the Age of Information. (C) Staff. Prerequisite(s): Math 114, Math 115 or equivalent.

This course counts as a regular elective for both the Mathematics Major and Minor.

Style: the course will center around a sequence of case studies and projects rather than go systematically through a textbook. Many of these topics will be drawn from current events in the world. The class will be divided into small teams that will carry out work on each topic, perform whatever mathematical analysis is appropriate according to the mathematical topics being discussed.

Internet. An important ingredient in the course will be to learn to present interactive material on the Web using a computer language such as Perl. No special computer background is presumed; learning it is part of the course.

Topics: Some probability/statistics (including Markov chains), mathematical modeling (including differential equations). Many of the topics will use calculus and matrices.

L/R 240. Calculus, Part III. (C) Staff. Prerequisite(s): Calculus II.

Linear algebra: vectors, matrices, systems of linear equations, eigenvalues and eigenvectors. Vector calculus: functions of several variables, vector fields, line and surface integrals, Green's, Stokes' and divergence theorems. Series solutions of ordinary differential equations, Laplace transforms and systems of ordinary differential equations. Use of symbolic manipulation and graphics software.

L/R 241. Calculus, Part IV. (C) Staff. Prerequisite(s): MATH 240.

St urm-Liouville problems, orthogonal functions, Fourier series, and partial differential equations including solutions of the wave, heat and Laplace equations, Fourier transforms. Introduction to complex analysis. Use of symbolic manipulation and graphics software.

312. (MATH412) Linear Algebra. (M) Staff. Prerequisite(s): MATH 240. Students who have already received credit for either Math 370, 371, 502 or 503 cannot receive further credit for Math 312 or Math 313/513. Students can receive credit for at most one of Math 312 and Math 313/513.

Linear transformations, Gauss Jordan elimination, eigenvalues and eigenvectors, theory and applications. Mathematics majors are advised that MATH 312 cannot be taken to satisfy the major requirements.

313. (CIS 313, MATH513) Computational Linear Algebra. Staff. Prerequisite(s): Math 114 or 115, and some programming experience. Students who have already received credit for either Math 370, 371, 502 or 503 cannot receive further credit for Math 312 or Math 313/513. Students can receive credit for at most one of Math 312 and Math 313/513.

Many important problems in a wide range of disciplines within computer science and throughout science are solved using techniques from linear algebra. This course will introduce students to some of the most widely used algorithms and illustrate how they are actually used.

Some specific topics: the solution of systems of linear equations by Gaussian elimination, dimension of a linear space, inner product, cross product, change of basis, affine and rigid motions, eigenvalues and eigenvectors, diagonalization of both symmetric and non-symmetric matrices, quadratic polynomials, and least squares optimazation.

Applications will include the use of matrix computations to computer graphics, use of the discrete Fourier transform and related techniques in digital signal processing, the analysis of systems of linear differential equations, and singular value deompositions with application to a principal component analysis.

The ideas and tools provided by this course will be useful to students who intend to tackle higher level courses in digital signal processing, computer vision, robotics, and computer graphics.

320. Computer Methods in Mathematical Science I. (A) Staff. Prerequisite(s): MATH 240 or concurrent and ability to program a computer, or permission of instructor.

Students will use symbolic manipulation software and write programs to solve problems in numerical quadrature, equation-solving, linear algebra and differential equations. Theoretical and computational aspects of the methods will be discussed along with error analysis and a critical comparison of methods.

321. Computer Methods in Mathematical Sciences II. (M) Staff. Prerequisite(s): MATH 320.

Continuation of MATH 320.

340. (LGIC210) Discrete Mathematics I. (M) Staff. Prerequisite(s): MATH 114 or Math 115 or permission of the instructor.

Topics will be drawn from some subjects in combinatorial analysis with applications to many other branches of math and science: graphs and networks, generating functions, permutations, posets, asymptotics.

341. (LGIC220) Discrete Mathematics II. Staff. Prerequisite(s): Math 340/Logic 210 or permission of the instructor.

Topics will be drawn from some subjects useful in the analysis of information and computation: logic, set theory, theory of computation, number theory, probability, and basic cryptography.

350. Number Theory. (M) Staff.

Congruences, Diophantine equations, continued fractions, nonlinear congruences, and quadratic residues.

L/L 360. Advanced Calculus. (C) Staff. Prerequisite(s): MATH 240.

Syllabus for MATH 360-361: a study of the foundations of the differential and integral calculus, including the real numbers and elementary topology, continuous and differentiable functions, uniform convergence of series of functions, and inverse and implicit function theorems. MATH 508-509 is a masters level version of this course.

L/L 361. Advanced Calculus. (C) Staff. Prerequisite(s): MATH 360.

Continuation of MATH 360.

L/L 370. Algebra. (C) Staff. Prerequisite(s): MATH 240. Students who have already received credit for either Math 370, 371, 502 or 503 cannot receive further credit for Math 312 or Math 313/513. Students can receive credit for at most one of Math 312 and Math 313/513.

Syllabus for MATH 370-371: an introduction to the basic concepts of modern algebra. Linear algebra, eigenvalues and eigenvectors of matrices, groups, rings and fields. MATH 502-503 is a masters level version of this course.

L/L 371. Algebra. (C) Staff. Prerequisite(s): MATH 370. Students who have already received credit for either Math 370, 371, 502 or 503 cannot receive further credit for Math 312 or Math 313/513. Students can receive credit for at most one of Math 312 and Math 313/513.

Continuation of MATH 370.

410. Complex Analysis. (C) Staff. Prerequisite(s): MATH 241 or permission of instructor.

Complex numbers, DeMoivre's theorem, complex valued functions of a complex variable, the derivative, analytic functions, the Cauchy-Riemann equations, complex integration, Cauchy's integral theorem, residues, computation of definite integrals by residues, and elementary conformal mapping.

420. Ordinary Differential Equations. (C) Staff. Prerequisite(s): MATH 241 or permission of instructor.

After a rapid review of the basic techniques for solving equations, the course will discuss one or more of the following topics: stability of linear and nonlinear systems, boundary value problems and orthogonal functions, numerical techniques, Laplace transform methods.

425. Partial Differential Equations. (A) Staff. Prerequisite(s): MATH 241 or permission of instructor. Knowledge of PHYS 150-151 will be helpful.

Method of separation of variables will be applied to solve the wave, heat, and Laplace equations. In addition, one or more of the following topics will be covered: qualitative properties of solutions of various equations (characteristics, maximum principles, uniqueness theorems), Laplace and Fourier transform methods, and approximation techniques.

430. Introduction to Probability. (M) Staff. Prerequisite(s): MATH 240.

Random variables, events, special distributions, expectations, independence, law of large numbers, introduction to the central limit theorem, and applications.

432. Game Theory. (C) Staff.

A mathematical approach to game theory, with an emphasis on examples of actual games. Topics will include mathematical models of games, combinatorial games, two person (zero sum and general sum) games, non-cooperating games and equilibria.

450. (MATH542) Seminar in Computational Mathematics. (M) Staff. Prerequisite(s): Permission of instructor. May, with permission, be repeated for credit.

A seminar devoted to the study of algorithms for solving problems in discrete mathematics.

475. Statistics of Law. (M) Staff. Prerequisite(s): Permission of instructor; no formal mathematical prerequisite, but one year of college calculus would be helpful.

Introduction to probability and statistics with illustrative material drawn from cases. Statistical inference. Basic concepts of information theory. This course may not be taken to satisfy the requirements of the major.

480. (MATH550) Topics in Modern Math. (M) Staff.

A survey of a number of actively-growing areas of mathematics, according to the interests of the students and the instructor. For example, the course might focus on famous unsolved problems, such as the Riemann Hypothesis. Explorations with computer packages for symbolic manipulation.

499. Supervised Study. (C) Staff. Prerequisite(s): Permission of major adviser. Hours and credit to be arranged.

Study under the direction of a faculty member. Intended for a limited number of mathematics majors.

500. Geometry-Topology, Differential Geometry. (M) Staff. Prerequisite(s): Math 240/241.

Point set topology: metric spaces and topological spaces, compactness, connectedness, continuity, extension theorems, separation axioms, quotient spaces, topologies on function spaces, Tychonoff theorem. Fundamental groups and covering spaces, and related topics.

501. Geometry-Topology, Differential Geometry. (M) Staff. Prerequisite(s): Math 500 or with the permission of the instructor.

Review of 2- and 3-dimensional vector calculus, differential geometry of curves and surfaces, Gauss-Bonnet theorem, elementary Riemannian geometry, knot theory, degree theory of maps, transversality.

L/L 502. Abstract Algebra. (A) Staff. Prerequisite(s): Math 240. Students who have already received credit for either Math 370, 371, 502 or 503 cannot receive further credit for Math 312 or Math 313/513. Students can receive credit for at most one of Math 312 and Math 313/513.

An introduction to groups, rings, fields and other abstract algebraic systems, elementary Galois Theory, and linear algebra -- a more theoretical course than Math 370.

L/L 503. Abstract Algebra. (B) Staff. Prerequisite(s): Math 502 or with the permission of the instructor. Students who have already received credit for either Math 370, 371, 502 or 503 cannot receive further credit for Math 312 or Math 313/513. Students can receive credit for at most one of Math 312 and Math 313/513.

Continuation of Math 502.

504. Graduate Proseminar in Mathematics. (A) Staff.

This course focuses on problems from Algebra (especially linear algebra and multilinear algebra) and Analysis (especially multivariable calculus through vector fields, multiple integrals and Stokes theorem). The material is presented through student solving of problems. In addition there will be a selection of advanced topics which will be accessible via this material.

505. Graduate Proseminar in Mathematics. (B) Staff.

L/L 508. Advanced Analysis. (A) Staff. Prerequisite(s): Math 240/241. Math 200/201 also recommended.

Construction of real numbers, the topology of the real line and the foundations of single variable calculus. Notions of convergence for sequences of functions. Basic approximation theorems for continuous functions and rigorous treatment of elementary transcendental functions. The course is intended to teach students how to read and construct rigorous formal proofs. A more theoretical course than Math 360.

L/L 509. Advanced Analysis. (B) Staff. Prerequisite(s): Math 508 or with the permission of the instructor. Linear algebra is also helpful.

Continuation of Math 508. The Arzela-Ascoli theorem. Introduction to the topology of metric spaces with an emphasis on higher dimensional Euclidean spaces. The contraction mapping principle. Inverse and implicit function theorems. Rigorous treatment of higher dimensional differential calculus. Introduction to Fourier analysis and asymptotic methods.

512. Advanced Linear Algebra. Staff. Prerequisite(s): Math 114 or 115. Math 512 covers Linear Algebra at the advanced level with a theoretical approach. Students can receive credit for at most one of Math 312 and Math 512.

Topics will include: Vector spaces, Basis and dimension, quotients; Linear maps and matrices; Determinants, Dual spaces and maps; Invariant subspaces, Cononical forms; Scalar products: Euclidean, unitary and symplectic spaces; Orthogonal and unitary operators; Tensor products and polylinear maps; Symmetric and skew-symmetric tensors and exterior algebra.

513. (CIS 313, MATH313) Computational Linear Algebra. Staff.

A number of important and interesting problems in a wide range of disciplines within computer science are solved by recourse to techniques from linear algebra. The goal of this course will be to introduce students to some of the most important and widely used algorithms in matrix computation and to illustrate how they are actually used in various settings. Motivating applications will include: the solution of systems of linear equations, applications matrix computations to modeling geometric transformations in graphics, applications of the Discrete Fourier Transform and related techniques in digital signal processing, the solution of linear least squares optimization problems and the analysis of systems of linear differential equations. The course will cover the theoretical underpinnings of these problems and the numerical algorithms that are used to perform important matrixcomputations such as Gaussian Elimination, LU Decomposition and Singular Value Decomposition.

520. Selections from Algebra. (M) Staff. Corequisite(s): Math 502 or permission of the instructor.

Informal introduction to such subjects as homological algebra, number theory, and algebraic geometry.

521. Selections from Algebra. (M) Staff. Corequisite(s): Math 502 or permission of the instructor.

Informal introduction to such subjects as homological algebra, number theory, and algebraic geometry.

524. Topics in Modern Applied Algebra. (M) Staff. Prerequisite(s): Math 371 or Math 503.

Topics such as automata, finite state languages, Boolean algebra, computers and logical design will be discussed.

525. Topics in Modern Applied Algebra. (M) Staff. Prerequisite(s): Math 371 or Math 503.

Topics such as automata, finite state languages, Boolean algebra, computers and logical design will be discussed.

530. Mathematics of Finance. (M) Staff. Prerequisite(s): Math 240, Stat 430.

This course presents the basic mathematical tools to model financial markets and to make calculations about financial products, especially financial derivatives. Mathematical topics covered: stochastic processes, partial differential equations and their relationship. No background in finance is assumed.

540. (MATH730) Selections from Classical and Functional Analysis. (M) Staff. Corequisite(s): Math 508 or permission of the instructor.

Informal introduction to such subjects as compact operators and Fredholm theory, Banach algebras, harmonic analysis, differential equations, nonlinear functional analysis, and Riemann surfaces.

541. Selections from Classical and Functional Analysis. (M) Staff. Corequisite(s): Math 508 or permission of the instructor.

Informal introduction to such subjects as compact operators and Fredholm theory, Banach algebras, harmonic analysis, differential equations, nonlinear functional analysis, and Riemann surfaces.

542. (MATH450) Calculus of Variations. (M) Staff. Prerequisite(s): Math 241.

Introduction to calculus of variations. The topics will include the variation of a functional, the Euler-Lagrange equations, parametric forms, end points, canonical transformations, the principle of least action and conservation laws, the Hamilton-Jacobi equation, the second variation.

546. (STAT530) Probability Theory. (A) Staff.

The required background is (1) enough math background to understand proof techniques in real analysis (closed sets, uniform covergence, fourier series, etc.) and (2) some exposure to probability theory at an intuitive level (a course at the level of Ross's probability text or some exposure to probability in a statistics class).

After a summary of the necessary results from measure theory, we will learn the probabist's lexicon (random variables, independence, etc.). We will then develop the necessary techniques (Borel Cantelli lemmas, estimates on sums of independent random variables and truncation techniques) to prove the classical laws of large numbers. Next come Fourier techniques and the Central Limit Theorem, followed by combinatorial techniques and the study of random walks.

547. (STAT531) Stochastic Processes. (M) Staff.

548. Topics in Analysis. (M) Staff. Prerequisite(s): Math 360/361 and Math 370; or Math 508/509 and Math 502.

Topics may vary but typically will include an introduction to topological linear spaces and Banach spaces, and to Hilbert space and the spectral theorem. More advanced topics may include Banach algebras, Fourier analysis, differential equations and nonlinear functional analysis.

549. Topics in Analysis. (M) Staff. Prerequisite(s): Math 548 or with the permission of the instructor.

Continuation of Math 548.

560. Selections from Geometry and Topology. (M) Staff. Corequisite(s): Math 500 or permission of the instructor.

Informal introduction to such subjects as homology and homotopy theory, classical differential geometry, dynamical systems, and knot theory.

561. Selections from Geometry and Topology. (M) Staff. Corequisite(s): Math 500 or permission of the instructor.

Informal introduction to such subjects as homology and homotopy theory, classical differential geometry, dynamical systems, and knot theory.

570. (LGIC310, PHIL006, PHIL506) Introduction to Logic and Computability. (M) Staff. Prerequisite(s): Math 371 or Math 503.

Propositional logic: semantics, formal deductions, resolution method. First order logic: validity, models, formal deductions; Godel's completeness theorem, Lowenheim-Skolem theorem: cut-elimination, Herbrand's theorem, resolution method.Computability: finite automata, Turing machines, Godel's incompleteness theorems. Algorithmically unsolvable problems in mathematics.

SM 571. (LGIC320, MATH671, PHIL412) Introduction to Logic and Computability. (M) Staff. Prerequisite(s): Math 570 or with the permission of the instructor.

Continuation of Math 570.

572. Introduction to Axiomatic set theory. Staff.

Topics will include: the axioms, ordinal and cardinal arithmetic, formal construction of natural numbers and real numbers within set theory, formal treatment of definition by recursion.

574. Mathematical Theory of Computation. (M) Staff. Prerequisite(s): Math 320/321.

This course will discuss advanced topics in Mathematical Theory of Computation.

575. Mathematical Theory of Computation. (M) Staff. Prerequisite(s): Math 574 or with the permission of the instructor.

Continuation of Math 574.

580. Combinatorial Analysis and Graph Theory. (M) Staff. Prerequisite(s): Permission of the instructor.

Generating functions, enumeration methods, Polya's theorem, combinatorial designs, discrete probability, extremal graphs, graph algorithms and spectral graph theory, combinatorial and computational geometry.

581. Combinatorial Analysis and Graph Theory. (M) Staff. Prerequisite(s): Math 580 or with the permission of the instructor.

Continuation of Math 580.

582. Applied Mathematics and Computation. (M) Staff. Prerequisite(s): Math 240-241. Math 312, Math 360. Knowledge of Math 412 and Math 508 is recommended.

This course offers first-hand experience of coupling mathematics with computing and applications. Topics include: Random walks, randomized algorithms, information theory, coding theory, cryptography, combinatorial optimization, linear programming, permutation networks and parallel computing. Lectures will be supplemented by informal talks by guest speakers from industry about examples and their experience of using mathematics in the real world.

583. Applied Mathematics and Computation. (M) Staff. Prerequisite(s): Math 582 or with the permission of the instructor.

Continuation of Math 582.

584. (BE 584) The Mathematics of Medical Imaging and Measurement. (M) Staff. Prerequisite(s): Math 241, knowledge of linear algebra and basic physics.

In the last 25 years there has been a revolution in image reconstruction techniques in fields from astrophysics to electron microscopy and most notably in medical imaging. In each of these fields one would like to have a precise picture of a 2 or 3 dimensional object which cannot be obtained directly.The data which is accesible is typically some collection of averages. The problem of image reconstruction is to build an object out of the averaged data and then estimate how close the reconstruction is to the actual object. In this course we introduce the mathematical techniques used to model measurements and reconstruct images. As a simple representative case we study transmission X-ray tomography (CT).In this context we cover the basic principles of mathematical analysis, the Fourier transform, interpolation and approximation of functions, sampling theory, digital filtering and noise analysis.

585. The Mathematics of Medical Imaging and Measurement. (M) Staff. Prerequisite(s): Math 584 or with the permission of the instructor.

Continuation of Math 584.

590. Advanced Applied Mathematics. (M) Staff. Prerequisite(s): Math 241.

This course offers first-hand experience of coupling mathematics with applications. Topics will vary from year to year. Among them are: Random walks and Markov chains, permutation networks and routing, graph expanders and randomized algorithms, communication and computational complexity, applied number theory and cryptography.

591. Advanced Applied Mathematics. (M) Staff. Prerequisite(s): Math 590 or with the permission of the instructor.

Continuation of Math 590.

594. (PHYS500) Advanced Methods in Applied Mathematics. (M) Staff. Prerequisite(s): Math 241 or Permission of Instructor. Physics 151 would be helpful for undergraduates.

Introduction to mathematics used in physics and engineering, with the goal of developing facility in classical techniques. Vector spaces, linear algebra, computation of eigenvalues and eigenvectors, boundary value problems, spectral theory of second order equations, asymptotic expansions, partial differential equations, differential operators and Green's functions, orthogonal functions, generating functions, contour integration, Fourier and Laplace transforms and an introduction to representation theory of SU(2) and SO(3). The course will draw on examples in continuum mechanics, electrostatics and transport problems.

599. Independent Study. (C)

600. Topology and Geometric Analysis. (A) Staff. Prerequisite(s): Math 500/501 or with the permission of the instructor.

Differentiable functions, inverse and implicit function theorems. Theory of manifolds: differentiable manifolds, charts, tangent bundles, transversality, Sard's theorem, vector and tensor fields and differential forms: Frobenius' theorem, integration on manifolds, Stokes' theorem in n dimensions, de Rham cohomology. Introduction to Lie groups and Lie group actions.

601. Topology and Geometric Analysis. (B) Staff. Prerequisite(s): Math 600 or with the permission of the instructor.

Covering spaces and fundamental groups, van Kampen's theorem and classification of surfaces. Basics of homology and cohomology, singular and cellular; isomorphism with de Rham cohomology. Brouwer fixed point theorem, CW complexes, cup and cap products, Poincare duality, Kunneth and universal coefficient theorems, Alexander duality, Lefschetz fixed point theorem.

602. Algebra. (A) Staff. Prerequisite(s): Math 370/371 or Math 502/503.

Group theory: permutation groups, symmetry groups, linear algebraic groups, Jordan-Holder and Sylow theorems, finite abelian groups, solvable and nilpotent groups, p-groups, group extensions. Ring theory: Prime and maximal ideals, localization, Hilbert basis theorem, integral extensions, Dedekind domains, primary decomposition, rings associated to affine varieties, semisimple rings, Wedderburn's theorem, elementary representation theory. Linear algebra: Diagonalization and canonical form of matrices, elementary representation theory, bilinear forms, quotient spaces, dual spaces, tensor products, exact sequences, exterior and symmetric algebras. Module theory: Tensor products, flat and projective modules, introduction to homological algebra, Nakayama's Lemma. Field theory: separable and normal extensions, cyclic extensions, fundamental theorem of Galois theory, solvability of equations.

603. Algebra. (B) Staff. Prerequisite(s): Math 602 or with the permission of the instructor.

Continuation of Math 602.

604. First Year Seminar in Mathematics. (A) Staff. Prerequisite(s): Open to first year Mathematics graduate students. Others need permission of the instructor.

This is a seminar for first year Mathematics graduate student, supervised by faculty. Students give talks on topics from all areas of mathematics at a level appropriate for first year graduate students. Attendance and preparation will be expected by all participants, and learning how to present mathematics effectively is an important part of the seminar.

605. First Year Seminar in Mathematics. (B) Staff. Prerequisite(s): Open to first year Mathematics graduate students. Ohters need permission of the instructor.

Continuation of Math 604.

608. Real Analysis. (C) Staff. Corequisite(s): Math 600/601.

Lebesgue measure and integral, Borel measures, convergence theorems. Banach spaces, Hahn-Banach Theorem, Lp-spaces, Riesz-Fischer theorem, Stone-Weierstrass theorem, Radon-Nikodym theorem. Applications to Fourier series and integrals, Plancherel Theorem, Distributions, convolutions and mollifiers. Partitions of unity. Applications to P.D.E.'s

609. Complex Analysis. (C) Staff. Corequisite(s): Math 600/601.

Complex numbers, analytic functions, Cauchy's theorem and consequences, isolated singularities, analytic continuation, open mapping theorem, infinite series and products, harmonic and subharmonic functions, maximum principle, fractorial linear transformations, geometric and local properties of analytic functions, Weierstrauss Theorem, normal families, residues, conformal mapping, Riemann mapping theorem, branch points, second order linear O.D.E.'s.

618. Algebraic Topology, Part I. (A) Staff. Prerequisite(s): Math 600/601 or with the permission of the instructor.

Homotopy groups, Hurewicz theorem, Whitehead theorem, spectral sequences. Classification of vector bundles and fiber bundles. Characteristic classes and obstruction theory.

619. Algebraic Topology, Part I. (B) Staff. Prerequisite(s): Math 618 or with the permission of the instructor.

Rational homotopy theory, cobordism, K-theory, Morse theory and the h-corbodism theorem. Surgery theory.

SM 878. Probability and Algorithm Seminar. Staff.

Seminar on current and recent literature in probability and algorithm.

Advanced Graduate Courses

Algebra

620. Algebraic Number Theory. (M) Staff. Prerequisite(s): Math 602/603.

Dedekind domains, local fields, basic ramification theory, product formula, Dirichlet unit theory, finiteness of class numbers, Hensel's Lemma, quadratic and cyclotomic fields, quadratic reciprocity, abelian extensions, zeta and L-functions, functional equations, introduction to local and global class field theory. Other topics may include: Diophantine equations, continued fractions, approximation of irrational numbers by rationals, Poisson summation, Hasse principle for binary quadratic forms, modular functions and forms, theta functions.

621. Algebraic Number Theory. (M) Staff. Prerequisite(s): Math 620 or with the permission of the instructor.

Continuation of Math 620.

622. Complex Algebraic Geometry. (M) Staff. Prerequisite(s): Math 602/603 and Math 609.

Algebraic geometry over the complex numbers, using ideas from topology, complex variable theory, and differential geometry. Topics include: Complex algebraic varieties, cohomology theories, line bundles, vanishing theorems, Riemann surfaces, Abel's theorem, linear systems, complex tori and abelian varieties, Jacobian varieties, currents, algebraic surfaces, adjunction formula, rational surfaces, residues.

L/L 623. Complex Algebraic Geometry. (M) Staff. Prerequisite(s): Math 622 or with the permission of the instructor.

Continuation of Math 622.

624. Algebraic Geometry. (M) Staff. Prerequisite(s): Math 602/603.

Algebraic geometry over algebraically closed fields, using ideas from commutative algebra. Topics include: Affine and projective algebraic varieties, morphisms and rational maps, singularities and blowing up, rings of functions, algebraic curves, Riemann Roch theorem, elliptic curves, Jacobian varieties, sheaves, schemes, divisors, line bundles, cohomology of varieties, classification of surfaces.

625. Algebraic Geometry. (M) Staff. Prerequisite(s): Math 624 or with the permission of the instructor.

Continuation of Math 624.

626. Commutative Algebra. (M) Staff. Prerequisite(s): Math 602/603.

Topics in commutative algebra taken from the literature. Material will vary from year to year depending upon the instructor's interests.

627. Commutative Algebra. (M) Staff. Prerequisite(s): Math 602/603.

Topics in commutative algebra taken from the literature. Material will vary from year to year depending upon the instructor's interests.

628. Homological Algebra. (M) Staff. Prerequisite(s): Math 602/603.

Complexes and exact sequences, homology, categories, derived functors (especially Ext and Tor). Homology and cohomology arising from complexes in algebra and geometry, e.g. simplicial and singular theories, Cech cohomology, de Rham cohomology, group cohomology, Hochschild cohomology. Projective resolutions, cohomological dimension, derived categories, spectral sequences. Other topics may include: Lie algebra cohomology, Galois and etale cohomology, cyclic cohomology, l-adic cohomology. Algebraic deformation theory, quantum groups, Brauer groups, descent theory.

629. Homological Algebra. (M) Staff. Prerequisite(s): Math 628 or with the permission of the instructor.

Continuation of Math 628.

Algebraic and Differential Topology

630. Differential Topology. (M) Staff. Prerequisite(s): Math 600/601.

Fundamentals of smooth manifolds, Sard's theorem, Whitney's embedding theorem, transversality theorem, piecewise linear and topological manifolds, knot theory. The instructor may elect to cover other topics such as Morse Theory, h-cobordism theorem, characteristic classes, cobordism theories.

631. Differential Topology. (M) Staff. Prerequisite(s): Math 630 or with the permission of the instructor.

Continuation of Math 630.

632. Topological Groups. (M) Staff. Prerequisite(s): Math 600/601 and Math 602/603.

Fundamentals of topological groups. Haar measure. Representations of compact groups. Peter-Weyl theorem. Pontrjagin duality and structure theory of locally compact abelian groups.

633. Topological Groups. (M) Staff. Prerequisite(s): Math 632 or with the permission of the instructor.

Continuation of Math 632.

638. Algebraic Topology, Part II. (C) Staff. Prerequisite(s): Math 618/619.

Theory of fibre bundles and classifying spaces, fibrations, spectral sequences, obstruction theory, Postnikov towers, transversality, cobordism, index theorems, embedding and immersion theories, homotopy spheres and possibly an introduction to surgery theory and the general classification of manifolds.

639. Algebraic Topology, Part II. (C) Staff. Prerequisite(s): Math 638 or with the permission of the instructor.

Continuation of Math 638.

Classical Analysis

640. Ordinary Differential Equations. (M) Staff. Prerequisite(s): Math 508/509.

The general existence and uniqueness theorems for systems of ordinary differential equations and the dependence of solutions on initial conditions and parameters appearing in the equation. The proofs of existence and uniqueness are related to numerical algorithms for finding approximate solutions for systems of ODE's. We consider special properties of constant coefficient and linear systems. We then present the theory of linear equations with analytic coefficients, the theories of singular points, indicial roots and asymptotic solutions. We then turn to boundary value problems for second order equations with an emphasis on the eigenfunction expansions associated with self adjoint boundary conditions and the Sturm comparison theory. The remaining time is devoted to topics; for example: Hamiltonian systems and symplectic geometry, singular boundary value problems, perturbation theory, the Lyapounov-Schmidt theory and the Poincare-Bendixson theorem, the equations of mathematical physics, the calculus of variations, symmetries of ODE's and transformation groups.

641. Ordinary Differential Equations. (M) Staff. Prerequisite(s): Math 640 or with the permission of the instructor.

Continuation of Math 640

644. Partial Differential Equations. (M) Staff. Prerequisite(s): Math 600/601, Math 608/609.

Subject matter varies from year to year. Some topics are: the classical theory of the wave and Laplace equations, general hyperbolic and elliptic equations, theory of equations with constant coefficients, pseudo-differential operators, and non-linear problems. Sobolev spaces and the theory of distributions will be developed as needed.

645. Partial Differential Equations. (M) Staff. Prerequisite(s): Math 600/601, Math 608/609.

Subject matter varies from year to year. Some topics are: the classical theory of the wave and Laplace equations, general hyperbolic and elliptic equations, theory of equations with constant coefficients, pseudo-differential operators, and nonlinear problems. Sobolev spaces and the theory of distributions will be developed as needed.

646. Several Complex Variables. (M) Staff. Prerequisite(s): Math 600/601, Math 608/609.

Analytic spaces, Stein spaces, approximation theorems, embedding theorems, coherent analytic sheaves, Theorems A and B of Cartan, applications to the Cousin problems, and the theory of Banach algebras, pseudoconvexity and the Levi problems.

647. Several Complex Variables. (M) Staff. Prerequisite(s): Math 646 or with the permission of the instructor.

Continuation of Math 646.

Functional Analysis

650. Lie Algebras. (M) Staff. Prerequisite(s): Math 602/603.

Connections with Lie groups, universal enveloping algebras, Poincare-Birkhoff-Witt Theorem, Lie and Engels theorems, free Lie algebras, Killing form, semisimple algebras, root systems, Dynkin diagrams, classification of complex simple Lie algebras, representation theory of Lie algebras, cohomology of Lie algebras.

651. Lie Algebras. (M) Staff. Prerequisite(s): Math 650 or with the permission of the instructor.

Continuation of Math 650.

652. Operator Theory. (M) Staff.

Subject matter may include spectral theory of operators in Hilbert space, C*-algebras, von Neumann algebras.

653. Operator Theory. (M) Staff.

Subject matter may include spectral theory of operators in Hilbert space, C*-algebras, von Neumann algebras.

654. Lie Groups. (M) Staff. Prerequisite(s): Math 600/601, Math 602/603.

Connection of Lie groups with Lie algebras, Lie subgroups, exponential map. Algebraic Lie groups, compact and complex Lie groups, solvable and nilpotent groups. Other topics may include relations with symplectic geometry, the orbit method, moment map, symplectic reduction, geometric quantization, Poisson-Lie and quantum groups.

655. Lie Groups. (M) Staff. Prerequisite(s): Math 654 or with the permission of the instructor.

Continuation of Math 654.

656. Representation of Continuous Groups. (M) Staff.

Possible topics: harmonic analysis on locally compact abelian groups; almost periodic functions; direct integral decomposition theory, Types I, II and III: induced representations, representation theory of semisimple groups.

657. (PHYS657) Representation of Continuous Groups. (M) Staff.

Differential Geometry

660. Differential Geometry. (M) Staff. Prerequisite(s): Math 600/601, Math 602/603.

Riemannian metrics and connections, geodesics, completeness, Hopf-Rinow theorem, sectional curvature, Ricci curvature, scalar curvature, Jacobi fields, second fundamental form and Gauss equations, manifolds of constant curvature, first and second variation formulas, Bonnet-Myers theorem, comparison theorems, Morse index theorem, Hadamard theorem, Preissmann theorem, and further topics such as sphere theorems, critical points of distance functions, the soul theorem, Gromov-Hausdorff convergence.

661. Differential Geometry. (M) Staff. Prerequisite(s): Math 660 or with the permission of the instructor.

Continuation of Math 660.

Other Subjects

SM 670. (LGIC320, PHIL412, PHIL416, PHIL516) Topics in Logic. (M) Staff. Prerequisite(s): Math 570/571.

Discusses advanced topics in logic.

SM 671. (MATH571, PHIL412) Topics in Logic. (M) Staff. Prerequisite(s): Math 570/571.

Discusses advanced topics in logic.

676. (CIS 610) Advanced Geometric Methods in Computer Science. (M) Staff. Prerequisite(s): Math 312 or Math 412, or with the permission of the instructor.

Advanced geometric methods used in geometric modeling,computer graphics, computer vision, and robotics.

678. (MATH440, MATH441) Combinatorial Analysis and Graph Theory. (M) Staff.

680. Applied Linear Analysis. (M) Staff. Prerequisite(s): Math 241 and one semester of: Math 360/361 or Math 508/509.

Application of techniques from linear algebra to real problems in economics, engineering, physics, etc. and the difficulties involved in their implementation. Particular emphasis is placed on solving equations, the eigenvalue problem for symmetric matrices and the metric geometry of spaces of matrices. Applications to problems such as options pricing, image reconstruction, airplane and ship design, oil prospecting, etc. (these topics will vary from year to year). Analysis of the numerical algorithms available to solve such problems, rates of convergence, accuracy and stability.

681. Applied Linear Analysis. (M) Staff. Prerequisite(s): Math 680 or with the permission of the instructor.

Continuation of Math 680.

690. Topics in Mathematical Foundations of Program Semantics. (M) Staff.

This course will discuss Mathematical Foundations of Computer Security in the Fall and will be followed in Spring by Math 691, Advanced Topics in Mathematical Foundations of Computer Security. In Fall we will study basic topics in cryptography and network security protocols.

"What is to distinguish a digital dollar when it is as easily reproducible as the spoken word? How do we converse privately when every syllable is bounced off a satellite and smeared over an entire continent? How should a bank know that it really is Bill Gates requesting from his laptop in Fiji a transfer of $100,000,.....,000 to another bank? Fortunately, the mathematics of cryptography can help. Cryptography provides techniques for keeping information secret, for determining that information has not been tampered with, and for determing who authored pieces of information." (From the Foreword by R. Rivest to the "Handbook of Applied Cryptography" by Menezes, van Oorschot, and Vanstone.)

Textbook: Douglas R. Stinson. "Cryptography: Theory and Practice". Publisher: Chapman & Hall/CRC; 3 edition (November 1, 2005) ISBN: 1584885084.

691. Topics in Mathematical Foundations of Program Semantics. (M) Staff.

The course discusses advanced topics in mathematical foundations of semantics of programming languages and programming structures.

692. Numerical Analysis. (M) Staff. Prerequisite(s): Math 320/321.

A study of numerical methods for matrix problems, ordinary and partial differential equations, quadrature and the solution of algebraic or transcendental equations. Emphasis will be on the analysis of those methods which are particularly suited to automatic high-speed computation.

693. Numerical Analysis. (M) Staff. Prerequisite(s): Math 692 or with the permission of the instructor.

Continuation of Math 692.

694. (PHYS654) Mathematical Foundations of Theoretical Physics. (M) Staff.

Selected topics in mathematical physics, such as mathematical methods of classical mechanics, electrodynamics, relativity, quantum mechanics and quantum field theory.

L/R 695. (PHYS655) Mathematical Foundations of Theoretical Physics. (M) Staff.

Selected topics in mathematical physics, such as mathematical methods of classical mechanics, electrodynamics, relativity, quantum mechanics and quantum field theory.

696. (PHYS656) Topics in Mathematical Physics and String Theory. (M) Staff. Prerequisite(s): Math 694 or permission of the instructor.

This interdisciplinary course discusses advanced topics in mathematical physics. Topics may include elliptic operators, heat kernels, complexes and the Atiyah-Singer index theorem, Feynman graphs and anomalies, computing Abelian and non-Abelian anomalies, and the relation of anomalies to the index theorem.

697. (PHYS657) Topics in Mathematical Physics and String Theory. (M) Staff. Prerequisite(s): Math 696 or permission of the instructor.

Continuation of Math 696. Topics may include the family index theorem, equivariant cohomology and loop spaces, the homological algebra of BRST invariance and the Wess-Zumino consistency condition, the descent equations, and worldsheet anomalies in string theory.

Advanced Topics Courses

702. Topics in Algebra. (M) Staff.