|Atlanta Lecture Series in Combinatorics and Graph Theory VII|
|Published Date: 2012-10-22|
Atlanta Lecture Series in Combinatorics and Graph Theory VII
November 3-4, 2012
Emory University, Atlanta, GA, 30322
Emory University, Georgia Tech and Georgia State University, with support from the National Security Agency and the National Science Foundation, will host a series of 9 mini-conferences from 2010-2013. The 7th of these mini-conferences will be held at Emory University on November 3-4, 2012. The conferences will stress a variety of areas and feature one prominent researcher giving 2 fifty minute lectures and 4 outstanding researchers each giving one fifty minute lecture. There will also be several 25 minute lecturers by younger reseachers or graduate students.
Click here for more information.
|AWM announces Raman Parimala 2013 Noether Lecturer|
|Published Date: 2012-10-16|
The Association for Women in Mathematics (AWM) is pleased to announce that Raman Parimala will deliver the Noether Lecture at the 2013 Joint Mathematics Meetings. The full press release can be found here
|Vojtech Rödl and Mathias Schacht to be awarded the SIAM 2012 George Pólya Prize.|
|Published Date: 2012-04-30|
The Society for Industrial and Applied Mathematics [SIAM] established the George Pólya Prize in 1969 and awards it every two years, alternately in two categories: combinatorial theory and in another research area represented in the wide range of interests of Professor Pólya. In a career that included positions at ETH Zürich and Stanford University, Pólya made important contributions in number theory, analysis, geometry, algebra, probability and combinatorics, and to our understanding of how mathematicians solve problems, and how this skill can be taught.
In 2012, the award will go to Vojtech Rödl, Emory University, and Mathias Schacht, University of Hamburg, for their seminal research in combinatorics on the regularity method for hypergraphs. Their work, contained in several articles, is the culmination of a research program initiated by Professor Rödl more than 20 years ago. The award will be given at the SIAM Annual Meeting in Minneapolis this July. In addition to the important recognition afforded by the prize, it includes a $20,000 award, to be split by the winners. A description of the SIAM George Pólya Prize and a list of winners, including many of the leading combinatorialists of the last 4 decades, can be found at:
The announcement of the 2012 winners can be found at the SIAM Annual Meeting site:
Congratulations, Vojtech and Mathias!
|Michele Benzi elected SIAM Fellow|
|Published Date: 2012-04-03|
Michele Benzi, Professor of Mathematics and Computer Science, has been elected a Fellow (Class of 2012) by the Society for Industrial and Applied Mathematics "for contributions to numerical linear algebra and its applications, especially sparse linear systems and preconditioning." The SIAM Fellows program was established in 2008 "to designate as Fellows of the Society certain members who have made outstanding contributions to fields served by SIAM." The Class of 2012 consists of 35 individuals. For the full list of 2012 SIAM Fellows, click here: http://fellows.siam.org/index.php?sort=year&value=2012
|Department faculty caught in media frenzy|
|Published Date: 2012-03-31|
Professors Aaron Abrams and Skip Garibaldi appeared in various news outlets last week, including 20/20 (7 million viewers), CNN Newsroom, and ABC World News on television and NPR's All Things Considered and the BBC Newshour on radio. They were in demand as mathematicians who are experts on the lottery, thanks to their prize-winning paper Finding good bets in the lottery, and why you shouldn't take them, which was recently featured in the book Brain Trust.
Check out Skip Garibaldi on ABC News and Aaron Abrams on CNN.
|Eugene Agichtein receives Sloan Foundation Fellowship|
|Published Date: 2012-02-21|
Eugene Agichtein, Assistant Professor of Mathematics and Computer Science, has been awarded a 2012 Sloan Foundation Fellowship. The Sloan Research Fellowships seek to stimulate fundamental research by early-career scientists and scholars of outstanding promise. These two-year fellowships are awarded yearly to 118 researchers in recognition of distinguished performance and a unique potential to make substantial contributions to their field. More details and a list of this year's fellows may be found at http://www.sloan.org/fellowships/page21
Eugene works in the area of information retrieval and text and data mining, and leads the IR lab at Emory. His website is at http://www.mathcs.emory.edu/~eugene/
|CS Visiting Professor Search|
|Published Date: 2012-02-20|
The Department of Mathematics and Computer Science invites applications, subject to final funding approval, for a one-year full-time visiting position in Computer Science beginning mid-August 2012. Outstanding candidates in all areas will be considered. We are particularly interested in candidates who can teach courses in database systems, artificial intelligence, or software engineering.
A strong commitment to teaching excellence is required. The position may be of interest to sabbatical visitors or recent Ph.D. recipients seeking teaching experience. The teaching load is 3-4 courses for the academic year. Candidates should have completed their Ph.D. requirements in computer science or a closely related field by August 15th, 2012.
Applicants should send a cover letter, CV, teaching and research statements. Concurrently, please arrange for three references (at least one evaluating teaching) to be sent directly to the committee.
Materials should be sent by email to email@example.com. Informal inquiries are also welcome. Screening starts March 20, 2012 and will continue until the position is filled.
Emory University is an Affirmative Action/Equal Opportunity Employer and welcomes applications from women and members of minority groups.