printer friendly pageMATH 147: Differential Topology
Smooth manifolds, transversality, Sards' theorem, embeddings, degree of a map, Borsuk-Ulam theorem, Hopf degree theorem, Jordan curve theorem. Prerequisite: 115 or 171.
Terms: Spr
| Units: 3
| UG Reqs: GER:DB-Math
Instructors:
Wieczorek, W. (PI)
;
Ungemach, W. (TA)
MATH 148: Algebraic Topology
Fundamental group, covering spaces, Euler characteristic, homology, classification of surfaces, knots. Prerequisite: 109 or 120.
Last offered: Winter 2017
| UG Reqs: GER:DB-Math
MATH 151: Introduction to Probability Theory
Counting; axioms of probability; conditioning and independence; expectation and variance; discrete and continuous random variables and distributions; joint distributions and dependence; central limit theorem and laws of large numbers. Prerequisite: 52 or consent of instructor.
Last offered: Winter 2015
| UG Reqs: GER:DB-Math
MATH 152: Elementary Theory of Numbers
Euclid's algorithm, fundamental theorems on divisibility; prime numbers; congruence of numbers; theorems of Fermat, Euler, Wilson; congruences of first and higher degrees; quadratic residues; introduction to the theory of binary quadratic forms; quadratic reciprocity; partitions.
Terms: Win
| Units: 3
| UG Reqs: GER:DB-Math
Instructors:
Tsai, C. (PI)
MATH 154: Algebraic Number Theory
Properties of number fields and Dedekind domains, quadratic and cyclotomic fields, applications to some classical Diophantine equations. Prerequisites: 120 and 121, especially modules over principal ideal domains and Galois theory of finite fields.
Last offered: Spring 2017
| UG Reqs: GER:DB-Math
MATH 155: Analytic Number Theory
Topics in analytic number theory such as the distribution of prime numbers, the prime number theorem, twin primes and Goldbach's conjecture, the theory of quadratic forms, Dirichlet's class number formula, Dirichlet's theorem on primes in arithmetic progressions, and the fifteen theorem. Prerequisite: 152, or familiarity with the Euclidean algorithm, congruences, residue classes and reduced residue classes, primitive roots, and quadratic reciprocity.
Terms: Spr
| Units: 3
| UG Reqs: GER:DB-Math
Instructors:
Thorner, J. (PI)
;
Zavyalov, B. (TA)
MATH 158: Basic Probability and Stochastic Processes with Engineering Applications (CME 298)
Calculus of random variables and their distributions with applications. Review of limit theorems of probability and their application to statistical estimation and basic Monte Carlo methods. Introduction to Markov chains, random walks, Brownian motion and basic stochastic differential equations with emphasis on applications from economics, physics and engineering, such as filtering and control. Prerequisites: exposure to basic probability.
Terms: Spr
| Units: 3
Instructors:
Ying, L. (PI)
MATH 159: Discrete Probabilistic Methods
Modern discrete probabilistic methods suitable for analyzing discrete structures of the type arising in number theory, graph theory, combinatorics, computer science, information theory and molecular sequence analysis. Prerequisite:
STATS 116/
MATH 151 or equivalent.
Last offered: Autumn 2016
MATH 161: Set Theory
Informal and axiomatic set theory: sets, relations, functions, and set-theoretical operations. The Zermelo-Fraenkel axiom system and the special role of the axiom of choice and its various equivalents. Well-orderings and ordinal numbers; transfinite induction and transfinite recursion. Equinumerosity and cardinal numbers; Cantor's Alephs and cardinal arithmetic. Open problems in set theory. Prerequisite: students should be comfortable doing proofs.
Last offered: Winter 2017
| UG Reqs: GER:DB-Math
MATH 162: Philosophy of Mathematics (PHIL 162)
Mathematics is a very peculiar human activity. It delivers a type of knowledge that is particularly stable, often conceived as a priori and necessary. Moreover, this knowledge is about abstract entities, which seem to have no connection to us, spatio-temporal creatures, and yet it plays a crucial role in our scientific endeavors. Many philosophical questions emerge naturally: What is the nature of mathematical objects? How can we learn anything about them? Where does the stability of mathematics comes from? What is the significance of results showing the limits of such knowledge, such as Gödel's incompleteness theorem? The first part of the course will survey traditional approaches to philosophy of mathematics ("the big Isms") and consider the viability of their answers to some of the previous questions: logicism, intuitionism, Hilbert's program, empiricism, fictionalism, and structuralism. The second part will focus on philosophical issues emerging from the actual practice of mathematics. We will tackle questions such as: Why do mathematicians re-prove the same theorems? What is the role of visualization in mathematics? How can mathematical knowledge be effective in natural science? To conclude, we will explore the aesthetic dimension of mathematics, focusing on mathematical beauty. Prerequisite: PHIL150 or consent of instructor.
Terms: Win
| Units: 4
| UG Reqs: GER:DB-Math
Instructors:
De Toffoli, S. (PI)
;
Thompson, D. (TA)
Filter Results: