[Sem-coll] Applied Math Seminars & Colloquium This Week

Joe Millham jmillham at iit.edu
Mon Nov 1 10:50:28 CDT 2010


Please join the Applied Math department for the following Seminars and
Colloquia.  All are welcome to attend, and refreshments will be served
at some events.  For a complete and updated listing of the
department's seminars, please visit the seminar webpage:
http://www.iit.edu/csl/am/colloquia/

Department Colloquium
Monday, Nov. 1,  4:40 pm  E1 106
Shuhong Gao, Clemson University
"A New Algorithm for Computing Grobner Bases"
Abstract:
Polynomial systems are ubiquitous in Mathematics, Sciences and
Engineerings, and Gröbner basis theory is one of the most powerful
tools for solving polynomial systems.  Buchberger introduced in 1965
the first algorithm for computing Gröbner bases and it has been
implemented in most computer algebra systems (e.g. Maple, Mathematica,
Magma, etc). Faugere presented two new algorithms: F4 (1999) and F5
(2002),  with the latter being the faster algorithm known.  In this
talk, I shall first give a brief overview on Gröbner bases then
present a new algorithm that matches Buchberger's algorithm in
simplicity yet is several times faster F5. The talk will be accessible
to a general audience.

Joint work with Yinhua Guan (Clemson), Frank Volny (Clemson), and
Mingsheng Wang (Chinese Academy of Sciences).

+++++++++++++++++++++++++++++++++++++++

Department Colloquium
Wednesday, Nov. 3  4:40 pm  E1 106
Sonja Petrovic, University of Illinois - Chicago
"An Invitation to Algebraic Statistics"
Abstract:
Algebraic statistics has flourished in recent years as a branch of
applied algebraic geometry. This field is fundamentally connected to
and driven by methods from statistics, computational algebraic
geometry, and combinatorics.  The algebraic methods have applications
to statistical models where standard computational tools do not scale
well, for example, phylogenetics, social networks, and graphical
models. In turn, some of the open problems suggest developments on the
computational frontier.

This talk will survey a brief history of recent developments in the
field. We will focus on the problem of constructing Markov moves for
exponential family models. The idea will be illustrated on an example
for a  random graph model used in the social network literature. Time
permitting, we will also briefly discuss the problem of parameter
identifiability in graphical models.

+++++++++++++++++++++++++++++++++++++

Joe Millham

Administrative Assistant
Department of Applied Mathematics
Illinois Institute of Technology
Engineering-1 Room 208
10 W. 32rd St.
Chicago IL 60616
312.567.8984 (Phone)
312.567.3135 (Fax)





More information about the seminar-coll mailing list