I have spent a lot of time applying to grad schools, here are some useful things that I found during my search.
I have recently started learning French. Here is a list of some of the materials that I have been working from.
A path coloring of a graph partitions its vertex set into color classes such that each class induces a disjoint union of paths. In this project we implement several algorithms to compute path colorings of graphs embedded in the plane.
The domain name “permutation lock” is something that I came up with back in high school when I learned that the locking mechanism on a “combination lock” does not fit with the combinatorial notion of a combination.