The Kakeya problem is about sets of points in Euclidean space that contain unit line segments in every direction. I'll talk about an easier analogue of this problem over finite fields, which Dvir essentially solved by generating the following fact about polynomials: if f is a non-zero polynomial of degree d whose coefficients lie in a field F, then the number of elements a in F such that F(a)=0 is at most d.

The Langlands program orginally referred to a collection of conjectures proposed by Robert Langlands over 50 years ago to connect a wide range of mathematical concepts and structures, which has been highly influentical ever since. The talk will describe some of the mathematical problems that can be solved with the help of the Langlands program, or that fit under its umbrella. Most of these problems arise in number theory, but the applications, as well as the methods involve geometry, representaion theory, and harmonic analysis; there will even be a glimpse of quantum physics. The talk will also give a scope of how the Langlands program is constantly expanding.

Cassidy Kao: Cops and Robbers
Abstract: The game of Cops and Robbers is a vertex-to-vertex pursuit game played on a reflexive graph. The goal is for the cop(s) to occupy the same vertex as the robber—if k cops have a strategy that always wins on a particular graph, we call this a k-cop win graph, and if k is the least number of cops needed, the graph has cop number k. The game has been well studied for undirected graphs. We investigate oriented graphs where each edge (or arc) can have one of the two possible orientations. Unlike non-directed graphs, there is no known intrinsic characterization of 1-cop win oriented graphs. In this presentation, we define a relational characterization of the class of cop-win oriented graphs in a manner analogous to the characterization provided by Nowakowski and Winkler (1983).
Kate Mekechuk: Whitten and Morse theory
Abstract: Morse theory explores the topology of manifolds by studying their critical points. Moreover, one can derive inequalities between the manifold's critical points and its Betti numbers and Euler characteristic. In 1982, Edward Witten discovered how to connect Hodge theory to Morse theory through a supersymmetric analysis of differential forms. This allowed him to construct a new proof of Morse cohomology, a breakthrough in mathematical physics at the time. In this talk, I will present his argument as well as explore the relevant physics analysis that allowed Witten to have his mathematical insights.
Lisa Faulkner Valiente: Extended Cup Homology of S^1 x \Sigma_g Abstract: The Heegaard Floer homology is an important 3-manifold invariant, computed over the rationals by Ozsvath and Szabo and over F2 by Lidman. The work of Jabuka and Mark shows that over integers, the answer should be in terms of "cup homology", the homology of an exterior algebra of k-forms where the differential is given by wedging with a certain 3-form w3. Lin and Miller Eismeier compute the result to be "extended cup homology", whose differential is given instead by wedging with an odd form w3+w5+... They conjectured that the result should be isomorphic to cup homology, for any 3-form w3. We confirm this conjecture for the circle cross a g-holed torus, completing Jabuka and Mark's calculations. The proof is combinatorial, and uses a decomposition of the exterior algebra into subspaces determined by certain `"pair-free subsets."
Milena Harned, Pranav Konda, Felix Liu, Nikhil Mudumbi, Eric Shao, Tony Xiao: Error-correcting codes for quantum computing.
Abstract: Error-correcting codes for quantum computing are crucial to address the fundamental problem of communication in the presence of noise and imperfections. Audoux used Khovanov homology to define families of quantum codes with desirable properties. In this project, we explored Khovanov homology and some of its many extensions, namely annular and sl(3) homology, in order to generate new families of quantum codes and to establish several properties of codes that arise in this way.

TBA

TBA

TBA

TBA

TBA

TBA