AMS Student Chapter Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
Malexis (talk | contribs)
Aidun (talk | contribs)
 
(123 intermediate revisions by 16 users not shown)
Line 1: Line 1:
The AMS Student Chapter Seminar is an informal, graduate student seminar on a wide range of mathematical topics. Pastries (usually donuts) will be provided.
The AMS Student Chapter Seminar (aka Donut Seminar) is an informal, graduate student seminar on a wide range of mathematical topics. The goal of the seminar is to promote community building and give graduate students an opportunity to communicate fun, accessible math to their peers in a stress-free (but not sugar-free) environment. Pastries (usually donuts) will be provided.


* '''When:''' Wednesdays, 3:20 PM – 3:50 PM
* '''When:''' Thursdays 4:00-4:30pm
* '''Where:''' Van Vleck, 9th floor lounge (unless otherwise announced)
* '''Where:''' Van Vleck, 9th floor lounge (unless otherwise announced)
* '''Organizers:''' [https://www.math.wisc.edu/~malexis/ Michel Alexis], [https://www.math.wisc.edu/~drwagner/ David Wagner], [http://www.math.wisc.edu/~nicodemus/ Patrick Nicodemus], [http://www.math.wisc.edu/~thaison/ Son Tu], Carrie Chen
* '''Organizers:''' Ivan Aidun, Alex Bonat, Kaiyi Huang, Ethan Schondorf


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


The schedule of talks from past semesters can be found [[AMS Student Chapter Seminar, previous semesters|here]].
The schedule of talks from past semesters can be found [[AMS Student Chapter Seminar, previous semesters|here]].


== Fall 2019 ==
== Fall 2025 ==


=== October 9, Brandon Boggess===
<center>
 
{| cellspacing="5" cellpadding="14" border="0" style="color:black; font-size:120%"
Title: TBD
|-
 
| align="center" width="200" bgcolor="#D0D0D0" |'''Date'''
Abstract: TBD
| align="center" width="200" bgcolor="#A6B658" |'''Speaker'''
 
| align="center" width="300" bgcolor="#BCD2EE" |'''Title'''
=== October 16, Jiaxin Jin===
| align="center" width="400" bgcolor="#BCD2EE" |'''Abstract'''
 
|-
Title: TBD
| bgcolor="#E0E0E0" | September 11
 
| bgcolor="#C6D46E" | Jacob Wood
Abstract: TBD
| bgcolor="#BCE2FE" | Realizing Matroids
 
| bgcolor="#BCE2FE" | A matroid is a combinatorial object encoding notions of "independence".  For example, given a set of vectors in a vector space, there is an associated matroid encoding which subsets of those vectors are linearly independent of one another.  A matroid arising in this way is called "realizable", but it turns out some abstract matroids cannot be given in this way.  In this talk, I'll introduce matroids and talk about how to find these unrealizable matroids.
=== October 23, Erika Pirnes===
|-
 
| bgcolor="#E0E0E0" | September 18
(special edition: carrot seminar)
| bgcolor="#C6D46E" | Sapir Ben-Shahar
 
| bgcolor="#BCE2FE" | More on Matroids
Title: Why do ice hockey players fall in love with mathematicians? (Behavior of certain number string sequences)
| bgcolor="#BCE2FE" | Essentially a continuation of Jacob's talk from last week, I'll give another perspective on matroids, including talking about other ways in which we can (sometimes) represent them.
 
|-
Abstract: Starting with some string of digits 0-9, add the adjacent numbers pairwise to obtain a new string. Whenever the sum is 10 or greater, separate its digits. For example, 26621 would become 81283 and then 931011. Repeating this process with different inputs gives varying behavior. In some cases the process terminates (becomes a single digit), or ends up in a loop, like 999, 1818, 999... The length of the strings can also start growing very fast. I'll discuss some data and conjectures about classifying the behavior.
| bgcolor="#E0E0E0" | September 25
 
| bgcolor="#C6D46E" | Taylor Tan
=== October 30, Yunbai Cao===
| bgcolor="#BCE2FE" | Dispersive Equations
 
| bgcolor="#BCE2FE" | As a model case I will focus on the free Schrodinger in R and the torus and compare the different dispersive behaviors (or lack thereof).
Title: TBD
On the line, wave packet spread gives us the expected decay readily.
 
On the tori, the story is more subtle due to constructive interference coming from the major arcs of a quadratic Weyl sum.
Abstract: TBD
This is meant for a general audience, so I will try to give the intuition with pictures.
 
|-
=== November 6, Tung Nguyen===
| bgcolor="#E0E0E0" | October 2
 
| bgcolor="#C6D46E" | Dhruv Kulshreshtha
Title: TBD
| bgcolor="#BCE2FE" | Reducing the infinite to the finite
 
| bgcolor="#BCE2FE" | Have you ever wondered how many colors are needed to color a countably infinite map? Or why statements that are satisfied by the complex numbers are also satisfied by all algebraically closed fields of sufficiently large prime characteristic?
Abstract: TBD
In this talk, we will explore the Compactness Theorem, which resolves many such interesting questions! No background in logic is necessary.
 
|-
=== November 13, Stephen Davis===
| bgcolor="#E0E0E0" | October 9
 
| bgcolor="#C6D46E" | -
Title: TBD
| bgcolor="#BCE2FE" | -
 
| bgcolor="#BCE2FE" | -
Abstract: TBD
|-
 
| bgcolor="#E0E0E0" | October 16
=== November 20, Colin Crowley===
| bgcolor="#C6D46E" | -
 
| bgcolor="#BCE2FE" | -
Title: TBD
| bgcolor="#BCE2FE" | -
 
|-
Abstract: TBD
| bgcolor="#E0E0E0" | October 23
 
| bgcolor="#C6D46E" | -
=== December 4, Xiaocheng Li===
| bgcolor="#BCE2FE" | -
 
| bgcolor="#BCE2FE" | -
Title: TBD
|-
 
| bgcolor="#E0E0E0" | October 30
Abstract: TBD
| bgcolor="#C6D46E" | -
 
| bgcolor="#BCE2FE" | -
=== December 11, Chaojie Yuan===
| bgcolor="#BCE2FE" | -
 
|-
Title: TBD
| bgcolor="#E0E0E0" | November 6
 
| bgcolor="#C6D46E" | -
Abstract: TBD
| bgcolor="#BCE2FE" | -
| bgcolor="#BCE2FE" | -
|-
| bgcolor="#E0E0E0" | November 13
| bgcolor="#C6D46E" | -
| bgcolor="#BCE2FE" | -
| bgcolor="#BCE2FE" | -
|-
| bgcolor="#E0E0E0" | November 20
| bgcolor="#C6D46E" | Emma Hayes
| bgcolor="#BCE2FE" | An Introduction to My Favorite PDE
| bgcolor="#BCE2FE" | TBA
|-
| bgcolor="#E0E0E0" | November 27
| bgcolor="#C6D46E" | THANKSGIVING
| bgcolor="#BCE2FE" | NONE
| bgcolor="#BCE2FE" | NONE
|-
| bgcolor="#E0E0E0" | December 4
| bgcolor="#C6D46E" | -
| bgcolor="#BCE2FE" | -
| bgcolor="#BCE2FE" | -
|}
</center>

Latest revision as of 18:33, 29 September 2025

The AMS Student Chapter Seminar (aka Donut Seminar) is an informal, graduate student seminar on a wide range of mathematical topics. The goal of the seminar is to promote community building and give graduate students an opportunity to communicate fun, accessible math to their peers in a stress-free (but not sugar-free) environment. Pastries (usually donuts) will be provided.

  • When: Thursdays 4:00-4:30pm
  • Where: Van Vleck, 9th floor lounge (unless otherwise announced)
  • Organizers: Ivan Aidun, Alex Bonat, Kaiyi Huang, Ethan Schondorf

Everyone is welcome to give a talk. To sign up, please contact one of the organizers with a title and abstract. Talks are 25 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.

Fall 2025

Date Speaker Title Abstract
September 11 Jacob Wood Realizing Matroids A matroid is a combinatorial object encoding notions of "independence".  For example, given a set of vectors in a vector space, there is an associated matroid encoding which subsets of those vectors are linearly independent of one another.  A matroid arising in this way is called "realizable", but it turns out some abstract matroids cannot be given in this way.  In this talk, I'll introduce matroids and talk about how to find these unrealizable matroids.
September 18 Sapir Ben-Shahar More on Matroids Essentially a continuation of Jacob's talk from last week, I'll give another perspective on matroids, including talking about other ways in which we can (sometimes) represent them.
September 25 Taylor Tan Dispersive Equations As a model case I will focus on the free Schrodinger in R and the torus and compare the different dispersive behaviors (or lack thereof).

On the line, wave packet spread gives us the expected decay readily. On the tori, the story is more subtle due to constructive interference coming from the major arcs of a quadratic Weyl sum. This is meant for a general audience, so I will try to give the intuition with pictures.

October 2 Dhruv Kulshreshtha Reducing the infinite to the finite Have you ever wondered how many colors are needed to color a countably infinite map? Or why statements that are satisfied by the complex numbers are also satisfied by all algebraically closed fields of sufficiently large prime characteristic?

In this talk, we will explore the Compactness Theorem, which resolves many such interesting questions! No background in logic is necessary.

October 9 - - -
October 16 - - -
October 23 - - -
October 30 - - -
November 6 - - -
November 13 - - -
November 20 Emma Hayes An Introduction to My Favorite PDE TBA
November 27 THANKSGIVING NONE NONE
December 4 - - -