AMS Student Chapter Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
VisualWikitext
No edit summary
 
(47 intermediate revisions by 3 users not shown)
Line 1: Line 1:
The AMS Student Chapter Seminar (aka Donut 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, 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.
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.
Line 9: Line 9:
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 2020 ==
== Fall 2024 ==
<center>
{| cellspacing="5" cellpadding="14" border="0" style="color:black; font-size:120%"
! align="center" width="200" bgcolor="#D0D0D0" |'''Date'''
! align="center" width="200" bgcolor="#A6B658" |'''Speaker'''
! align="center" width="300" bgcolor="#BCD2EE" |'''Title'''
! align="center" width="400" bgcolor="#BCD2EE" |'''Abstract'''
|-
| bgcolor="#D0D0D0" |September 12
| bgcolor="#A6B658" |Ari Davidovsky
| bgcolor="#BCD2EE" |95% of people can't solve this!
| bgcolor="#BCD2EE" | [[File:Image.png|360px]]


=== February 5, Alex Mine===
We will attempt to answer this question and along the way explore how algebra and geometry work together to solve problems in number theory.
|-
| bgcolor="#D0D0D0" |September 19
| bgcolor="#A6B658" |CANCELLED
| bgcolor="#BCD2EE" |NONE
| bgcolor="#BCD2EE" |NONE
|-
| bgcolor="#D0D0D0" |September 26
| bgcolor="#A6B658" |Mateo Morales
| bgcolor="#BCD2EE" |Officially petitioning the department to acquire a ping pong table.
| bgcolor="#BCD2EE" |Ever want to prove something is a free group of rank 2? Me too. One way to do this is to use a ping pong argument of how a group generated by two elements acts on a set.
I will illustrate the ping pong argument using an example of matrices, explain how it works, and explain why, kinda.


Title: Khinchin's Constant
Very approachable if you know what a group is but does require tons of ping pong experience.
 
|-
Abstract: I'll talk about a really weird fact about continued fractions.
| bgcolor="#D0D0D0" |October 3
 
| bgcolor="#A6B658" |Karthik Ravishankar
=== February 12, Xiao Shen===
| bgcolor="#BCD2EE" |Incompleteness for the working mathematician
 
| bgcolor="#BCD2EE" |In this talk we'll take a look at Gödels famous incompleteness theorems and look at some of its immediate as well as interesting consequences. No background in logic is necessary!
Title: Coalescence estimates for the corner growth model with exponential weights
|-
 
| bgcolor="#D0D0D0" |October 10
Abstract: (Joint with Timo Seppalainen) I will talk about estimates for the coalescence time of semi-infinite directed geodesics in the planar corner growth model. Not much probability background is needed.
| bgcolor="#A6B658" |Elizabeth Hankins
 
| bgcolor="#BCD2EE" |Mathematical Origami and Flat-Foldability
=== February 19, Hyun Jong Kim===
| bgcolor="#BCD2EE" |If you've ever unfolded a piece of origami, you might have noticed complicated symmetries in the pattern of creases left behind. What patterns of lines can and cannot be folded into origami? And why is it sometimes hard to determine?
 
|-
Title: Orbifolds for Music
| bgcolor="#D0D0D0" |October 17
 
| bgcolor="#A6B658" |CANCELLED
Abstract: In the first-ever music theory article published by the journal ''Science'', Dmitri Tymoczko uses orbifolds to describe a general framework for thinking about musical tonality. I am going to introduce the musical terms and ideas needed to describe how such orbifolds arise so that we can see an example of Tymoczko's geometric analysis of chord progressions.
| bgcolor="#BCD2EE" |NONE
 
| bgcolor="#BCD2EE" |NONE
=== February 26, Solly Parenti===
|-
 
| bgcolor="#D0D0D0" |October 24
Title: Mathematical Measuring
| bgcolor="#A6B658" |CANCELLED
 
| bgcolor="#BCD2EE" |NONE
Abstract: What's the best way to measure things? Come find out!
| bgcolor="#BCD2EE" |NONE
 
|-
=== March 4, ===
| bgcolor="#D0D0D0" |October 31
 
| bgcolor="#A6B658" |Jacob Wood
Title: TBD
| bgcolor="#BCD2EE" |What is the length of a <s>potato</s> pumpkin?
 
| bgcolor="#BCD2EE" |How many is a jack-o-lantern? What is the length of a pumpkin? These questions sound like nonsense, but they have perfectly reasonable interpretations with perfectly reasonable answers. On our journey through the haunted house with two rooms, we will encounter some scary characters like differential topology and measure theory. Do not fear; little to no experience in either subject is required.
Abstract: TBD
|-
 
| bgcolor="#D0D0D0" |November 7
=== March 11, Ivan Aidun===
| bgcolor="#A6B658" |CANCELLED: DISTINGUISHED LECTURE
 
| bgcolor="#BCD2EE" |NONE
Title: The Notorious CRT
| bgcolor="#BCD2EE" |NONE
 
|-
Abstract: You're walking up Bascomb hill when a troll suddenly appears and says he'll kill you unless you compute the determinant of
| bgcolor="#D0D0D0" |November 14
:<math> \begin{bmatrix}0 & -7 & -17 & -5 & -13\\8 & -14 & 14 & 11 & 15\\-5 & -17 & 10 & 2 & 10\\17 & 3 & -16 & -13 & 7\\-1 & 2 & -13 & -11 & 10\end{bmatrix}</math>
| bgcolor="#A6B658" |Sapir Ben-Shahar
by hand. wdyd?
| bgcolor="#BCD2EE" |Hexaflexagons
 
| bgcolor="#BCD2EE" |Come along for some hexaflexafun and discover the mysterious properties of hexaflexagons, the bestagons! Learn how to make and navigate through the folds of your very own paper hexaflexagon. No prior knowledge of hexagons (or hexaflexagons) is assumed.
=== March 24 - Visit Day===
|-
 
| bgcolor="#D0D0D0" |November 21
==== Brandon Boggess, Time TBD====
| bgcolor="#A6B658" |Andrew Krenz
 
| bgcolor="#BCD2EE" |All concepts are database queries
Title: TBD
| bgcolor="#BCD2EE" |A celebrated result of applied category theory states that the category of small categories is equivalent to the category of database schemas. Therefore, every theorem about small categories can be interpreted as a theorem about databases.  Maybe you've heard someone repeat Mac Lane's famous slogan "all concepts are Kan extensions."  In this talk, I'll give a high-level overview of/introduction to categorical database theory (developed by David Spivak) wherein Kan extensions play the role of regular every day database queries.  No familiarity with categories or databases will be assumed.
 
|-
Abstract: TBD
| bgcolor="#D0D0D0" |November 28
 
| bgcolor="#A6B658" |THANKSGIVING
==== Yandi Wu, Time TBD====
| bgcolor="#BCD2EE" |NONE
 
| bgcolor="#BCD2EE" |NONE
Title: TBD
|-
 
| bgcolor="#D0D0D0" |December 5
Abstract: TBD
| bgcolor="#A6B658" |Caroline Nunn
 
| bgcolor="#BCD2EE" |TBA
==== Maya Banks, Time TBD====
| bgcolor="#BCD2EE" |T
 
|}
Title: TBD
</center>
 
Abstract: TBD
 
==== Yuxi Han, Time TBD====
 
Title: TBD
 
Abstract: TBD
 
==== Dionel Jaime, Time TBD====
 
Title: TBD
 
Abstract: TBD
 
==== Yun Li, Time TBD====
 
Title: TBD
 
Abstract: TBD
 
==== TBD, Time TBD====
 
Title: TBD
 
Abstract: TBD
 
==== TBD, Time TBD====
 
Title: TBD
 
Abstract: TBD
 
==== TBD, Time TBD====
 
Title: TBD
 
Abstract: TBD
 
=== April 1, Ying Li===
 
Title: TBD
 
Abstract: TBD
 
=== April 8, TBD===
 
Title: TBD
 
Abstract: TBD
 
=== April 15, Owen Goff===
 
Title: TBD
 
Abstract: TBD
 
=== April 22, TBD===
 
Title: TBD
 
Abstract: TBD
 
== Fall 2019 ==
 
=== October 9, Brandon Boggess===
 
Title: An Application of Elliptic Curves to the Theory of Internet Memes
 
Abstract: Solve polynomial equations with this one weird trick! Math teachers hate him!!!
 
[[File:Thumbnail fruit meme.png]]
 
=== October 16, Jiaxin Jin===
 
Title: Persistence and global stability for biochemical reaction-diffusion systems
 
Abstract: The investigation of the dynamics of solutions of nonlinear reaction-diffusion PDE systems generated by biochemical networks is a great challenge; in general, even the existence of classical solutions is difficult to establish. On the other hand, these kinds of problems appear very often in biological applications, e.g., when trying to understand the role of spatial inhomogeneities in living cells. We discuss the persistence and global stability properties of special classes of such systems, under additional assumptions such as: low number of species, complex balance or weak reversibility.
 
=== October 23, Erika Pirnes===
 
(special edition: carrot seminar)
 
Title: Why do ice hockey players fall in love with mathematicians? (Behavior of certain number string sequences)
 
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.
 
=== October 30, Yunbai Cao===
 
Title: Kinetic theory in bounded domains
 
Abstract: In 1900, David Hilbert outlined 23 important problems in the International Congress of Mathematics. One of them is the Hilbert's sixth problem which asks the mathematical linkage between the mechanics from microscopic view and the macroscopic view. A relative new mesoscopic point of view at that time which is "kinetic theory" was highlighted by Hilbert as the bridge to link the two. In this talk, I will talk about the history and basic elements of kinetic theory and Boltzmann equation, and the role boundary plays for such a system, as well as briefly mention some recent progress.
 
=== November 6, Tung Nguyen===
 
Title: Introduction to Chemical Reaction Network
 
Abstract: Reaction network models are often used to investigate the dynamics of different species from various branches of chemistry, biology and ecology. The study of reaction network has grown significantly and involves a wide range of mathematics and applications. In this talk, I aim to show a big picture of what is happening in reaction network theory. I will first introduce the basic dynamical models for reaction network: the deterministic and stochastic models. Then, I will mention some big questions of interest, and the mathematical tools that are used by people in the field. Finally, I will make connection between reaction network and other branches of mathematics such as PDE, control theory, and random graph theory.
 
=== November 13, Jane Davis===
 
Title: Brownian Minions
 
Abstract: Having lots of small minions help you perform a task is often very effective. For example, if you need to grade a large stack of calculus problems, it is effective to have several TAs grade parts of the pile for you. We'll talk about how we can use random motions as minions to help us perform mathematical tasks. Typically, this mathematical task would be optimization, but we'll reframe a little bit and focus on art and beauty instead. We'll also try to talk about the so-called "storytelling metric," which is relevant here. There will be pictures and animations! 🎉
 
Sneak preview: some modern art generated with MATLAB.
 
[[File:Picpic.jpg]]
 
=== November 20, Colin Crowley===
 
Title: Matroid Bingo
 
Abstract: Matroids are combinatorial objects that generalize graphs and matrices. The famous combinatorialist Gian Carlo Rota once said that "anyone who has worked with matroids has come away with the conviction that matroids are one of the richest and most useful ideas of our day." Although his day was in the 60s and 70s, matroids remain an active area of current research with connections to areas such as algebraic geometry, tropical geometry, and parts of computer science. Since this is a doughnut talk, I will introduce matroids in a cute way that involves playing bingo, and then I'll show you some cool examples.
 
=== December 4, Xiaocheng Li===
 
Title: The method of stationary phase and Duistermaat-Heckman formula
 
Abstract: The oscillatory integral $\int_X e^{itf(x)}\mu=:I(t), t\in \mathbb{R}$ is a fundamental object in analysis. In general, $I(t)$ seldom has an explicit expression as Fourier transform is usually inexplicit. In practice, we are interested in the asymptotic behavior of $I(t)$, that is, for $|t|$ very large. A classical tool of getting an approximation is the method of stationary phase which gives the leading term of $I(t)$. Furthermore, there are rare instances for which the approximation coincides with the exact value of $I(t)$. One example is the Duistermaat-Heckman formula in which the Hamiltonian action and the momentum map are addressed. In the talk, I will start with basic facts in Fourier analysis, then discuss the method of stationary phase and the Duistermaat-Heckman formula.
 
=== December 11, Chaojie Yuan===
 
Title: Coupling and its application in stochastic chemical reaction network
 
Abstract: Stochastic models for chemical reaction networks have become increasingly popular in the past few decades. When the molecules are present in low numbers, the chemical system always displays randomness in their dynamics, and the randomness cannot be ignored as it can have a significant effect on the overall properties of the dynamics. In this talk, I will introduce the stochastic models utilized in the context of biological interaction network. Then I will discuss coupling in this context, and illustrate through examples how coupling methods can be utilized for numerical simulations. Specifically, I will introduce two biological models, which attempts to address the behavior of interesting real-world phenomenon.

Latest revision as of 18:18, 20 November 2024

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, 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 2024

Date Speaker Title Abstract
September 12 Ari Davidovsky 95% of people can't solve this! Image.png

We will attempt to answer this question and along the way explore how algebra and geometry work together to solve problems in number theory.

September 19 CANCELLED NONE NONE
September 26 Mateo Morales Officially petitioning the department to acquire a ping pong table. Ever want to prove something is a free group of rank 2? Me too. One way to do this is to use a ping pong argument of how a group generated by two elements acts on a set.

I will illustrate the ping pong argument using an example of matrices, explain how it works, and explain why, kinda.

Very approachable if you know what a group is but does require tons of ping pong experience.

October 3 Karthik Ravishankar Incompleteness for the working mathematician In this talk we'll take a look at Gödels famous incompleteness theorems and look at some of its immediate as well as interesting consequences. No background in logic is necessary!
October 10 Elizabeth Hankins Mathematical Origami and Flat-Foldability If you've ever unfolded a piece of origami, you might have noticed complicated symmetries in the pattern of creases left behind. What patterns of lines can and cannot be folded into origami? And why is it sometimes hard to determine?
October 17 CANCELLED NONE NONE
October 24 CANCELLED NONE NONE
October 31 Jacob Wood What is the length of a potato pumpkin? How many is a jack-o-lantern? What is the length of a pumpkin? These questions sound like nonsense, but they have perfectly reasonable interpretations with perfectly reasonable answers. On our journey through the haunted house with two rooms, we will encounter some scary characters like differential topology and measure theory. Do not fear; little to no experience in either subject is required.
November 7 CANCELLED: DISTINGUISHED LECTURE NONE NONE
November 14 Sapir Ben-Shahar Hexaflexagons Come along for some hexaflexafun and discover the mysterious properties of hexaflexagons, the bestagons! Learn how to make and navigate through the folds of your very own paper hexaflexagon. No prior knowledge of hexagons (or hexaflexagons) is assumed.
November 21 Andrew Krenz All concepts are database queries A celebrated result of applied category theory states that the category of small categories is equivalent to the category of database schemas. Therefore, every theorem about small categories can be interpreted as a theorem about databases.  Maybe you've heard someone repeat Mac Lane's famous slogan "all concepts are Kan extensions."  In this talk, I'll give a high-level overview of/introduction to categorical database theory (developed by David Spivak) wherein Kan extensions play the role of regular every day database queries.  No familiarity with categories or databases will be assumed.
November 28 THANKSGIVING NONE NONE
December 5 Caroline Nunn TBA T
Retrieved from "https://wiki.math.wisc.edu/index.php?title=AMS_Student_Chapter_Seminar&oldid=27633"