For Bright And Gifted Pre-College Students
July 2 - August 10, 2012
Program Announcement
The Institute provides an opportunity for bright and gifted pre-college
students to interact with university faculty and each other, to take
some challenging math classes that earn college credit, and have fun in
an academic atmosphere. Check with the Institute
PHILOSOPHY.
Students take two 4-credit COURSES in mathematics or statistics taught by full-time doctoral-holding FACULTY .
The Summer Mathematics Institute at Oakland University is FREE to all participants.
The Summer Mathematics Institute at Oakland University is a day camp. Check with the SCHEDULE.
Completed applications will be given full consideration if received by May 15, 2012. Refer to ADMISSION policy and APPLICATION MATERIALS (including problem set). Brochure in pdf format available here. Flyer in pdf format available here.
The Distinguished Colloquium Speaker: Doron Zeilberger, Board of Governors Professor, Rutgers University
Further information is available from:
Professor Eddie Cheng, Director
Summer Mathematics Institute
Department of Mathematics and Statistics
Oakland University
Rochester, MI 48309 - 4485
e-mail:
echeng@oakland.edu
Phone: (248) 370-4024; FAX: ( 248) 370 - 4184
The Institute Director and Instructor :
Dr. Eddie Cheng is Distinguished Professor of Mathematics in the Department of Mathematics and Statistics at Oakland University.
He joined the faculty of Oakland University in 1997. He graduated with a
B.Sc. (Hons.) from Memorial University of Newfoundland (Canada) in
1988. During the summer of 1988, he worked as a research assistant in
the Department of National Defence in British Columbia. For his graduate
studies, he earned his M.Math. in 1990 and Ph.D. in Combinatorics and
Optimization from the University of Waterloo (Canada) in 1995. From 1995
to 1997, he was a Natural Sciences and Engineering Research Council of
Canada Postdoctoral Fellow and part-time lecturer in the George R. Brown
School of Engineering at Rice University. He was the Director of the
Michigan Mathematics Prize Competition (MMPC) from 2005 to 2008. He is
currently a member of the examination committee of MMPC, a position that
he held previously from 2001 to 2005. MMPC is a state-wide competition
given every year to thousands of high school students in Michigan. He is
also a member of the editorial board and an associate editor of the
journal Networks. Networks publishes material on the modelling of
problems using networks, the analysis of network problems, the design
of computationally efficient network algorithms, and innovative case
studies of successful network applications. His research interests
include combinatorial optimization, integer programming and network
analysis. He has authored and coauthored about 90 research papers.
Professor Cheng has directed a number of high school students for
projects that advanced to semifinals and beyond in national competitions
such as Siemens Competitions and the Intel Science Talent Search. Many
of these projects resulted in publications in refereed journals. He is
the recipient of the 2007 Mathematical Association of America (Michigan
Section) Distinguished Teaching Award and a recipient of the 2009
Professor of the Year Award from the Presidents Council, State
Universities of Michigan.
The Institute Instructor :
Dr. László Lipták
is an Associate Professor in the Department
of Mathematics and Statistics at Oakland
University. He joined the faculty of Oakland University in 2003. He
participated in mathematical competitions starting from grade 3, and
represented his native country, Hungary, in two of the International
Mathematical Olympiads, in 1986 (Warsaw, Poland) and 1987 (Havana,
Cuba), receiving silver and bronze medals, respectively. He graduated
with a B.S. from the University of Szeged, Hungary with honors in 1993,
and received his Ph.D. in mathematics from Yale University in 1999. He
was a Postdoctoral Fellow first at the Fields Institute in Toronto,
Canada during 1999-2000, then at the University of Waterloo, Canada
during 2000-2003. His research interests include combinatorial
optimization, lifting-projecting methods, the stable set polytope, and
interconnection networks. He has authored and coauthored about 40
research papers.