This file can be used to add scheduled events to your calendar, however every program is unique. Below you will find what information is available, but if nothing else works try creating a new calendar in your program and using
http://math.colorado.edu/seminars/ics/club.ics
as the source.
Thunderbird
Math Club is a seminar centered around the undergraduate students to foster interactions between the students and faculty, and to expose the students to the fascinating world of mathematics that goes beyond the classroom. The seminar is organized by Rebekah Jones. For more info about our events this semester, visit the Math Club website. Email Rebekah Jones at rebekah.jones-1@colorado.edu to be added to the Math Club email list.
Tue, Jan. 27 5pm (Math 350)
Siddhant Agrawal
X
The Navier Stokes equation is a partial differential equation that describes the motion of viscous fluids. It arises naturally in engineering and other scientific fields. In this talk, we'll derive the Navier Stokes equation and discuss some of its basic properties. We'll also discuss the famous Millennium Prize Problem concerning the Navier Stokes equation. Note: The recommended prerequisite for this talk is Calculus 3, but all are welcome!
Come hear about the math department's summer REU program! REU stands for Research Experiences for Undergrads. Our summer REU program is an opportunity for you to gain experience and see what math research is like. Once available, descriptions of the different projects will be posted at www.colorado.edu/math/undergraduate-program/summer-research-undergraduate. Or come to the info session to hear about the projects and get your questions answered!
Summer REU Info Session
Tue, Feb. 17 5pm (Math 350)
Edouard Heitzmann
X
The legal standard set in Rucho v Common Cause puts the onus on the plaintiffs in a Voting Rights Act (VRA) case to demonstrate that a map is a racial rather than a partisan gerrymander in order for it to be struck down as unlawful. This means plaintiffs have to 'do the homework' of the defendants for them: they must produce a map that is at least as politically gerrymandered as the defendants drew, while achieving better racial representation outcomes. This standard was successfully met by a group of mathematicians in the El Paso redistricting case, winning in federal court before the Supreme Court shadow docket put a hold on the decision, allowing the racial gerrymander to go through. The mathematicians who accomplished this used Monte Carlo Markov Chain (MCMC) methods to draw a so-called 'ensemble' of millions of alternative congressional maps for Texas, and used statistical methods to show that the enacted map was an outlier for racial representation among the maps that had similar partisan outcomes. In this talk I will go over these mathematical details, as well as describe the computational tools currently used in this field. Note: If you have a working Jupyter Notebook installation, you are encouraged to bring it to the talk, as you will have the opportunity to follow along the computational demos included in the talk.
The Mathematics of Redistricting—what they did in Texas