| Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday |
|---|---|---|---|---|---|---|
| 30 | 1 | 2 | 3 | 4 | 5 | 6 |
| ||||||
| 7 | 8 | 9 | 10 | 11 | 12 | 13 |
| ||||||
| 14 | 15 | 16 | 17 | 18 | 19 | 20 |
| ||||||
| 21 | 22 | 23 | 24 | 25 | 26 | 27 |
| 28 | 29 | 30 | 31 | 1 | 2 | 3 |
-
7/5 Summer Talk Series - Traveling salesman, square packings, and crumpled paper - Matthew Badger
Summer Talk Series - Traveling salesman, square packings, and crumpled paper - Matthew Badger
Friday, July 5th, 202412:20 PM - 1:10 PM Monteith BuildingGiven an infinite list of cities, how can you (a salesman) decide whether or not it is it possible to travel to each of the cities in finite time (at constant speed)? I will discuss Peter Jones’s solution to the 1d traveling salesman problem and how ideas from combinatorics shed light on the 2d traveling salesman problem. This is joint work with Raanan Schul.
Contact Information: More
-
7/12 Summer Talk Series - Introduction to Knot Theory : From Coloring to Homology - Katie Hall
Summer Talk Series - Introduction to Knot Theory : From Coloring to Homology - Katie Hall
Friday, July 12th, 202412:20 PM - 1:10 PM Monteith BuildingMathematical knots are just like knots in string, but after tying the knot we attach the two free ends to form a closed loop. Given two of these knots, we can ask if you can move the strands around to make the knots look like each other. There are ways to obtain mathematical objects called knot invariants from knots or diagrams of the knots. These invariants help us determine whether it is possible to make one knot look like another one.In this talk, we will explore different knot invariants starting with coloring and moving through mathematical objects like polynomials and sequences and end with homology. We will learn how to calculate some invariants of basic knots, see why we need more complicated invariants and see what these invariants might tell us about a knot’s properties.Contact Information: More
-
7/19 Summer Talk Series - Fourier Transform: fast and furious - Anastasiia Minenkova (University of Hartford)
Summer Talk Series - Fourier Transform: fast and furious - Anastasiia Minenkova (University of Hartford)
Friday, July 19th, 202412:20 PM - 1:10 PM Monteith BuildingWe are going to talk about Fourier transform: continuous and discrete, fun and amazing; to discover (or rediscover) its properties for ourselves; and to demonstrate some pretty cool applications, like the fast Fourier transform algorithm.
Contact Information: More