MATH Club : Past Events
Past Seminars
The following seminars have already happened, you may instead view upcoming seminars in this series.
Oct. 9, 2017
Jānis Lazovskis :
4 p.m. in seo 300
Oct. 16, 2017
Samuel Cole :
4 p.m. in see 300
Abstract
tea
Oct. 23, 2017
Jerry Bona :
4 p.m. in SEO 636
Oct. 30, 2017
Alex Furman :
4 p.m. in seo 300
Nov. 6, 2017
Steven Jordan :
4 p.m. in seo 300
Nov. 13, 2017
Ben Fish :
4 p.m. in SEO 300
Abstract
While most intro talks to the computational complexity of algorithms start by introducing NP-hardness, I'll take a more optimistic approach by talking about the power of provably-correct approximation algorithms, using metric TSP as an example to show the power of approximate solutions over exact solutions, and to explain what all these words mean.
Nov. 27, 2017
Yunus Syed :
4 p.m. in SEO300
Feb. 7, 2018
Robert Cappetta :
5 p.m. in seo 300
Feb. 21, 2018
Lou Kauffman :
5 p.m. in SEO 300
March 7, 2018
Jie Yang :
5 p.m. in seo 300
Abstract
In order to find D-optimal designs in statistics, we
often need to maximize a homogeneous polynomial as a function of
proportions. We introduce two analytic approaches to solve
D-optimal approximate designs under generalized linear models. The
first approach provides analytic D-optimal allocations for
generalized linear models with two factors. The second approach
leads to explicit solutions for a class of generalized linear
models with more than two factors. There are many other similar
optimization problems of homogenous polynomials that are open and
have potential applications in statistics.
March 21, 2018
John Kopper :
5 p.m. in SEO 300
April 11, 2018
Martina Bode :
5 p.m. in seo 300
Oct. 7, 2022
Mustafa Nawaz :
2 p.m. in 612 SEO
Oct. 14, 2022
Karoline Durbin :
2 p.m. in 612 SEO
Abstract
Percolation is a probabilistic model for constructing random subgraphs of the n-dimensional grid by removing edges independently. Originally motivated by statistical physics, percolation has found purchase in many other areas of mathematics. Of particular interest is the fact that percolation undergoes a "phase transition" depending on the choice of the probability of removing an edge. In this talk, we will define precisely what this means, and outline a proof to show the existence of a critical threshold.
Oct. 21, 2022
Sung Min Lee :
2 p.m. in 612 SEO
Nov. 11, 2022
Michael O'Leary :
2 p.m. in 612 SEO
Abstract
In a twist on Claude Shannon’s famous paper “The Mathematical Theory of Communication,” this talk focuses on the more mundane challenge of bringing mathematical models to the public, namely by communicating mathematical concepts in non-technical language. Few people who consume information from mathematical models have a deep understanding of math. Perhaps more importantly for those embarking on a career in math outside academia, people making financial decisions rarely have the mathematical expertise of a math major. The only way decision makers will use a model is for them to believe in the model. Few, if any, will accept a model by faith alone. Therefore it is up to the experts to explain how the model works. A few practical examples from the nuclear power industry, criminal justice, wind power, and financial services are provided to illustrate how important it is to know your audience if you want to bring your models into production.
Nov. 18, 2022
Christof Sparber :
2 p.m. in 612 SEO
Abstract
We survey various mathematical aspects of the uncertainty principle, including Heisenberg's inequality and its variants. The connection to quantum mechanics will also be discussed briefly.
Sept. 25, 2023
Kevin Tucker :
1 p.m. in 636 SEO
Abstract
At its heart, group theory is the study of symmetries of objects, with wide ranging applications within mathematics and far beyond. In this talk, I'll give a brief invitation to the study of groups and permutations, with applications to how to apply these ideas to permutation puzzles of all kinds. In particular, we'll talk about how group theory can be used to figure out how to solve the Rubik's cube -- without simply memorizing a prescribed set of moves.
Oct. 2, 2023
Symbols of Inclusion :
1 p.m. in 636 SEO
Abstract
Interested in applying for graduate school, or debating doing so alongside some other career options? Symbols of Inclusion will be hosting a panel with the Math Club on October 2nd to answer any questions you may have about the process. Sitting on the panel, we’ll have two first years, a third year, and a fourth year graduate student. Another fourth year will moderate. In this way, we hope to be able to accurately address questions about the process itself from students who just went through it, as well as any questions that require more experience in graduate school itself. Please come armed with questions!
Oct. 9, 2023
Zhehao Li :
1 p.m. in 636 SEO
Oct. 16, 2023
Vignesh Jagathese :
1 p.m. in 636 SEO
Abstract
Have you ever been sent a math problem meme by your friends and family? Did it have fruits in a system of equations, or a long line of equalities that conclusively proves that 2 = 1? Perhaps there was a hidden divide by zero, or maybe there were confusing parenthesis placements, or lack thereof. Regardless, there is always a taunt at the beginning of the problem claiming that "99% of people can't solve this!". As mathematicians, you could see the tricks and solve those problems with ease. In today's math club talk, I'll talk about a problem that lives up to this 99% claim, without the trickery common to the others.
Seemingly an innocent question that looks like all the other challenges you've seen, solving this problem will take us on a mathematical journey involving number theory, elliptic curves, abstract algebra, projective and birational geometry, topology, and more. In the end, we'll discuss similar problems and common obstacles to solving them.
Oct. 30, 2023
Matthew Harrison-Trainor :
1 p.m. in 636 SEO
Nov. 6, 2023
Deven Gill :
1 p.m. in 636 SEO
Abstract
The pigeon principle is a fundamental concept in combinatorics. Its applications are wide-reaching, extending well beyond the scope of combinatorics alone. The principle is summarized as follows: Given n+1 balls which we must distribute into n urns, there is at least one urn with two or more balls. A more general form states the following: Given n balls and k urns then there is at least one urn with at least ceiling(n/k) balls.
We'll look at a few applications of this principle to problems appearing in competition mathematics, number theory, and geometry. By the end of this talk, you should have acquired a sense of the pigeonhole principle's importance and utility.
Nov. 13, 2023
Dale Embers :
1 p.m. in 636 SEO
Nov. 20, 2023
Symbols of Inclusion :
1 p.m. in 636 SEO
Abstract
Research Experiences for Undergraduates (REU)
Nov. 27, 2023
Zurich :
1 p.m. in 636 SEO
Abstract
Learn more about the role of an actuary from Zurich! You'll also learn about opportunities to get involved with Math Club and resources from the LAS Career Development and Internships Office!
Sept. 3, 2025
Dr. Nathan Jones :
1 p.m. in 636 SEO
Abstract
The Twin Prime Conjecture predicts that there are infinitely many primes p for which p+2 is also prime (in this case, we call the pair (p,p+2) a pair of twin primes). Despite a lot of recent progress on this conjecture, it remains unsolved today. In this talk, I will explain a heuristic argument leading to a precise form of the conjecture predicting an asymptotic formula as x goes to infinity for the number of twin prime pairs (p,p+2) with p ≤ x. If time permits, I will also discuss the Hardy-Littlewood Prime k-tuples Conjecture, which may be viewed as a generalization of the Twin Prime Conjecture.
Sept. 10, 2025
Thomas Insley :
1 p.m. in 636 SEO
Abstract
: In 1901 Bertrand Russell published a simple and concise paradox - expressed in the language of set theory - which challenged the understanding of mathematical logic at the time and played a part in leading to the modern understanding of set theory today. In this accessible talk we will introduce sets, understand Russell's paradox, note some responses to the paradox, and discuss classes.
Sept. 17, 2025
Yijia Chen :
1 p.m. in 636 SEO
Oct. 15, 2025
Wouter Van Limbeek :
1 p.m. in 636 SEO
Abstract
In 1924, Banach and Tarski proved the following amazing theorem: You can cut up a ball in Euclidean space into some finite number of pieces and reassemble these pieces in such a way that you get two copies of the original ball! We will discuss the proof of this crazy result, what this has to do with a deep notion in group theory called amenability, and why we have not solved the problem of world hunger by doubling and redoubling apples, oranges, potatoes and other spherical foodstuff. No background required except mathematical curiosity.
Oct. 29, 2025
Drew Shulman :
1 p.m. in 636 SEO
Abstract
Leonhard Euler stands among the most influential mathematicians in history. One of his earliest and most remarkable achievements, which helped establish his reputation, was the evaluation of the infinite series of the reciprocals of the squares: 1 + 1/4 + 1/9 + 1/16 + ... now recognized as a p-series with p=2. In this presentation, we will explore Euler’s original proof of this celebrated result and examine how he extended his methods to determine the values of other p-series.
Nov. 5, 2025
Greg Taylor :
1 p.m. in 636 SEO
Abstract
This talk aims to give an introduction to some key ideas in algebraic geometry, including intersections, projective space, tangent spaces, and singularities, via concrete examples of plane curves. The only prerequisite is understanding of the derivative.