PMATH Prof Talk 1

February 26, 2026

5:00 PM–6:00 PM
DWE 3518

Our PMATH Prof Talk with Professor Ben Webster is coming up soon! The talk is on Representation Theory and Quantum Field Theory.

Abstract: Representation theory asks how algebraic objects can act as symmetries, while quantum field theory is a framework for describing particles and forces. Despite their different origins, these subjects turn out to be closely linked. I’ll give a gentle introduction to both sides and explain, through simple examples, how ideas from physics naturally produce structures familiar to representation theorists.

Food will be provided to members.
Bring your friends and learn some math! Hope to see you there!

SASMS 1

February 11, 2026

6:00 PM–8:30 PM
MC 2017

SASMS 1 is here! For those who don't know, SASMS is our student talk series, where students desperately try to keep an audience's attention for 25 minutes.

There will be free food and drinks for members.

Schedule:

6:00-6:25: Penguins and Dinosaurs in Math
Adam Chen
I will give an overview of mathematical concepts/algorithms that are named after penguins and dinosaurs. Keep in mind that I know nothing about the fields these concepts are found in, so bear with me. If there is any remaining time we will create a tierlist of math courses at UW.

6:30-6:55: Elliptic Curves and Fermat's Last Theorem
Isabela Souza, Ellie Hamer
In this talk, we define elliptic curves and the elliptic curve group, consisting of the rational points on the curve and the geometric interpretation of the group law. We then discuss Fermat’s Last Theorem and the centuries-long journey to prove it, culminating in the use of elliptic curves and modularity. We discuss what makes an elliptic curve modular, and detail how this is used to prove FLT.

7:30-7:55: The Hat Guessing Number of Graphs
Mehrdad
The hat guessing number of a graph comes from a famous hat guessing game (this is how you get a grant for your research by adding the word famous). There are
Some prisoners and some possible hat colours. They make a deal with the boss: if at least one prisoner correctly guesses their own hat colour, then everyone is freed. If nobody guesses correctly … well, something very bad happens, which we prefer not to discuss.
Before the game starts, the prisoners are allowed to come up with a strategy. During the game, each prisoner cannot see their own hat (otherwise where’s the fun?), but can see the hat colours of some other prisoners (that's where graphs come from).
The goal is to come up with a strategy that always wins, no matter how the hat colours are assigned. If there is even one possible assignment where everyone could guess wrong, the prisoners will reject the deal entirely (remember, something BAD would happen to them if non of them guesses correctly).

8:00-8:25: Do Analysts Dream of Convex Sheep
Alex Lavallee
A survey of classical convexity: Basic definitions, hyperplanes and separation theorems, Duality between compact convex sets and convex cones of continuous functions. Extreme points and Minkowskis theorem, sequential compactness of space of convex bodies. Volumes and mixed volumes, including the polynomiality of sums of bodies, and symmetrization techniques. Inequalities and further applications, time permitting

MATH 146 Midterm Review

February 7, 2026

3:00 PM–6:00 PM
MC 4020

Hi everyone! Come study with us for the upcoming MATH 146 midterm!
Bring your classmates! Hope to see you there!

C&O Prof Talk

February 5, 2026

4:00 PM–5:00 PM
DC 1304

Hello everyone! Our C&O Prof Talk with Professor Penny Haxell is coming up soon! The talk is on Graph Theory for the Cruise Director. Interesting title!

Abstract: The cruise director on a luxury cruise ship is responsible for arranging all the social events on board. How can the passengers be organised into harmonious groups for dinner seating or excursions? How can we find a good way to assign partners for an evening of tango lessons? We can formulate these questions as certain graph colouring and matching problems, that have particularly beautiful solutions. We'll even solve one of them together on the spot, using a human computer made up of audience members.

Food will be provided to members.
Bring your friends and learn some math! Hope to see you there!

Date: February 5
Time: 4:00 - 5:00 PM
Location: DC 1304

Disorg

January 8, 2026

6:00 PM–7:00 PM
MC 5501

Wow! A new term already. And with a new term comes new executive team members! Come to our PMC Disorganizational Meeting where we elect new executives for the Winter 2026 term. Vote, run, bother friends to run, and eat snacks. Hope to see you there!