Courses

MATH 495

CS - MATH
Undergraduate Programs
Credit:1.5

MATH 505

Calculus of variations; Partial differential equations: First order linear equations and the method of characteristics; Solution of Laplace, wave, and diffusion equations; Special functions; Integral equations.

CS - MATH
Undergraduate Programs
Credit:3

MATH 510

Existence and uniqueness theorems; continuation of solutions; continuous dependence and stability, Lyapunovs direct method; differential inequalities and their applications; boundary-value problems and Sturm-Liouville theory.

CS - MATH
Undergraduate Programs
Credit:4

MATH 514

Basic notions of commutative algebra and homological algebra: category of modules over a ring, flatness, Ext and Tor. General properties of schemes: affine schemes. projective schemes, dimension, projective and proper morphisms. Normal and regular schemes. Flat and smooth morphisms. Zariski's main theorem and applications. Coherent sheaves and Cech Cohomology.

CS - MATH
Undergraduate Programs
Credit:3
Pre-requisite: MATH. 206 or consent of the instructor

MATH 525

Valuations of a field, local fields, ramification index and degree, places of global fields, theory of divisors, ideal theory, adeles and ideles, Minkowski's theory, extensions of global fields, the Artin symbol.

CS - MATH
Undergraduate Programs
Credit:4

MATH 504

A graduate level introduction to matrix-based computing. Stable and efficient algorithms for linear equations, least squares and eigenvalue problems. Both direct and iterative methods are considered and MATLAB is used as a computing environment.

CS - MATH
Undergraduate Programs
Credit:3

MATH 509

Convergence of sequences in Rn, multivariate Taylor's theorem. Optimality conditions for unconstrained optimization. Newton's and quasi-Newton methods for unconstrained optimization. Equality-constrained optimization, Karush-Kuhn-Tucker theorem for constrained optimization. Inequality-constrained optimization. Interior point methods for constrained optimization. Linear and quadratic programs, their numerical solution.

CS - MATH
Undergraduate Programs
Credit:3

MATH 512

Review of functional spaces and embedding theorems; existence and regularity of solutions of boundary-value problems for second-order elliptic equations; maximum principles for elliptic and parabolic equations; comparison theorems; existence, uniqueness and regularity theorems for solutions of initial boundary-value problems for second-order parabolic and hyperbolic equations.

CS - MATH
Undergraduate Programs
Credit:4
Pre-requisite: MATH. 511 or consent of the instructor

MATH 522

Galois theory, solvability of equations by radicals, separable extensions, normal basis theorem, norm and trace, cyclic and cyclotomic extensions, Kummer extensions. Modules, direct sums, free modules, sums and products, exact sequences, morphisms, Hom and tensor functors, duality, projective, injective and flat modules, simplicity and semisimplicity, density theorem, Wedderburn-Artin theorem, finitely generated modules over a principal ideal domain, basis theorem for finite abelian groups.

CS - MATH
Undergraduate Programs
Credit:4

MATH 528

Primes in arithmetic progressions, Gauss' sum, primitive characters, class number formula, distribution of primes, properties of the Riemann zeta function and Dirichlet L-functions, the prime number theorem, Polya- Vinogradov inequality, the large sieve, average results on the distribution of primes.

CS - MATH
Undergraduate Programs
Credit:4
Pre-requisite: MATH. 533 or consent of the instructor

MATH 503

Linear algebra: Vector and inner product spaces, linear operators, eigenvalue problems; Vector calculus: Review of differential and integral calculus, divergence and Stokes' theorems. Ordinary differential equations: Linear equations, Sturm-Liouville theory and orthogonal functions, system of linear equations; Methods of mathematics for science and engineering students.

CS - MATH
Undergraduate Programs
Credit:3

MATH 506

Development and analysis of numerical methods for ODEs, an introduction to numerical optimization methods, and an introduction to random numbers and Monte Carlo simulations. The course starts with a short survey of numerical methods for ODEs. The related topics include stability, consistency, convergence and the issue of stiffness. Then it moves to computational techniques for optimization problems arising in science and engineering. Finally, it discusses random numbers and Monte Carlo simulations. The course combines the theory and applications (such as programming in MATLAB) with the emphasis on algorithms and their mathematical analysis.

CS - MATH
Undergraduate Programs
Credit:3

MATH 511

First order equations, method of characteristics; the Cauchy-Kovalevskaya theorem; Laplace's equation: potential theory and Greens?s function, properties of harmonic functions, the Dirichlet problem on a ball; heat equation: the Cauchy problem, initial boundary-value problem, the maximum principle; wave equation: the Cauchy problem, the domain of dependence, initial boundary-value problem.

CS - MATH
Undergraduate Programs
Credit:4

MATH 521

Free groups, group actions, group with operators, Sylow theorems, Jordan-Hölder theorem, nilpotent and solvable groups. Polynomial and power series rings, Gauss?s lemma, PID and UFD, localization and local rings, chain conditions, Jacobson radical.

CS - MATH
Undergraduate Programs
Credit:4

MATH 527

Method of descent, unique factorization, basic algebraic number theory, diophantine equations, elliptic equations, p-adic numbers, Riemann zeta function, elliptic curves, modular forms, zeta and L-functions, ABC-conjecture, heights, class numbers for quadratic fields, a sketch of Wiles? proof.

CS - MATH
Undergraduate Programs
Credit:4