Student Activities

Florida Section
The Mathematical Association of America

40th Annual Meeting ● Tallahassee Community College ● February 16-17, 2007

 

At the 2007 Joint Meetings of the Florida Section of the Mathematical Association of America and the Florida Two Year College Mathematics Association at Tallahassee Community College, the Florida Section of the MAA sponsored two contests, an integral contest and a sudoku contest.

The winner of the integral contest was Tram Ta from Miami Dade College. She won $50. The runner-up was Huong Marks from Manatee Community College, who won $25.

The sudoku contest winner was Megan Logue from Jacksonville University. The runner-up was Linda Segovia from Florida Atlantic University. Each received a book from the MAA.

Three students also presented talks at the meetings. Linda Segovia of Florida Atlantic University presented "Epidemic Models," Megan Logue of Jacksonville University presented "Minimum Coverings with Fish," and Mathew Williamson of the University of South Florida presented "Virtual Knots and the Kauffman-Harary Conjecture."

The pictures below show Daniel Jelsovsky, Coordinator of Student Activities, presenting awards to the winning students.

Integral Contest:


Tram Ta
Miami Dade College
Huong Marks
Manatee Community College

Sudoku Contest:


Megan Logue
(and Daniel Jelsovsky)
Jacksonville University
Linda Segovia
(and Daniel Jelsovsky)
Florida Atlantic University

Presentations:


Linda Segovia
Florida Atlantic University

Epidemic Models

Abstract:  Epidemic models have been used through out history in order to predict the outcome of an epidemic. I will give background on some simple epidemic models, and introduce a new model three colleagues and I created at the Applied Mathematics Science Summer Institute (AMSSI) during the summer of 2006. I will then show how this research project could be improved.
   

Megan Logue
Jacksonville University

Minimum Coverings with Fish

Abstract:  A minimum covering with fish of order n is an ordered trip (S,F,P) where F is a collection of edge disjoint fish that partition the edge set of the union of the complete graph Kn with vertex set S and P, the smallest subgraph of Kn that makes this possible. The objective of this project is to find a complete solution to the spectrum problem for minimum coverings with fish.
   

Mathew Williamson
University of South Florida

Virtual Knots and the Kauffman-Harary Conjecture

Abstract:  After a brief introduction to classical and virtual knot theory, the Kauffman-Harary Conjecture for classical knot colorings will be explained. My research deals with a virtualization of the Kauffman-Harary Conjecture, which will be explored after suitable background has been exposed.