2019-2020 2020-2021 2021-2022 2022-2023 2023-2024
Browse
by subject...
    Schedule
view...
 

151 - 160 of 165 results for: MATH

MATH 287: Introduction to optimal transportation

This will be an introductory course on Optimal Transportation theory. We will study Monge's problem, Kantorovich's problem, c-concave functions (also in the Riemannian setting), Wasserstein distance and geodesics (including a PDE formulation), applications to inequalities in convex analysis, as well as other topics, time permitting.

MATH 290B: Model Theory B (PHIL 350B)

Decidable theories. Model-theoretic background. Dense linear orders, arithmetic of addition, real closed and algebraically closed fields, o-minimal theories.
| Repeatable for credit

MATH 292A: Set Theory (PHIL 352A)

The basics of axiomatic set theory; the systems of Zermelo-Fraenkel and Bernays-Gödel. Topics: cardinal and ordinal numbers, the cumulative hierarchy and the role of the axiom of choice. Models of set theory, including the constructible sets and models constructed by the method of forcing. Consistency and independence results for the axiom of choice, the continuum hypothesis, and other unsettled mathematical and set-theoretical problems. Prerequisites: PHIL151 and MATH 161, or equivalents.

MATH 293A: Proof Theory (PHIL 353A)

Gentzen's natural deduction and sequential calculi for first-order propositional and predicate logics. Normalization and cut-elimination procedures. Relationships with computational lambda calculi and automated deduction. Prerequisites: 151, 152, and 161, or equivalents.

MATH 295: Computation and Algorithms in Mathematics

Use of computer and algorithmic techniques in various areas of mathematics. Computational experiments. Topics may include polynomial manipulation, Groebner bases, computational geometry, and randomness. May be repeated for credit.
| Repeatable for credit

MATH 310: Top Ten Algorithms of the 20th Century (CME 329)

A high-level survey course covering one algorithm per week: metropolis, simplex method, conjugate gradient, QR, quicksort, fast fourier transform, maxcut, fast multipole method, integer relation detection, and convex/semi-definite programming.

MATH 361: Research Seminar Participation

Participation in a faculty-led seminar which has no specific course number.
| Repeatable for credit

MATH 381: Seminar in Analysis

| Repeatable 3 times

MATH 384: Seminar in Geometry

| Repeatable 3 times (up to 9 units total)

MATH 385: Seminar in Topology

| Repeatable 3 times (up to 9 units total)
Filter Results:
term offered
updating results...
teaching presence
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints