AMS Student Chapter Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
VisualWikitext
No edit summary
No edit summary
 
(368 intermediate revisions by 31 users not shown)
Line 1: Line 1:
'''General Information''':  AMS Student Chapter Seminar will take place on Wednesday at ''3:00 PM'' in the 9th floor lounge area. Talks should be of interest to the general math community, and generally will not run longer than 30 minutes.  Everyone is welcome to give a talk, please just sign up on this page. Alternatively we will also sign interested people up at the seminar itself.  There will generally be donut provided, although the snack may vary from week to week.
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.


To sign up please provide your name and a title.  Abstracts are welcome but optional.
* '''When:''' Thursdays 4:00-4:30pm
* '''Where:''' Van Vleck, 9th floor lounge (unless otherwise announced)
* '''Organizers:''' Ivan Aidun, Kaiyi Huang, Ethan Schondorf


==Spring 2015==
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.


===September 25, Moisés Herradón===
The schedule of talks from past semesters can be found [[AMS Student Chapter Seminar, previous semesters|here]].


Title: Winning games and taking names
== 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]]


Abstract:  So let’s say we’re already amazing at playing one game (any game!) at a time and we now we need to play several games at once, to keep it challenging. We will see that doing this results in us being able to define an addition on the collection of all games, and that it actually turns this collection into a Group. I will talk about some of the wonders that lie within the group. Maybe lions? Maybe a field containing both the real numbers and the ordinals? For sure it has to be one of these two!
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.


==Fall 2014==
Very approachable if you know what a group is but does require tons of ping pong experience.
 
|-
===September 25, Vladimir Sotirov===
| bgcolor="#D0D0D0" |October 3
 
| bgcolor="#A6B658" |Karthik Ravishankar
Title: [[Media:Compact-openTalk.pdf|The compact open topology: what is it really?]]
| 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!
Abstract:  The compact-open topology on the space C(X,Y) of continuous functions from X to Y is mysteriously generated by declaring that for each compact subset K of X and each open subset V of Y, the continous functions f: X->Y conducting K inside V constitute an open set. In this talk, I will explain the universal property that uniquely determines the compact-open topology, and sketch a pretty constellation of little-known but elementary facts from domain theory that dispell the mystery of the compact-open topology's definition.
|-
 
| bgcolor="#D0D0D0" |October 10
===October 8, David Bruce===
| bgcolor="#A6B658" |Elizabeth Hankins
 
| bgcolor="#BCD2EE" |Mathematical Origami and Flat-Foldability
Title: Hex on the Beach
| 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?
 
|-
Abstract: The game of Hex is a two player game played on a hexagonal grid attributed in part to John Nash. (This is the game he is playing in /A Beautiful Mind./) Despite being relatively easy to pick up, and pretty hard to master, this game has surprising connections to some interesting mathematics. This talk will introduce the game of Hex, and then explore some of these connections. *As it is a lot more fun once you've actually played Hex feel free to join me at 3:00pm on the 9th floor to actually play a few games of Hex!*
| bgcolor="#D0D0D0" |October 17
 
| bgcolor="#A6B658" |CANCELLED
===October 22, Eva Elduque===
| bgcolor="#BCD2EE" |NONE
 
| bgcolor="#BCD2EE" |NONE
Title: The fold and one cut problem
|-
 
| bgcolor="#D0D0D0" |October 24
Abstract: What shapes can we get by folding flat a piece of paper and making (only) one complete straight cut? The answer is surprising: We can cut out any shape drawn with straight line segments. In the talk, we will discuss the two methods of approaching this problem, focusing on the straight skeleton method, the most intuitive of the two.
| bgcolor="#A6B658" |CANCELLED
 
| bgcolor="#BCD2EE" |NONE
===November 5, Megan Maguire===
| bgcolor="#BCD2EE" |NONE
 
|-
Title: Train tracks on surfaces
| bgcolor="#D0D0D0" |October 31
 
| bgcolor="#A6B658" |Jacob Wood
Abstract: What is a train track, mathematically speaking? Are they interesting? Why are they interesting? Come find out!
| 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.
===November 19, Adrian Tovar-Lopez===
|-
 
| bgcolor="#D0D0D0" |November 7
Title:  Hodgkin and Huxley equations of a single neuron
| bgcolor="#A6B658" |CANCELLED: DISTINGUISHED LECTURE
 
| bgcolor="#BCD2EE" |NONE
===December 3, Zachary Charles===
| bgcolor="#BCD2EE" |NONE
 
|-
Abstract: An addition chain is a sequence of numbers starting at one, such that every number is the sum of two previous numbers. What is the shortest chain ending at a number n? While this is already difficult, we will talk about how addition chains answer life's difficult questions, including: How do we compute 2^4? What can the Ancient Egyptians teach us about elliptic curve cryptography? What about subtraction?
| bgcolor="#D0D0D0" |November 14
| bgcolor="#A6B658" |Sapir Ben-Shahar
| 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.
|-
| bgcolor="#D0D0D0" |November 21
| bgcolor="#A6B658" |Andrew Krenz
| bgcolor="#BCD2EE" |All concepts are database queries
| 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.
|-
| bgcolor="#D0D0D0" |November 28
| bgcolor="#A6B658" |THANKSGIVING
| bgcolor="#BCD2EE" |NONE
| bgcolor="#BCD2EE" |NONE
|-
| bgcolor="#D0D0D0" |December 5
| bgcolor="#A6B658" |Caroline Nunn
| bgcolor="#BCD2EE" |TBA
| bgcolor="#BCD2EE" |T
|}
</center>

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"