AMS Student Chapter Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
← Older edit
VisualWikitext
Hast (talk | contribs)
99 edits
Aidun (talk | contribs)
149 edits
 
(273 intermediate revisions by 24 users not shown)
Line 1: Line 1:
The AMS Student Chapter Seminar is an informal, graduate student-run 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:00 PM – 3:30 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/~hast/ Daniel Hast], [https://www.math.wisc.edu/~mrjulian/ Ryan Julian], Cullen McDonald, [https://www.math.wisc.edu/~zcharles/ Zachary Charles]
* '''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]].


== Spring 2017 ==
== Fall 2025 ==


=== January 25, Brandon Alberts ===
<center>
 
{| cellspacing="5" cellpadding="14" border="0" style="color:black; font-size:120%"
Title: Ultraproducts - they aren't just for logicians
|-
 
| align="center" width="200" bgcolor="#D0D0D0" |'''Date'''
Abstract: If any of you have attended a logic talk (or one of Ivan's donut seminar talks) you may have learned about ultraproducts as a weird way to mash sets together to get bigger sets in a nice way. Something particularly useful to set theorists, but maybe not so obviously useful to the rest of us. I will give an accessible introduction to ultraproducts and motivate their use in other areas of mathematics.
| align="center" width="200" bgcolor="#A6B658" |'''Speaker'''
 
| align="center" width="300" bgcolor="#BCD2EE" |'''Title'''
=== February 1, Megan Maguire ===
| align="center" width="400" bgcolor="#BCD2EE" |'''Abstract'''
 
|-
Title: Hyperbolic crochet workshop
| bgcolor="#E0E0E0" | September 4
 
| bgcolor="#C6D46E" | Jacob Wood
Abstract: TBA
| 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.
=== February 8, Cullen McDonald ===
|-
 
| bgcolor="#E0E0E0" | September 11
=== February 15, Paul Tveite ===
| bgcolor="#C6D46E" | Sapir Ben-Shahar
 
| bgcolor="#BCE2FE" | More on Matroids
Title: Fun with Hamel Bases!
| 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: If we view the real numbers as a vector field over the rationals, then of course they have a basis (assuming the AOC). This is called a Hamel basis and allows us to do some cool things. Among other things, we will define two periodic functions that sum to the identity function.
| bgcolor="#E0E0E0" | September 18
 
| bgcolor="#C6D46E" | -
=== February 22, Wil Cocke ===
| bgcolor="#BCE2FE" | -
 
| bgcolor="#BCE2FE" | -
Title: Practical Graph Isomorphism
|-
 
| bgcolor="#E0E0E0" | September 25
Abstract: Some graphs are different and some graphs are the same. Sometimes graphs differ only in name. When you give me a graph, you've picked an order. But, is it the same graph across every border?
| bgcolor="#C6D46E" | -
 
| bgcolor="#BCE2FE" | -
=== March 1, Megan Maguire ===
| bgcolor="#BCE2FE" | -
 
|-
Title: I stole this talk from Jordan.
| bgcolor="#E0E0E0" | October 2
 
| bgcolor="#C6D46E" | -
Abstract: Stability is cool! And sometimes things we think don't have stability secretly do. This is an abridged version of a very cool talk I've seen Jordan give a couple times. All credit goes to him. Man, I should have stolen his abstract too.
| bgcolor="#BCE2FE" | -
 
| bgcolor="#BCE2FE" | -
=== March 7, Liban Mohamed ===
|-
 
| bgcolor="#E0E0E0" | October 9
Title: Strichartz Estimates from Qualitative to Quantitative
| bgcolor="#C6D46E" | -
 
| bgcolor="#BCE2FE" | -
Abstract: Strichartz estimates are inequalities that give one way understand the decay of solutions to dispersive PDEs. This talk is an attempt to reconcile the formal statements with physical intuition.
| bgcolor="#BCE2FE" | -
 
|-
=== March 15, Zachary Charles ===
| bgcolor="#E0E0E0" | October 16
 
| bgcolor="#C6D46E" | -
Title: Netflix Problem and Chill
| bgcolor="#BCE2FE" | -
 
| bgcolor="#BCE2FE" | -
Abstract: How are machine learning, matrix analysis, and Napoleon Dynamite related? Come find out!
|-
 
| bgcolor="#E0E0E0" | October 23
=== April 5, Vlad Matei ===
| bgcolor="#C6D46E" | -
 
| bgcolor="#BCE2FE" | -
=== April 12, Micky Steinberg ===
| bgcolor="#BCE2FE" | -
 
|-
Title: Groups as metric spaces
| bgcolor="#E0E0E0" | October 30
 
| bgcolor="#C6D46E" | -
Abstract: Given a group as a set of generators and relations, we can define the “word metric” on the group as the length of the shortest word “between” two elements. This isn’t well-defined, since different generating sets give different metrics, but it is well-defined up to “quasi-isometry”.  Come find out what we can do with this! There will lots of pictures and hand-waving!
| bgcolor="#BCE2FE" | -
 
| bgcolor="#BCE2FE" | -
=== April 19, Solly Parenti ===
|-
 
| bgcolor="#E0E0E0" | November 6
Title: Elementary Integration
| bgcolor="#C6D46E" | -
 
| bgcolor="#BCE2FE" | -
Abstract: Are you like me? Have you also told your calculus students that finding the antiderivative of e^(-x^2) is impossible? Do you also only have a slight idea about how to prove it? Come find out more about the proof and free yourself of that guilt.
| bgcolor="#BCE2FE" | -
 
|-
=== April 26, Ben Bruce ===
| bgcolor="#E0E0E0" | November 13
 
| bgcolor="#C6D46E" | -
=== May 3, Iván Ongay-Valverde ===
| bgcolor="#BCE2FE" | -
 
| bgcolor="#BCE2FE" | -
Title: Living with countably many reals?
|-
 
| bgcolor="#E0E0E0" | November 20
Abstract: Can I make you believe that a countable set of reals are all the reals? If we just have countably many reals, what happens with the others? Do they have any special properties? Let's play a little with our notion of 'reality' and allow to ourselves to find crazy reals doing weird things. Hopefully, no-one's headache will last forever.
| 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 21:36, 18 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 4 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 11 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 18 - - -
September 25 - - -
October 2 - - -
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 - - -
Retrieved from "https://wiki.math.wisc.edu/index.php?title=AMS_Student_Chapter_Seminar&oldid=29119"