Short Attention Span Math Seminars

Spring 2017

The Spring 2017 SASMS will be held on Thursday, July 6 at 16:00 in MC 5479. If you would like to give a talk, you may do so by clicking "Sign Up" above.

Talks

Time
Speaker
Talk Title
4:00
Wenyi Zheng
Thermodynamics of Polymer Solutions
4:30
Nikita Kapustin
Crash course on monoids
5:00
Letian Chen
Method of Continuity for Second-order Linear Parabolic Equations
5:30
Sally Dong
The Cap Set Problem
6:00
Pure Math Club
Dinner
6:30
Ilia Chtcherbakov
Nondistributive lattices
7:00
Sean Harrap
Approximately Communicating Equality
7:30
Stephen Wen
Fermat's Last Theorem and the Riemann Hypothesis
8:00
Quincy Lap-Kwan Lam
Extended formulations of polytopes
8:30
Ifaz Kabir
A model theoretic interpretation of unification

Abstracts

Thermodynamics of Polymer Solutions

In this talk I will briefly describe the Flory-Huggins Model of polymer thermodynamics.

Crash course on monoids

Monoids are the calcium that's missing from your bones.

Method of Continuity for Second-order Linear Parabolic Equations

Assuming the heat equation is uniquely solvable (in some Hölder spaces) we show using the method of continuity that a general second-order parabolic equation (satisfying some conditions) is also solvable. Good chance that I won't finish on time.

The Cap Set Problem

¯\_(ツ)_/¯ (basically this: https://canadam.math.ca/2017/abs/pdf/pil-je.pdf)

Dinner

We provide constructive examples of sandwiches and proceed to investigate the benefits of various sandwiches.

Nondistributive lattices

This is all Sean Harrap's fault.

Approximately Communicating Equality

This is secretly a CS talk with some stats sprinkled in but I plan to say the word "Theorem" once or twice. Certified spicy.

Fermat's Last Theorem and the Riemann Hypothesis

I WILL PROVE BOTH FERMAT'S LAST THEOREM AND THE RIEMANN HYPOTHESIS IN ONE SHORT TALK (may or may not be over $\mathbb{Z}$, may or may not be over function fields)

Extended formulations of polytopes

The minimum number of facets of an extended formulation is related to the complexity of its slack matrix.

A model theoretic interpretation of unification

Unification is an algorithm that allows us to figure out what the type of an expression should be, or what an expression should be if the expression itself is a type. In this talk we will look at model theoretic interpretations of the ideas involved in unification.