REU 1999

Sponsored by the National Science Foundation

Participants

• Jennifer A. Arute, Huntingdon College, Alabama
• Brian D. Beavers, Louisiana Tech, Louisiana
• Jennifer B. Clem, Birmingham-Southern College, Alabama
• Kimberly A. Genung, Lagrange College, Georgia
• Robert R. Rubalcaba, San Diego State University, California
• Richard Russo, University of Central Florida, Florida
• Arthur D. Szlam, Emory University, Georgia

Students and Faculty, REU in Algebra and Discrete Mathematics
June 21 - August 13, 1999

REU Lecturers

• Professor Overtoun Jenda, Abstract Algebra
• Professor Pete Johnson, Discrete Mathematics
• Professor Doug Leonard, Groebner Bases and Computer Algebra
• Professor and Head, Kevin Phelps, Coding Theory

REU Speakers

• Professor Elizabeth Billington, University of Queensland, Australia, Graph decompositions
• Mike Daven, PhD candidate, Graph Connectivity
• Michelle Foster, PhD candidate, Probabilistic finite state source automata
• Professor Greg Harris, Transform methods in image compression
• Professor Dean Hoffman, Matchings and games
• Tammy Jenkins, Gradutae student, Coding Theory
• Selda Kucukcifci, PhD candidate, Cycle decompositions
• Mark Liatti, PhD candidate, Decomposing lambda-fold complete bipartite graphs into smaller complete bipartite graphs
• Professor Curt Lindner, Distinguished University Professor, Steiner triple systems
• Ken Roblee, PhD candidate, Turan's theorem and extremal graph theory
• Professor Chris Rodger, Edge-colorings and scheduling
• Professor Luc Teirlinck, Finite geometry
• Professor Evan Wantland, Auburn Alumnus, Western Montana College of the University of Montana, Decomposing complete graphs into edge-disjoint r-factors

Participants' Research Topics

• Circular chromatic numbers of finite simple graphs (Robert Rubalcaba)
• Classifications of strongly regular graphs (Richard Russo)
• Euclidean Ramsey problems (Arthur Szlam)
• Finite noncommutative and nonassociative systems (Robert Rubalcaba)
• Numerical semigroups and Frobenius numbers (Jennifer Clem, Richard Russo)
• Probabilistic finite state source automata (Jennifer Arute)
• Ruler problems (Brian Beavers, Kimberly Genung)
• Self-referentially derived sequences (Brian Beavers, Kimberly Genung)
• Steiner networks (Jennifer Arute)

Robert Rubalcaba, a student participant, presenting a seminar