Short Attention Span Math Seminars

Fall 2017

The Fall 2017 SASMS will be held on Friday, November 10 at 4:30 in MC 5417. If you would like to give a talk, you may do so by clicking "Sign Up" above.

Talks

Time
Speaker
Talk Title
4:30
Stephen Wen
The Mathematical Foundations of Economics
5:00
Letian Chen
Minimal Surfaces
5:30
Shouzhen Gu
Physics
6:00
Pure Math Club
Dinner
6:30
Zouhaier Ferchiou
How NOT to add fractions
7:00
Adam John Michael Brown
Infinite pigeons.
7:30
Felix Bauckholt
A slightly more motivated look at impartial games
8:00
Sean Harrap
Probabilistically Checkable Proofs of Proximity
8:30
Alexandru Gatea
Block Characters of $S_{/infty}$
9:00
Jarry Gu
How to get a 🅱Math degree in Pure Mathematics in 1980

Abstracts

The Mathematical Foundations of Economics

We will cover the foundations of choice theory to give a flavour of the study of economics and the mathematical reasoning that goes into it.

Minimal Surfaces

I will derive the minimal surface equation using variational method and then discuss the generalization to manifolds. If I have time I will discuss some further results of CM. I won't.

Physics

I will show how quantum mechanics is only a slight adjustment from classical mechanics.

Dinner

Hello, I'm dinner. I'd like to introduce you to me <3

How NOT to add fractions

Remember how to add fractions ? Reduce them to common denominators, then add numerators ? That's too complicated for me so I do point-wise addition. For this talk, I will be trying to convince you that this is not completely useless. (something something Riemann Hypothesis something something)

Infinite pigeons.

There are some similarities in the proofs from infinite graphs and real analysis. Also pigeons. See functional analysis assignment.

A slightly more motivated look at impartial games

You've been bamboozled! Due to a lack of preparation I'll just scrape together random cool stuff without any motivation at all.

Probabilistically Checkable Proofs of Proximity

A brief introduction to some semi-recent (as new as 10 years old) research on the P vs NP problem from a probabilistic perspective.

Block Characters of $S_{/infty}$

I will construct the set of extremal normalized block characters of $ S_{\infty}$ from block characters of $S_n$ (where a block character is just a character depending only on the number of disjoint cycles of each permutation g).

How to get a 🅱Math degree in Pure Mathematics in 1980

It's a boring talk… You may leave early as you want