Symmetric ideals and numerical primary decomposition

Dissertation Defense
Tuesday, May 26, 2015 - 11:30
1 hour (actually 50 minutes)
Skiles 006
Georgia Tech
The thesis considers two distinct strategies for algebraic computation with polynomials in high dimension.  The first concerns ideals and varieties with symmetry, which often arise in applications from areas such as algebraic statistics and optimization.  We explore the commutative algebra properties of such objects, and work towards classifying when symmetric ideals admit finite descriptions including equivariant Gröbner bases and generating sets.  Several algorithms are given for computing such descriptions.  Specific focus is given to the case of symmetric toric ideals.  A second area of research is on problems in numerical algebraic geometry.  Numerical algorithms such as homotopy continuation can efficiently compute the approximate solutions of systems of polynomials, but generally have trouble with multiplicity.  We develop techniques to compute local information about the scheme structure of an ideal at approximate zeros.  This is used to create a hybrid numeric-symbolic algorithm for computing a primary decomposition of the ideal.