Global Arc

1
Search International Offerings

You can now simultaneously browse international opportunities and on-campus courses; the goal is to plan coursework — before and/or after your trip — that will deepen your experiences abroad.

2
Add Your Favorites

Log in and add international activities and relevant courses to your Global Arc.

3
Get Advice

Download your Arc and share with your academic adviser, who can help you refine your choices.

4
Enroll, Apply and Commit

Register for on-campus classes through TigerHub, and apply for international experiences using Princeton’s Global Programs System.

5
Revisit and Continue Building

Return to the Global Arc throughout your Princeton career as you delve deeper into your interests. 

Refine search results

Subject

Displaying 11 - 20 of 55
Close icon
Linear Algebra with Applications
Companion course to MAT201. Matrices, linear transformations, linear independence and dimension, bases and coordinates, determinants, orthogonal projection, least squares, eigenvectors and their applications to quadratic forms and dynamical systems. Prerequisite: MAT103 or equivalent.
Close icon
Advanced Vector Calculus
Vector spaces, limits, derivatives of vector-valued functions, Taylor's formula, Lagrange multipliers, double and triple integrals, change of coordinates, surface and line integrals, generalizations of the fundamental theorem of calculus to higher dimensions. More abstract than 201 but more concrete than 216/218. Recommended for prospective physics majors and others with a strong interest in applied mathematics. Prerequisite: MAT104 or equivalent.
Close icon
Algebra II
Continuation of MAT345. Further develop knowledge of algebraic structures by exploring examples that connect to higher mathematics.
Close icon
Introduction to Differential Geometry
Introduction to geometry of surfaces. Surfaces in Euclidean space, second fundamental form, minimal surfaces, geodesics, Gauss curvature, Gauss-Gonnet formula, uniformization of surfaces, elementary notions of contact geometry. Prerequisite: MAT218 or MAT300, or MAT203 or equivalent.
Close icon
Topology
Introduction to point-set topology, the fundamental group, covering spaces, methods of calculation and applications. Prerequisite: MAT202 or 204 or 218 or equivalent.
Close icon
Introduction to Graph Theory
The fundamental theorems and algorithms of graph theory. Topics include: connectivity, matchings, graph coloring, planarity, the four-color theorem, extremal problems, network flows, and related algorithms. Prerequisite: MAT202 or 204 or 217 or equivalent.
Close icon
Combinatorial Mathematics
Combinatorics is the study of enumeration and structure of discrete objects. These structures are widespread throughout mathematics, including geometry, topology and algebra, as well as computer science, physics and optimization. This course will give an introduction to modern techniques in the field, and how they relate to objects such as polytopes, permutations and hyperplane arrangements.
Close icon
Theory of Games
Games in extensive form, pure and behavioral strategies; normal form, mixed strategies, equilibrium points; coalitions, characteristic-function form, imputations, solution concepts; related topics and applications. Prerequisite: MAT202 or 204 or 217 or equivalent. MAT215 or equivalent is recommended.
Close icon
Probability Theory
Sequence of independent trials, applications to number theory and analysis, Monte Carlo method. Markov chains, ergodic theorem for Markov chains. Entropy and McMillan theorem. Random walks, recurrence and non-recurrence; connection with the linear difference equations. Strong laws of large numbers, random series and products. Weak convergence of probability measures, weak Helly theorems, Fourier transforms of distributions. Limit theorems of probability theory. Prerequisite: MAT203 or 218 or equivalent.
Close icon
Mathematical Programming
Linear programs, duality, Dantzig's simplex method; theory of dual linear systems; matrix games, von Neumann's minimax theorem, simplex solution; algorithms for assignment, transport, flow; brief introduction to nonlinear programming.