# AMS Student Chapter Seminar: Difference between revisions

No edit summary |
No edit summary |
||

Line 29: | Line 29: | ||

Abstract: TBD | Abstract: TBD | ||

=== February 27, | === February 27, James Hanson === | ||

Title: TBD | Title: TBD |

## Revision as of 17:39, 17 February 2019

The AMS Student Chapter Seminar is an informal, graduate student seminar on a wide range of mathematical topics. Pastries (usually donuts) will be provided.

**When:**Wednesdays, 3:20 PM – 3:50 PM**Where:**Van Vleck, 9th floor lounge (unless otherwise announced)**Organizers:**Michel Alexis, David Wagner, Patrick Nicodemus, Son Tu

Everyone is welcome to give a talk. To sign up, please contact one of the organizers with a title and abstract. Talks are 30 minutes long and should avoid assuming significant mathematical background beyond first-year graduate courses.

The schedule of talks from past semesters can be found here.

## Spring 2019

### February 6, Xiao Shen (in VV B139)

Title: Limit Shape in last passage percolation

Abstract: Imagine the following situation, attached to each point on the integer lattice Z^2 there is an arbitrary amount of donuts. Fix x and y in Z^2, if you get to eat all the donuts along an up-right path between these two points, what would be the maximum amount of donuts you can get? This model is often called last passage percolation, and I will discuss a classical result about its scaling limit: what happens if we zoom out and let the distance between x and y tend to infinity.

### February 13, Michel Alexis (in VV B139)

Title: An instructive yet useless theorem about random Fourier Series

Abstract: Consider a Fourier series with random, symmetric, independent coefficients. With what probability is this the Fourier series of a continuous function? An [math]\displaystyle{ L^{p} }[/math] function? A surprising result is the Billard theorem, which says such a series results almost surely from an [math]\displaystyle{ L^{\infty} }[/math] function if and only if it results almost surely from a continuous function. Although the theorem in of itself is kind of useless in of itself, its proof is instructive in that we will see how, via the principle of reduction, one can usually just pretend all symmetric random variables are just coin flips (Bernoulli trials with outcomes [math]\displaystyle{ \pm 1 }[/math]).

### February 20, Geoff Bentsen

Title: TBD

Abstract: TBD

### February 27, James Hanson

Title: TBD

Abstract: TBD

### March 6, Working Group to establish an Association of Mathematics Graduate Students

Title: Math and Government

Abstract: TBD

### March 13, TBD

Title: TBD

Abstract: TBD

### March 26 (Prospective Student Visit Day), Multiple Speakers

#### Eva Elduque

Title: TBD

Abstract: TBD

#### Rajula Srivastava

Title: TBD

Abstract: TBD

#### Soumya Sankar

Title: TBD

Abstract: TBD

#### [Insert Speaker]

Title: TBD

Abstract: TBD

#### [Insert Speaker]

Title: TBD

Abstract: TBD

#### [Insert Speaker]

Title: TBD

Abstract: TBD

#### [Insert Speaker]

Title: TBD

Abstract: TBD

#### [Insert Speaker]

Title: TBD

Abstract: TBD

#### [Insert Speaker]

Title: TBD

Abstract: TBD

### April 3, TBD

Title: TBD

Abstract: TBD

### April 10, TBD

Title: TBD

Abstract: TBD

### April 17, Hyun-Jong

Title: TBD

Abstract: TBD

### April 24, TBD

Title: TBD

Abstract: TBD