Matroids provide a generalization of the notion of independence from linear algebra. In graph theory, matroids generalize the notion of acyclicity in undirected graphs. Oriented matroids contain more information than matroids. They generalize the notions of independence and orientation from linear algebra and acyclicity in directed graphs from graph theory. In this talk, we will discuss the basics of matroids and oriented matroids, and then describe an application of oriented matroids to the tiling of zonotopes. This talk will have no prerequisites other than linear algebra, and interested first-years are encouraged to attend. Speaker(s): Alexander Leaf (University of Michigan)