The Winter 2018 SASMS will be held on Friday, February 9 at 4:00 in MC 5417. If you would like to give a talk, you may do so by clicking "Sign Up" above.
The plan is to show how can one use tricks and identities in trigonometry to solve difficult contest problems in Euclidean Geometry, by transforming a geometry problem (fully or partially) into an algebra problem that's easier to see the trick. The content of the talk will be based on this: https://anzoteh96.github.io/trigonometry.html
We will use entropy to get a cute bound on the number of triangles in a graph given the number of edges. Also, Letian is a cutie.
I will talk about commutative Banach algebras and their basic properties. The Hardy space $H^\infty$ of bounded analytic functions on the open disk is an example of such a Banach algebra, and its maximal ideal ideal space has many interesting topological properties. Time permitting, I will discuss the Corona Theorem, which states that the open disk in the maximal ideal space is dense.
Test functions, distributions, Schwartz space, Fourier transforms. NO LOCALLY COMPACT GROUPS.
Hey bois, what's good?
The SASMS termly CS infiltration talk. I'm going to introduce core formal language concepts including DFAs and some problems involving them, hopefully leading to some tricks applying basic ideas from linear algebra and graph theory to show that unusual languages are in fact regular.
A while ago, I came up with a counterexample about stochastic processes to make people angry. Unfortunately, the few people I beta-tested my talk on were too stunned by Letian's beauty to get very angry. I'll give the talk anyways and explain some basic concepts in probability theory in the process. Depending on how the talk goes, you can also look forward to an exciting marital arts choreography in collaboration with Rana!
I'll present some cute examples using the probabilistic method.
Ramsey theory asks questions about how large structures must be to guarantee certain properties. We will present and prove a few key results in Ramsey theory involving colouring, by using combinatorial arguments.
I will prove the above easy theorem.