MATH 249B: Topics in Number Theory
Terms: Win
| Units: 3
| Repeatable
3 times
(up to 9 units total)
Instructors:
Conrad, B. (PI)
MATH 249C: Topics in Number Theory
Terms: Spr
| Units: 3
| Repeatable
for credit
Instructors:
Venkatesh, A. (PI)
MATH 256A: Partial Differential Equations
The theory of linear and nonlinear partial differential equations, beginning with linear theory involving use of Fourier transform and Sobolev spaces. Topics: Schauder and L2 estimates for elliptic and parabolic equations; De Giorgi-Nash-Moser theory for elliptic equations; nonlinear equations such as the minimal surface equation, geometric flow problems, and nonlinear hyperbolic equations.
Last offered: Spring 2014
MATH 256B: Partial Differential Equations
Continuation of 256A.
Terms: Aut
| Units: 3
| Repeatable
for credit
Instructors:
Luk, J. (PI)
MATH 257A: Symplectic Geometry and Topology
Linear symplectic geometry and linear Hamiltonian systems. Symplectic manifolds and their Lagrangian submanifolds, local properties. Symplectic geometry and mechanics. Contact geometry and contact manifolds. Relations between symplectic and contact manifolds. Hamiltonian systems with symmetries. Momentum map and its properties. May be repeated for credit.
Terms: Aut
| Units: 3
| Repeatable
2 times
(up to 6 units total)
Instructors:
Starkston, L. (PI)
MATH 257B: Symplectic Geometry and Topology
Continuation of 257A. May be repeated for credit.
Last offered: Spring 2016
| Repeatable
2 times
(up to 6 units total)
MATH 257C: Symplectic Geometry and Topology
Continuation of 257B. May be repeated for credit.
Last offered: Spring 2015
MATH 258: Topics in Geometric Analysis
May be repeated for credit.
Terms: Win
| Units: 3
| Repeatable
for credit
Instructors:
Hershkovits, O. (PI)
MATH 262: Applied Fourier Analysis and Elements of Modern Signal Processing (CME 372)
Introduction to the mathematics of the Fourier transform and how it arises in a number of imaging problems. Mathematical topics include the Fourier transform, the Plancherel theorem, Fourier series, the Shannon sampling theorem, the discrete Fourier transform, and the spectral representation of stationary stochastic processes. Computational topics include fast Fourier transforms (FFT) and nonuniform FFTs. Applications include Fourier imaging (the theory of diffraction, computed tomography, and magnetic resonance imaging) and the theory of compressive sensing.
Last offered: Winter 2016
MATH 263A: Algebraic Combinatorics and Symmetric Functions
Symmetric function theory unifies large parts of combinatorics. Theorems about permutations, partitions, and graphs now follow in a unified way. Topics: The usual bases (monomial, elementary, complete, and power sums). Schur functions. Representation theory of the symmetric group. Littlewood-Richardson rule, quasi-symmetric functions, combinatorial Hopf algebras, introduction to Macdonald polynomials. Throughout, emphasis is placed on applications (e.g. to card shuffling and random matrix theory). Prerequisite: 210A and 210B, or equivalent.
Terms: Aut
| Units: 3
| Repeatable
for credit
Instructors:
Diaconis, P. (PI)
Filter Results: