TBD

SMMG – September 2016

Date: Saturday, September 10, 2016

Time: 10 AM – Noon

Location: RLM 4.102 (On the UT campus)

Speaker: Dr. Pedro Morales

Title: Fun with Fibonacci

Abstract: We are going to explore the famous Fibonacci sequence, which is 800 years old! We will survey its many arithmetic properties as well as its appearance in different places in nature and art.

TBD

SMC – September 2016

Date: Sunday, September 25, 2016

Time: 1 – 3 pm

Location: RLM 4.102 (On the UT campus)

Speaker: Roberta Guadagni

Title: AMC 8 Study Session

Abstract: We will consider interesting AMC 8 problems from the past and challenge students to work out more difficult ones on their own.

TBD

SMMG – October 2016

Date: Saturday, October 15, 2016

Time: 10 AM – noon

Location: RLM 4.102 (On the UT campus)

Speaker: Prof. Gordan Zitkovic

Title: The mathematics of voting

Abstract: This talk will examine several ways in which mathematics, sometimes quite unexpectedly, sheds light on voting, democracy and government. We will try to design a fair voting system, gerrymander a state and talk about polling.

Files:
Presentation

TBD

SMC – October 2016

Date: Sunday, October 30th, 2016

Time: 1 – 3 PM

Location: RLM 4.102 (On the UT campus)

Speaker: Sam Gunningham

Title:Symmetry: Shapes and patterns in the plane and in 3-space

Abstract: We will investigate the symmetry of geometric shapes and patterns, focusing on the remarkable case of the Platonic solids. This is a subject that has enthralled mathematicians since antiquity, and is at the heart of many important subjects in modern math and science (for example, the theory of molecular symmetry in chemistry, and the branch of mathematics called group theory).

TBD

SMMG – November 2016

Date: Saturday, November 5, 2016

Time: 10 AM – noon

Location: RLM 5.104 (On the UT campus)

Speaker: Chuwei Zhang

Title: Matching Problems, an Introduction to Induction

Abstract: We will consider two problems. For the first, suppose that there is a group of robots and a group of batteries. Each robot can be charged by a subset of the batteries (only some of them). Under what conditions is it possible for every robot to be charged by a battery? We will introduce the idea of induction to prove necessary and sufficient conditions for a complete matching of robots and batteries ("Hall's Marriage Theorem"). The second problem has a similar setting but has one more ingredient: that every robot has an order of preference among their compatible batteries. We ask are the matchings "stable?"

TBD

SMC – December 2016

Date: Sunday, December 11, 2016

Time: 1 – 3 PM

Location: RLM 4.102 (On the UT campus)

Speaker: Marjorie Drake

Title: Inductive Proof

Abstract: Induction is an important technique of mathematical proof that requires only an understanding of the integers and some intuition to grasp and utilize. We will discuss inductive proof and then students will practice the technique by proving something interesting about the sums of certain sequences, board games, the results of round robin tournaments, and more.