Madison Math Circle Abstracts: Difference between revisions

From DEV UW-Math Wiki
Jump to navigation Jump to search
 
(90 intermediate revisions by 6 users not shown)
Line 1: Line 1:
[[Image:logo.png|right|440px|link=https://www.math.wisc.edu/wiki/index.php/Madison_Math_Circle]]
[[Image:logo.png|right|440px|link=https://www.math.wisc.edu/wiki/index.php/Madison_Math_Circle]]


== August 6 2016  ==
[https://www.math.wisc.edu/wiki/index.php/Madison_Math_Circle Main Math Circle Page]
 
 
 
== September 18 2017 ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Science Saturday'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Daniel Erman'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: Game Busters'''
| bgcolor="#BDBDBD"  align="center" | '''Title: Welcome to the Madison Math Circle!'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
The goal of our station will be to explore the mathematics related to the games: Set, Nim, and Chomp. We will have stations where individuals can drop by play a few games and explore these games for themselves. (We will have worksheets and volunteers providing guidance.) Additionally, anyone will be able to challenge our Master of Nim with fun prizes available for beating them. (Note: This is at a special time and location.)
Abstract:  At the Madison Math Circle, we aim to give a flavor for the creative type of thinking that goes into mathematical research. In this week's interactive activity, students will explore questions related to Mobius strips, developing their own conjectures.
<ul>
<li> [https://www.math.wisc.edu/wiki/images/Chomp_Sol.pdf Solutions for Chomp] </li>
<li> [https://www.math.wisc.edu/wiki/images/Nim_sol.pdf Solutions for Nim] </li>
<li> [https://www.math.wisc.edu/wiki/images/Set_sol.pdf Solutions for Set].</li>
</ul>
|}                                                                         
|}                                                                         
</center>
</center>


== September 12 2016 ==
== September 25 2017 ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Jean-Luc Thiffeault'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Betsy Stovall'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: Why do my earbuds keep getting entangled?'''
| bgcolor="#BDBDBD"  align="center" | '''Title: Math is a game!'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
I'll discuss the mathematics of random entanglements.  Why is it that
When mathematicians are working to solve a theoretical problem, it often helps to imagine that we are playing a game:  What could our opponent do to make our job as difficult as possible, and what is our strategy to defeat them no matter what move they make?  In this session, we will try this out by playing several games and trying to come up with winning strategies. 
it's so easy for wires to get entangled, but so hard for them to
detangle?
|}                                                                         
|}                                                                         
</center>
</center>


== September 19 2016 ==
== October 2 2017 ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''DJ Bruce'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Rachel Davis'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: Is Any Knot Not the Unknot?'''
| bgcolor="#BDBDBD"  align="center" | '''Title: Thinking outside the box'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
You're walking home from school, and you pull out your head phones to listen to some tunes. However, inevitably they are a horribly tangled mess, but are they really a knot? We'll talk about what exactly is a knot, and how we can tell when something is not the unknot.
Abstract: We will try some geometric puzzles related to area, volume, and dimension using techniques such as drawing diagrams, looking at special cases, using symmetry, and changing perspective.
 
|}                                                                         
|}                                                                         
</center>
</center>


== September 26 2016 ==
== October 9 2017 ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Megan Maguire'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Solly Parenti'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: Coloring Maps'''
| bgcolor="#BDBDBD"  align="center" | '''Title: Hackenbush'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
Have you ever noticed that in colored maps of the US bordering states are never the same color? That's because it would be super confusing! But how many different colors do we need in order to avoid this? Come find out and learn more cool things about coloring maps.
Abstract: I come from an alien world where we spend all of our time playing a game called hackenbush.  I'd like to introduce y'all to this game so you don't embarass yourself if you come visit my planet.
|}                                                                         
|}                                                                         
</center>
</center>


== October 3 2016 ==
== October 16 2017 ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Zach Charles'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Mihaela Ifrim'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: 1 + 1 = 10, or How does my smartphone do anything?'''
| bgcolor="#BDBDBD"  align="center" | '''Title: Escape of the Clones!'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
Computers are used to do all kinds of complex tasks, from playing videos to running internet browsers. Secretly, computers do everything through numbers and mathematics. Surprisingly, they do all of this with "bits", numbers that are only 0 or 1. We will talk about bits and how we use them to do the mathematics we're familiar with as humans. If we have enough time, we will discuss "addition chains" and how computers use them to speed up their computations.
Abstract: We wish to find an invariant (an invariant is a quantity that doesn't change no matter how the process plays out). By playing couple of games will help us find some! The main game we will play is Escape of the Clones! Promise you will like it!
|}                                                                         
|}                                                                         
</center>
</center>


== October 10 2016 ==
== October 23 2017 ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Keith Rush'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Ryan Julian'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: Randomness, determinism and approximation: a historical question'''
| bgcolor="#BDBDBD"  align="center" | '''Title: Recursion for Fun and Profit'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
If you give me a function, can I find a simple function that approximates it well? This question played a central role in the development of mathematics. With a couple examples we will begin to investigate this for ourselves, and we'll touch on some interesting relationships to modeling random processes.
Abstract: Beginning with the classic Towers of Hanoi puzzle, we'll explore several puzzles whose solutions can often be found by thinking recursively.  We'll also discover how recursion and related methods of simplifying problems can be used to create efficient algorithms to solve a variety of practical problems.
|}                                                                       
</center>


== October 30 2017 ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''John Wiltshire-Gordon'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: Euler Characteristic'''
|-
| bgcolor="#BDBDBD"  | 
Abstract: The most important invariant associated to a collection of featureless points is their number, which can be found using a process called "counting".  We explain a generalization of counting that works for other, more interesting shapes.  For example, we will count a circle and a sphere.  We recall typical counting arguments, and try to apply them to shapes.
|}                                                                         
|}                                                                         
</center>
</center>


== October 17 2016 ==
== November 6 2017 ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Philip Wood'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Wanlin Li'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: The game of Criss-Cross'''
| bgcolor="#BDBDBD"  align="center" | '''Title: How to Outsmart a State Test?'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
Some say that mathematics is the science of patterns, and patterns are everywhereYou can find some remarkable patterns just by drawing lines connecting dots, and that is just what we will do in the game of Criss-Cross!  Bring your pencils and be ready to play.
Abstract: A common problem in a state test is given a sequence of numbers like 4, 9, 16, 25, 36... ask what the next number to expect. I used to dislike these problems up until a teacher taught me a cool trickIn this talk, I want to share this trick and discuss the math behind this.
|}                                                                       
</center>


== November 13 2017 ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker'''
|-Jean-Luc Thiffeault
| bgcolor="#BDBDBD"  align="center" | '''Title: Goldbug Variations'''
|-
| bgcolor="#BDBDBD"  | 
Abstract
I'll discuss the motion of little mathematical bugs: they hop around the positive integers, flipping direction arrows as they go.  How many such bugs drop off the line at -1, and how many escape to infinity?  Next, we tackle a similar problem in the plane, and discover beautiful geometrical patterns, known as Propp Circles.
|}                                                                         
|}                                                                         
</center>
</center>


== October 24 2016 ==
== November 20 2017 ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
Line 107: Line 130:
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Ethan Beihl'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Ethan Beihl'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: A Chocolate Bar for Every Real Number'''
| bgcolor="#BDBDBD"  align="center" | '''Title: Boomerang Sequences'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
By chopping up rectangles into squares repeatedly we obtain so-called "slicing diagrams" that correspond to every number. These diagrams have some very cool properties, and show up all over mathematics (under the name "continued fractions," which name we will investigate). Some questions I may ask you: Which chocolate bars look like themselves? Which chocolate bars look like themselves, except bigger? Which chocolate bars are interesting? Why did you come to a math talk expecting real chocolate?
I don't know what will happen in this talk. No, I don't mean that in the sense that math teachers often use, where they say "I don't know, why don't you try it!" but really secretly they know what's going to happen. I mean that in the most literal sense. I will introduce sequences of numbers that (sometimes) bounce back, and you will explore them, and I might learn something, because I don't know what will happen. We'll have a blast, and maybe we'll discover something that no-one ever has before.
|}                                                                         
|}                                                                         
</center>
</center>


== October 31 2016 ==
 
== February 5 2018 ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''No Meeting This Week'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Ben Wright'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: N/A'''
| bgcolor="#BDBDBD"  align="center" | '''Title: Mobius Band Magic'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
If you fold a loop of paper in half and cut it down the middle, how many loops of paper do you end up with? 2? Would you believe me if I said 1? How is this possible? A magician would never reveal the secret, but a mathematician will. We will learn to draw & construct loops & Mobius bands and explore their intrinsic & extrinsic properties.
|}                                                                       
</center>


Enjoy Halloween.
== February 12 2018 ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: TBD'''
|-
| bgcolor="#BDBDBD"  | 
Abstract
|}                                                                       
</center>
 
== February 19 2018 ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Brandon Boggess'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: Towers of Hanoi'''
|-
| bgcolor="#BDBDBD"  | 
An old legend tells of a mysterious temple located in Hanoi, Vietnam containing three pegs and 64 golden disks. Since the beginning of the world, priests have been moving these disks across the pegs according to rules handed down by an ancient prophecy. The legend states that when the final disk is placed, the world will come to an end. We will examine these rules and decide whether we should be worried by this legend.
|}                                                                       
</center>
 
== February 26 2018 ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Becky Eastham'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: No Pigeons Will Be Harmed During This Talk'''
|-
| bgcolor="#BDBDBD"  | 
The Pigeonhole Principle is the statement that if you have if you have (n) pigeonholes, and you want to stuff (n+1) pigeons into these holes, then one of the holes will have at least two pigeons in it (why mathematicians want to stuff pigeons into holes at all is a excellent question for another time).  While the Pigeonhole Principle might seem obvious, it can be used to prove things that are not at all obvious with relative ease!  We’ll explore how to use this simple fact to solve a variety of problems. 
|}                                                                       
</center>
 
== March 5 2018 ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Juliette Bruce'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: Doodling Dreams'''
|-
| bgcolor="#BDBDBD"  | 
As a high schooler I occasionally got bored, would zone out, and doodle on my paper. Often repeatedly tracing around something on my paper creating doodles like this:
<gallery widths=300px heights=150px mode="packed">
File:doodle.jpg
</gallery>
 
In this bored state my mind would often wandered, and I would wonder about important things like "Will I have a date for prom?" or "What is the cafeteria serving for lunch?", but germane to this talk were my wonderings about, "What’s happening to the shape of this doodle?" It turns out that these idle daydreams and doodles provide a good taste for how mathematicians "do" math. We will start by doodling and asking questions, and then we'll see where these lead us mathematically.
 
|}                                                                       
</center>
 
== March 12 2018 ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Solly Parenti'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: Tangled up in Two'''
|-
| bgcolor="#BDBDBD"  | 
Every tangled cord you have ever encountered is secretly a number.  Once you learn how to count these cords, cleaning your room will be as easy as 1-2-3.
|}                                                                       
</center>
 
== March 19 2018 ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Edwin Baeza'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: Mathematics and Sound Design'''
|-
| bgcolor="#BDBDBD"  | 
We'll learn about sound waves by hearing and seeing them in action. We'll start by seeing a different way to think about sound and how to manipulate it. With this new knowledge we can explore some elements of modern sound design.
 
|}                                                                       
</center>
 
== April 2 2018 ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Carrie Chen'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Help! Important data lost due to ink stains!'''
|-
| bgcolor="#BDBDBD"  | 
John and Mary have a [https://www.math.wisc.edu/wiki/images/Ledger.pdf ledger card] for office supplies, however their cat broke the ink bottle and got the card stained. Let’s help them recover those numbers with Chinese Remainder theorem!
|}                                                                         
|}                                                                         
</center>
</center>


== November 7 2016 ==
== April 9 2018 ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''TBD'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: TBD'''
| bgcolor="#BDBDBD"  align="center" | '''Title: TBD'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
Abstract
|}                                                                       
</center>
= Off-Site Meetings =
== October 2 2017 (East High School) ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker TBD'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title:  How to make it as a Hackenbush player in the planet Zubenelgenubi 4'''
|-
| bgcolor="#BDBDBD"  | 
Abstract: In the distant planet of Zubenelgenubi 4, we live our life without numbers. I know, how do we pass our time if we can't construct a smartphone without numbers? The answer is that we have invented an extremely violent sport about chopping down trees called Hackenbush, and playing this game is an essential social skill in Zubenelgenubi 4. I will teach you how to play the pen and paper version of Hackenbush, and hint at how learning this game leads to a kind of math that is highly illegal in 254,233 planetary systems.


TBD
|}                                                                         
|}                                                                         
</center>
</center>


== November 14 2016 ==
== November 2 2017 (WID) - 1 ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''TBD'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker: Alisha Zacharia'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: TBD'''
| bgcolor="#BDBDBD"  align="center" | '''Title: Fractals, Fractions and Fibonnaci.'''
|-
| bgcolor="#BDBDBD"  | 
Abstract: Let’s go on a history tour! We’ll visit some math objects that intrigued generations of mathematicians and explore connections between them. We'll observe something that happens a lot in modern mathematics: discovering connections among seemingly unrelated things! Through this talk I hope to introduce you to how vital it is for mathematicians today to be able to effectively communicate with and teach each other even if they work in very different branches of mathematics.
 
|}                                                                       
</center>
 
== November 2 2017 (WID) - 2 ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker: Zach Charles'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title:  1+1 = 10 or "How does my computer do anything?"'''
|-
| bgcolor="#BDBDBD"  | 
Abstract: Computers perform all sorts of complex tasks, from playing videos to running internet browsers. Secretly, computers do everything through numbers and mathematics. Even weirder, they do all of this with "bits", numbers that are only 0 or 1. We will talk about bits and how we use them to do the mathematics we're familiar with as humans. If we have enough time, we will discuss "addition chains" and how computers use them to speed up their computations.
 
|}                                                                       
</center>
 
== November 2 2017 (Whitewater) ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker: Juliette Bruce'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title:  Doodling Daydreams'''
|-
| bgcolor="#BDBDBD"  | 
Abstract: As a high schooler I occasionally got bored, would zone out, and doodle on my paper. Often repeatedly tracing around something on my paper creating doodles like this:
<gallery widths=300px heights=150px mode="packed">
File:doodle.jpg
</gallery>
 
In this bored state my mind would often wandered, and I would wonder about important things like "Will I have a date for prom?" or "What is the cafeteria serving for lunch?", but germane to this talk were my wonderings about, "What’s happening to the shape of this doodle?" It turns out that these idle daydreams and doodles provide a good taste for how mathematicians "do" math. We will start by doodling and asking questions, and then we'll see where these lead us mathematically.
 
|}                                                                       
</center>
 
== November 3 2017 (KM Global) ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker: Betsy Stoval'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title:  Recent discoveries in mathematics'''
|-
| bgcolor="#BDBDBD"  | 
Abstract: So much wonderful and useful mathematics was discovered centuries ago that it can seem as though we must know everything by now.  To the contrary, thousands of research mathematicians around the world are working to develop new mathematical theories every day.  I will talk about some exciting recent discoveries in math and some tantalizing unsolved problems.  To make matters more concrete, students will develop a solution to the Erdős Discrepancy Problem, which was only completely solved in 2015, in a simple case.
 
|}                                                                       
</center>
 
== November 27 2017 (JMM High School) ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker: Juliette Bruce'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title:  Is any knot not the unknot'''
|-
| bgcolor="#BDBDBD"  | 
Abstract:
You're walking home from school, and you pull your headphones out to listen to some tunes. However, inevitably they are a horribly tangled mess, but are they really a knot? We'll talk about what exactly is a knot, and how we can tell when something is not the unknot.
|}                                                                       
</center>
 
 
 
== December 11 2017 (East High School) ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker: John Wiltshire-Gordon'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title:  What if seven is zero?'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
Abstract: We take as axiomatic the usual laws of arithmetic, along with a new law: 7=0. Evidently, this new law challenges certain widespread intuitions about numbers. Will all of mathematics crumble?
|}                                                                       
</center>


TBD
 
== February 19 2018 (East High School) ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker: Jordan Ellenberg'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title:  Is math destroying the right to vote?'''
|-
| bgcolor="#BDBDBD"  | 
Abstract: The Supreme Court is deciding whether or not Wisconsin’s way of electing the State Assembly violates the Constitution by depriving Wisconsinites of their right to representation.  The key issues in this case are really about math, and how legislators armed with powerful algorithms can design electoral districts so that they choose the voters, rather than the voters choosing them.  On the other hand, we can use math to find unfairness in maps and suggest better ones — I’ll talk a little bit about how.
|}                                                                         
|}                                                                         
</center>
</center>


== November 21 2016 ==
== March 1 2018 (WID) - 1 ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''TBD'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker: Wanlin Li'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: TBD'''
| bgcolor="#BDBDBD"  align="center" | '''Title: From Patterns to Functions?'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
What is a pattern? What's the next number in the sequence 1,2,3,4,5? What about 1,4,9,16,25? Why that number? In this talk we'll talk about how to find the next number in many sequences, and where it comes from. In addition we'll consider the relations between functions an patterns.


TBD
|}                                                                         
|}                                                                         
</center>
</center>


= High School Meetings =
== March 1 2018 (WID) - 2 ==
== October 17 2016 (JMM) ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Daniel Erman'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker: Daniel Erman'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title: What does math research look like?'''
| bgcolor="#BDBDBD"  align="center" | '''Title: What does math research look like?'''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
Using a concrete problem in combinatorics, I will try to give a feel for what math research looks like.  We’ll discuss the various aspects of research including:  gathering data, making conjectures, proving special cases, and asking new questions.
I’ll try to illustrate the type of thinking that goes in math research by having us all dive into a famous historical problem.


|}                                                                         
|}                                                                         
</center>
</center>


== October 24 2016 (West) ==
== March 5 2018 (JMM High School) ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''DJ Bruce'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker: Zach Charles'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title:  TBD'''
| bgcolor="#BDBDBD"  align="center" | '''Title:  1+1 = 10 or "How does my computer do anything?" '''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
TBD
Computers perform all sorts of complex tasks, from playing videos to running internet browsers. Secretly, computers do everything through numbers and mathematics. Even weirder, they do all of this with "bits", numbers that are only 0 or 1. We will talk about bits and how we use them to do the mathematics we're familiar with as humans. If we have enough time, we will discuss "addition chains" and how computers use them to speed up their computations.


|}                                                                         
|}                                                                         
</center>
</center>


== October 24 2016 (East)==
== March 19 2018 (East High School) ==
<center>
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''TBD'''
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker: Phil Wood'''
|-
|-
| bgcolor="#BDBDBD"  align="center" | '''Title:  TBD'''
| bgcolor="#BDBDBD"  align="center" | '''Title:  The Mathematics of Winning Strategies '''
|-
|-
| bgcolor="#BDBDBD"  |   
| bgcolor="#BDBDBD"  |   
TBD
Strategies are everywhere: how a business decides to deploy resources, how a school district decides on a curriculum plan, how a student decides which material to study for a test.  In this Math Circle, we will discuss how mathematical ideas can inform strategies, focusing on simple games where perfect analysis of strategies is possible.
|}                                                                       
</center>


== April 30 2018 (JMM High School) ==
<center>
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
| bgcolor="#e8b2b2" align="center" style="font-size:125%" | '''Speaker: Juliette Bruce'''
|-
| bgcolor="#BDBDBD"  align="center" | '''Title:  From Books to Mars'''
|-
| bgcolor="#BDBDBD"  | 
I will discuss ways to cleverly send a message so that even if part of the message is lost, the entire message can be recovered.
|}                                                                         
|}                                                                         
</center>
</center>

Latest revision as of 18:48, 26 April 2018

Logo.png

Main Math Circle Page


September 18 2017

Daniel Erman
Title: Welcome to the Madison Math Circle!

Abstract: At the Madison Math Circle, we aim to give a flavor for the creative type of thinking that goes into mathematical research. In this week's interactive activity, students will explore questions related to Mobius strips, developing their own conjectures.

September 25 2017

Betsy Stovall
Title: Math is a game!

When mathematicians are working to solve a theoretical problem, it often helps to imagine that we are playing a game: What could our opponent do to make our job as difficult as possible, and what is our strategy to defeat them no matter what move they make? In this session, we will try this out by playing several games and trying to come up with winning strategies.

October 2 2017

Rachel Davis
Title: Thinking outside the box

Abstract: We will try some geometric puzzles related to area, volume, and dimension using techniques such as drawing diagrams, looking at special cases, using symmetry, and changing perspective.

October 9 2017

Solly Parenti
Title: Hackenbush

Abstract: I come from an alien world where we spend all of our time playing a game called hackenbush. I'd like to introduce y'all to this game so you don't embarass yourself if you come visit my planet.

October 16 2017

Mihaela Ifrim
Title: Escape of the Clones!

Abstract: We wish to find an invariant (an invariant is a quantity that doesn't change no matter how the process plays out). By playing couple of games will help us find some! The main game we will play is Escape of the Clones! Promise you will like it!

October 23 2017

Ryan Julian
Title: Recursion for Fun and Profit

Abstract: Beginning with the classic Towers of Hanoi puzzle, we'll explore several puzzles whose solutions can often be found by thinking recursively. We'll also discover how recursion and related methods of simplifying problems can be used to create efficient algorithms to solve a variety of practical problems.

October 30 2017

John Wiltshire-Gordon
Title: Euler Characteristic

Abstract: The most important invariant associated to a collection of featureless points is their number, which can be found using a process called "counting". We explain a generalization of counting that works for other, more interesting shapes. For example, we will count a circle and a sphere. We recall typical counting arguments, and try to apply them to shapes.

November 6 2017

Wanlin Li
Title: How to Outsmart a State Test?

Abstract: A common problem in a state test is given a sequence of numbers like 4, 9, 16, 25, 36... ask what the next number to expect. I used to dislike these problems up until a teacher taught me a cool trick. In this talk, I want to share this trick and discuss the math behind this.

November 13 2017

Speaker
Title: Goldbug Variations

Abstract

I'll discuss the motion of little mathematical bugs: they hop around the positive integers, flipping direction arrows as they go.  How many such bugs drop off the line at -1, and how many escape to infinity?  Next, we tackle a similar problem in the plane, and discover beautiful geometrical patterns, known as Propp Circles.

November 20 2017

Ethan Beihl
Title: Boomerang Sequences

I don't know what will happen in this talk. No, I don't mean that in the sense that math teachers often use, where they say "I don't know, why don't you try it!" but really secretly they know what's going to happen. I mean that in the most literal sense. I will introduce sequences of numbers that (sometimes) bounce back, and you will explore them, and I might learn something, because I don't know what will happen. We'll have a blast, and maybe we'll discover something that no-one ever has before.


February 5 2018

Ben Wright
Title: Mobius Band Magic

If you fold a loop of paper in half and cut it down the middle, how many loops of paper do you end up with? 2? Would you believe me if I said 1? How is this possible? A magician would never reveal the secret, but a mathematician will. We will learn to draw & construct loops & Mobius bands and explore their intrinsic & extrinsic properties.

February 12 2018

Speaker
Title: TBD

Abstract

February 19 2018

Brandon Boggess
Title: Towers of Hanoi

An old legend tells of a mysterious temple located in Hanoi, Vietnam containing three pegs and 64 golden disks. Since the beginning of the world, priests have been moving these disks across the pegs according to rules handed down by an ancient prophecy. The legend states that when the final disk is placed, the world will come to an end. We will examine these rules and decide whether we should be worried by this legend.

February 26 2018

Becky Eastham
Title: No Pigeons Will Be Harmed During This Talk

The Pigeonhole Principle is the statement that if you have if you have (n) pigeonholes, and you want to stuff (n+1) pigeons into these holes, then one of the holes will have at least two pigeons in it (why mathematicians want to stuff pigeons into holes at all is a excellent question for another time). While the Pigeonhole Principle might seem obvious, it can be used to prove things that are not at all obvious with relative ease! We’ll explore how to use this simple fact to solve a variety of problems.

March 5 2018

Juliette Bruce
Title: Doodling Dreams

As a high schooler I occasionally got bored, would zone out, and doodle on my paper. Often repeatedly tracing around something on my paper creating doodles like this:

In this bored state my mind would often wandered, and I would wonder about important things like "Will I have a date for prom?" or "What is the cafeteria serving for lunch?", but germane to this talk were my wonderings about, "What’s happening to the shape of this doodle?" It turns out that these idle daydreams and doodles provide a good taste for how mathematicians "do" math. We will start by doodling and asking questions, and then we'll see where these lead us mathematically.

March 12 2018

Solly Parenti
Title: Tangled up in Two

Every tangled cord you have ever encountered is secretly a number. Once you learn how to count these cords, cleaning your room will be as easy as 1-2-3.

March 19 2018

Edwin Baeza
Title: Mathematics and Sound Design

We'll learn about sound waves by hearing and seeing them in action. We'll start by seeing a different way to think about sound and how to manipulate it. With this new knowledge we can explore some elements of modern sound design.

April 2 2018

Carrie Chen
Help! Important data lost due to ink stains!

John and Mary have a ledger card for office supplies, however their cat broke the ink bottle and got the card stained. Let’s help them recover those numbers with Chinese Remainder theorem!

April 9 2018

Speaker
Title: TBD

Abstract


Off-Site Meetings

October 2 2017 (East High School)

Speaker TBD
Title: How to make it as a Hackenbush player in the planet Zubenelgenubi 4

Abstract: In the distant planet of Zubenelgenubi 4, we live our life without numbers. I know, how do we pass our time if we can't construct a smartphone without numbers? The answer is that we have invented an extremely violent sport about chopping down trees called Hackenbush, and playing this game is an essential social skill in Zubenelgenubi 4. I will teach you how to play the pen and paper version of Hackenbush, and hint at how learning this game leads to a kind of math that is highly illegal in 254,233 planetary systems.

November 2 2017 (WID) - 1

Speaker: Alisha Zacharia
Title: Fractals, Fractions and Fibonnaci.

Abstract: Let’s go on a history tour! We’ll visit some math objects that intrigued generations of mathematicians and explore connections between them. We'll observe something that happens a lot in modern mathematics: discovering connections among seemingly unrelated things! Through this talk I hope to introduce you to how vital it is for mathematicians today to be able to effectively communicate with and teach each other even if they work in very different branches of mathematics.

November 2 2017 (WID) - 2

Speaker: Zach Charles
Title: 1+1 = 10 or "How does my computer do anything?"

Abstract: Computers perform all sorts of complex tasks, from playing videos to running internet browsers. Secretly, computers do everything through numbers and mathematics. Even weirder, they do all of this with "bits", numbers that are only 0 or 1. We will talk about bits and how we use them to do the mathematics we're familiar with as humans. If we have enough time, we will discuss "addition chains" and how computers use them to speed up their computations.

November 2 2017 (Whitewater)

Speaker: Juliette Bruce
Title: Doodling Daydreams

Abstract: As a high schooler I occasionally got bored, would zone out, and doodle on my paper. Often repeatedly tracing around something on my paper creating doodles like this:

In this bored state my mind would often wandered, and I would wonder about important things like "Will I have a date for prom?" or "What is the cafeteria serving for lunch?", but germane to this talk were my wonderings about, "What’s happening to the shape of this doodle?" It turns out that these idle daydreams and doodles provide a good taste for how mathematicians "do" math. We will start by doodling and asking questions, and then we'll see where these lead us mathematically.

November 3 2017 (KM Global)

Speaker: Betsy Stoval
Title: Recent discoveries in mathematics

Abstract: So much wonderful and useful mathematics was discovered centuries ago that it can seem as though we must know everything by now. To the contrary, thousands of research mathematicians around the world are working to develop new mathematical theories every day. I will talk about some exciting recent discoveries in math and some tantalizing unsolved problems. To make matters more concrete, students will develop a solution to the Erdős Discrepancy Problem, which was only completely solved in 2015, in a simple case.

November 27 2017 (JMM High School)

Speaker: Juliette Bruce
Title: Is any knot not the unknot

Abstract: You're walking home from school, and you pull your headphones out to listen to some tunes. However, inevitably they are a horribly tangled mess, but are they really a knot? We'll talk about what exactly is a knot, and how we can tell when something is not the unknot.


December 11 2017 (East High School)

Speaker: John Wiltshire-Gordon
Title: What if seven is zero?

Abstract: We take as axiomatic the usual laws of arithmetic, along with a new law: 7=0. Evidently, this new law challenges certain widespread intuitions about numbers. Will all of mathematics crumble?


February 19 2018 (East High School)

Speaker: Jordan Ellenberg
Title: Is math destroying the right to vote?

Abstract: The Supreme Court is deciding whether or not Wisconsin’s way of electing the State Assembly violates the Constitution by depriving Wisconsinites of their right to representation. The key issues in this case are really about math, and how legislators armed with powerful algorithms can design electoral districts so that they choose the voters, rather than the voters choosing them. On the other hand, we can use math to find unfairness in maps and suggest better ones — I’ll talk a little bit about how.

March 1 2018 (WID) - 1

Speaker: Wanlin Li
Title: From Patterns to Functions?

What is a pattern? What's the next number in the sequence 1,2,3,4,5? What about 1,4,9,16,25? Why that number? In this talk we'll talk about how to find the next number in many sequences, and where it comes from. In addition we'll consider the relations between functions an patterns.

March 1 2018 (WID) - 2

Speaker: Daniel Erman
Title: What does math research look like?

I’ll try to illustrate the type of thinking that goes in math research by having us all dive into a famous historical problem.

March 5 2018 (JMM High School)

Speaker: Zach Charles
Title: 1+1 = 10 or "How does my computer do anything?"

Computers perform all sorts of complex tasks, from playing videos to running internet browsers. Secretly, computers do everything through numbers and mathematics. Even weirder, they do all of this with "bits", numbers that are only 0 or 1. We will talk about bits and how we use them to do the mathematics we're familiar with as humans. If we have enough time, we will discuss "addition chains" and how computers use them to speed up their computations.

March 19 2018 (East High School)

Speaker: Phil Wood
Title: The Mathematics of Winning Strategies

Strategies are everywhere: how a business decides to deploy resources, how a school district decides on a curriculum plan, how a student decides which material to study for a test. In this Math Circle, we will discuss how mathematical ideas can inform strategies, focusing on simple games where perfect analysis of strategies is possible.

April 30 2018 (JMM High School)

Speaker: Juliette Bruce
Title: From Books to Mars

I will discuss ways to cleverly send a message so that even if part of the message is lost, the entire message can be recovered.