Penn Pizza Seminar

The graduate pizza seminar in the math department at the University of Pennsylvania.

Upcoming Talks

Mattie Ji · · DRL A6


Ellis Buckminster · · DRL A6


Nikita Borisov · · DRL A6


Vicente Bosca · · DRL A6


Marc Muhleisen · · DRL A6


TBA · · DRL A6

Past Talks

The Mathematics of Gerrymandering

Jacob Monzel · · DRL A6

We’ll look at how math can be used to detect and even prevent unfair districting in elections. I’ll introduce the basic ideas behind measuring “compactness” of districts, how randomness and geometry come into play, and what makes drawing fair maps such a surprisingly difficult mathematical problem.


Building Your Achievement Set

James Opre · · DRL A6

We will be discussing Achievement Sets which are the set containing every subsum of a given series. We will see my method for building achievement sets and explore a handful of examples to see what different types of sets can be built.


The extension theorem and aperiodic tilings of the plane

Luis Modes Castillo · · DRL A6

In this talk, we will prove the following intuitive result: If we can tile arbitrarily large disks of the plane with finitely many bounded tiles, then we can tile the whole plane. We will explore what happens if we remove some hypotheses, and we will discuss its relation with aperiodic tilings of the plane (where the number of tiles needed can range from 20426 to 1).


Can you put this graph on a torus? Maybe!

Maxine Calle · · DRL A6

In this talk, we will explore how to embed graphs in surfaces, focusing on the connection between graph topology and surface genus. My favorite invariant from algebraic topology will appear (spoiler: it's the Euler characteristic) and we will draw some fun pictures.


Funny Consequences of the Axiom of Choice

Carmine Ingram · · DRL A6

Many of us are familiar with the Banach-Tarski paradox, but do you know of nonlinear solutions to the equation f(x+y)=f(x)+f(y), or of tricks where it seems as though we can infer an uncountably infinite amount of things from only a countably infinite amount of information? We will discuss some silly tricks you can do with the axiom of choice, and, time permitting, some of its alternatives, and the silly things you can do with them.


The sequence 1, 11, 21, 1211, ... (its name is a spoiler!)

Riley Shahar · · DRL A6

This talk is about a very playful sequence, originally studied by John Conway, whose first terms are displayed in the title. We'll define the sequence, prove some of its basic properties, and then discuss Conway's "cosmological theorem," which determines the limiting behavior of the sequence. A surprising role is played by a particular endomorphism of the free monoid on 92 generators.