Clemson University Algebra and Discrete Math (ADM) Seminar
Fall 2012
Thursdays 3:30 - 4:30
M-102 Martin Hall

Organizer: Matt Macauley (macaule[at]clemson.edu)

date speaker affiliation title (click title for abstract)
September 6 Neil Calkin, Kevin James, and Kirsti Wash Clemson How we spent our summer: The 2012 Clemson REU
September 13 Wayne Goddard Clemson The graph secretary problem
September 20 Shuhong Gao Clemson Finding sparse factors of multivariate polynomials via discrete logarithms
September 27 Yue Mao Clemson Compressive sensing and numerical decoding of Reed-Solomon codes
October 4 Michael Burr Clemson An introduction to data depth (with some recent work)
October 11 None --  
October 18 Will Perkins Georgia Tech The power of two choices in random graphs and constraint satisfaction problems
October 25 David Murrugarra Georgia Tech Discrete models in systems biology
November 1 Mini-conference Various Various [discrete math]
November 8 Jim Brown Clemson What is ... the BSD conjecture?
November 15 Qijun He Clemson New combinatorial problems motivated by RNA folding
November 22 Thanksgiving Break -- --
November 29 Winfried Kohnen Heidelberg University (Germany) Conic theta functions [at 5:00pm!]
December 11 (Tues!) Brandy Stigler SMU Comparing knowledge- and data-driven models of tissue development in C. elegans [in M-104]

Past seminars: Spring 2012 | Fall 2011 | Fall 2010 | Spring 2010 | Fall 2009 | Spring 2009 | Fall 2008 | Spring 2008 | Fall 2007 | Spring 2007 | Fall 2006 | Spring 2006 | Fall 2005 | Spring 2005 | Fall 2004 | Spring 2004 | Fall 2003 | Spring 2003 | Fall 2002 | Spring 2002 | Fall 2001 | Spring 2001 | Fall 2000 | Spring 2000 | Fall 1999 | Spring 1999