## September 2019

### Adinkras: Snapshots of Supersymmetry (Jordan Kostiuk, Brown University)

An “Adinkra” is a graphical tool to describe a branch of particle physics known as supersymmetry. Understanding the mathematics of Adinkras shines a light on the underlying physics, as well as helps to explore new areas of mathematics. After describing the basic structure of Adinkras, I will discuss some of these interesting interactions between mathematics and physics.This talk is intended for a general mathematics audience; undergraduate students are welcome.

Find out more »## October 2019

### Matroids: a unified theory of independence (Mauricio Gomez Lopez, University of Oregon)

In this talk, I will give an overview of the theory of matroids. These are mathematical objects which capture the combinatorial essence of linear independence. Besides providing some basic definitions of this theory, I will discuss several examples of matroids and explain some connections with optimization. Also, in this talk, I will introduce matroid polytopes, which provide a geometric framework for studying matroids. If time permits, I will discuss some new proofs to known results that I developed with one…

Find out more »### Faster point counting for curves over prime power rings (Maurice Rojas, Texas A&M)

Counting points on algebraic curves over finite fields has numerous applications in communications and cryptology, and has led to some of the most beautiful results in 20th century arithmetic geometry. A natural generalization is to count the number of points over prime power rings, e.g., the integers modulo a prime power. However, the theory behind the latter kind of point counting began more recently and there are numerous gaps in our algorithmic knowledge. We give a simple combinatorial construction that reduces point counting over prime power point…

Find out more »