Georgia Institute of Technology College of Sciences

How does one study the asymptotic properties for the Hilbert series of a module? In this talk, we will examine the function which sends the numerator of the rational function representing the Hilbert series of a module to that of its r-th Veronese submodule. As r tends to infinity, the behaviour of this function depends only on the multidegree of the module and the underlying multigraded polynomial ring. More importantly, we will give a polyhedral description for the asymptotic polynomial and show that the coefficients are log-concave.

We discuss the theory of symmetric Groebner bases, a concept allowing one to prove Noetherianity results for symmetric ideals in polynomial rings with an infinite number of variables. We also explain applications of these objects to other fields such as algebraic statistics, and we discuss some methods for computing with them on a computer. Some of this is joint work with Matthias Aschenbrener and Seth Sullivant.

The critical group of a graph G is an abelian group K(G) whose order is the number of spanning forests of G. As shown by Bacher, de la Harpe and Nagnibeda, the group K(G) has several equivalent presentations in terms of the lattices of integer cuts and flows on G. The motivation for this talk is to generalize this theory from graphs to CW-complexes, building on our earlier work on cellular spanning forests. A feature of the higher-dimensional case is the breaking of symmetry between cuts and flows. Accordingly, we introduce and study two invariants of X: the critical group K(X) and the cocritical group K^*(X), As in the graph case, these are defined in terms of combinatorial Laplacian operators, but they are no longer isomorphic; rather, the relationship between them is expressed in terms of short exact sequences involving torsion homology. In the special case that X is a graph, torsion vanishes and all group invariants are isomorphic, recovering the theorem of Bacher, de la Harpe and Nagnibeda. This is joint work with Art Duval (University of Texas, El Paso) and Caroline Klivans (Brown University).

In many applications in engineering and physics, one is interested in computing real solutions to systems of equations. This talk will explore numerical approaches for approximating solutions to systems of polynomial and polynomial-exponential equations. We will then discuss using certification methods based on Smale's alpha-theory to rigorously determine if the corresponding solutions are real. Examples from kinematics, electrical engineering, and string theory will be used to demonstrate the ideas.