#### Academics: Majors and Programs

# Spelman Mathematics Colloquium Series

All colloquia presentations take place on **Mondays **from **4:30 - 5:30 p.m. **in **Tapley 130** unless otherwise noted.

## 2017 Schedule

**Feb. 6: **Hidden Figures: My Role as a Math Consultant for this Film

**Rudy Horne, Morehouse College
**We will discuss the lives and contributions that NASA mathematician Katherine Johnson and the NASA engineers Mary Jackson and Dorothy Vaughan made to the space race. In particular, their work as concerns John Glenn’s orbit around the Earth in 1962 and the moon missions.

**Feb. 13: **Central Limit Theorem

**Bhikari Tharu, Spelman College
**We will discuss the Central Limit Theorem and visualize its applicability through examples.

**Feb. 20: **Who Says *e* and *π* are Irrational?

**Jeffrey Ehme, Spelman College
**Many people know

*e*and

*π*are irrational numbers, but few have ever seen a proof. Using Calculus, we will fill this educational hole.

**Feb. 27: **Optimization in Nonlinear Models of Cancer Immunotherapy

**Shelby Wilson, Morehouse College
**We will discuss mathematical models used to study the immune system and its interaction with cancer. More specifically, we will cover both analytic and heuristic techniques used to propose treatment protocols that optimize the effectiveness of cancer immunotherapies.

**Mar. 6: **Everything is Connected

**Megan Cream, Spelman College
**An introduction to the applied field of Network Science- the study of connections and interactions. We will explore what it is, how it is used, and how we are constantly surrounded by it.

**Mar. 13: **SPRING BREAK

**Mar. 20: **Topological Degree in Finite-Dimensional Spaces and Some Applications

**Dhurba Adhikari, Kennesaw State University
**The talk will begin with an introduction to the topological degree theory in finite-dimensional spaces. Applications to the fundamental theorem
of algebra and to some differential equations arising from ecology for the existence of equilibria will be discussed.

**Mar. 27:** The Inscribed Polygonal Functions

**Torina Lewis, Clark Atlanta University**

Using a similar type of analysis to explicitly
define the circular functions, we discuss The Inscribed Polygonal Functions. These functions are
regular polygons inscribed on a unit circle.

**Apr. 3: **Computational complexity and coloring graphs

**Victor Larsen, Kennesaw State University**

Coloring graphs is difficult and, in
particular, is a computationally hard problem (look up the history of the Four Color Theorem!). We
will explore the topic of computational complexity, with a focus on a particular coloring variation
called color-blind coloring**
**

**Contact Us**

**Mathematics**

404-270-5833**
**Science Center

Additional Contact Info