Hover over a course to highlight the prerequisites. Dashed lines indicate recommended prerequisites while solid lines indicate official prerequisites. Designed and implemented by Andrew DeLapo.

Undergraduate Course Map

Black arrows indicate the lower-division courses, and other colors are for upper-division courses. These include official prerequisites as well as recommended ones. Made by Sylvia Jin.

Graduate Course Map

Generously provided by u/Devilnaht on RedditDisclaimer: these only include official prerequisites. Different professors may vary the content semester to semester and thus have different requirements.

Featured Problems

At MUSA, we love to talk about tricky math problems of all levels! Here's some of our favorite problems. If you can't figure them out yourself, try asking at office hours and see if anyone else can make heads or tails of them.

Topological invariants and the open mapping theorem

Prerequisite: Math 185; Math 142 or Math 202A will helpSay that a metric space \(X\) is locally connected if for each point \(x\) of \(X\) there is a connected open set \(U\) containing \(x\). Let \(K\) be a locally connected compact subset of the complex plane \(\mathbb{C}\) and \(V(K)\) denote the vector space of all holomorphic functions \(V(K)\to\mathbb{C}\). Give a formula for the dimension of \(V(K)\) in terms of topological invariants of \(K\).If that was pretty easy, what happens if \(K\) is not locally connected? In particular, what is the dimension of \(V(K)\), for \(K\) the Cantor set?

Fractal topology

Prereqs: Math 104If \(X\) is a metric space, say that \(X\) has a fractal topology if, for each nonempty open set \(U\) in \(X\), there is a homeomorphism from \(U\) to \(X\). What's an example of \(X\)?

Cuboids on the sphere

Prereqs: NoneLet \(S^2\) denote the 2-sphere. Describe the space of cuboids (that is, rectangular prisms) whose vertices are all points on \(S^2\).

Prison break!

Prereqs: NoneThere are \(N\) prisoners in a circular prison; each isolated in their own soundproof prison cell. Each prisoner is given a button and a switch; the button controls the lightbulb in the prisoner one cell clockwise from the button-holder. When a prisoner presses their button, the corresponding lightbulb will flash on and then off at the coming noontime, whenever that is. The goal of the prisoners is to find N; the total number of prisoners. To make things challenging; the prison warden shuffles all the prisoners every night.Can this be done; given that you are allowed to give an algorithm \(A\) for all the other prisoners to follow; and you yourself can follow an algorithm \(B\)?

Towers of boxes

Prereqs: NoneHow many different ways can a person stack n cubical boxes if (a) the person must stack all the boxes in the same two dimensional plane, (b) on the bottom layer of boxes, the boxes must be placed side by side with no gaps in between, and (c) on all higher levels, the boxes must be stacked directly on top of an existing box?

Homeomorphism classes in \(\mathbb{R}^n\)

Prereqs: Math 104We say that two subsets, \(X\) and \(Y\), of \(\mathbb{R}^n\) are homeomorphic if there is a continuous bijection from \(X\) to \(Y\) whose inverse is also continuous.Show that there exist two subsets of \(\mathbb{R}^n\) which are not homeomorphic, but do have continuous bijections between them.