Seminars and Colloquia by Series

Computing the nearest structured rank deficient matrix

Series
Algebra Seminar
Time
Tuesday, March 15, 2022 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Diego Cifuentes – Georgia Tech –

Given an affine space of matrices L and a matrix Θ ∈ L, consider the problem of computing the closest rank deficient matrix to Θ on L with respect to the Frobenius norm. This is a nonconvex problem with several applications in control theory, computer algebra, and computer vision. We introduce a novel semidefinite programming (SDP) relaxation, and prove that it always gives the global minimizer of the nonconvex problem in the low noise regime, i.e., when Θ is close to be rank deficient. Our SDP is the first convex relaxation for this problem with provable guarantees. We evaluate the performance of our SDP relaxation in examples from system identification, approximate GCD, triangulation, and camera resectioning. Our relaxation reliably obtains the global minimizer under non-adversarial noise, and its noise tolerance is significantly better than state of the art methods.

Degree bounds for sums of squares of rational functions

Series
Algebra Seminar
Time
Tuesday, March 8, 2022 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Grgoriy Blekhermany – Georgia Tech –

Hilbert’s 17th problem asked whether every nonnegative polynomial is a sum of squares of rational functions. This problem was solved affirmatively by Artin in the 1920’s, but very little is known about degree bounds (on the degrees of numerators and denominators) in such a representation. Artin’s original proof does not yield any upper bounds, and making such techniques quantitative results in bounds that are likely to be far from optimal, and very far away from currently known lower bounds. Before stating the 17th problem Hilbert was able to prove that any globally nonnegative polynomial in two variables is a sum of squares of rational functions, and the degree bounds in his proof have been best known for that two variable case since 1893. Taking inspiration from Hilbert’s proof we study degree bounds for nonnegative polynomials on surfaces. We are able to improve Hilbert’s bounds and also give degree bounds for some non-rational surfaces. I will present the history of the problem and outline our approach. Joint work with Rainer Sinn, Greg Smith and Mauricio Velasco.

Inflation of poorly conditioned zeros of systems of analytic functions

Series
Algebra Seminar
Time
Tuesday, January 25, 2022 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Anton Leykin – Georgia Tech –

Given a system of analytic functions and an approximate zero, we introduce inflation to transform this system into one with a regular quadratic zero. This leads to a method for isolating a cluster of zeros of the given system.

(This is joint work with Michael Burr.)

Sharp bounds for the number of regions of maxout networks and vertices of Minkowski sums

Series
Algebra Seminar
Time
Tuesday, January 11, 2022 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Yue Ren – Durham University –

We present results on the number of linear regions of the functions that can be represented by artificial feedforward neural networks with maxout units. A rank-k maxout unit is a function computing the maximum of k linear functions. For networks with a single layer of maxout units, the linear regions correspond to the regions of an arrangement of tropical hypersurfaces and to the (upper) vertices of a Minkowski sum of polytopes. This is joint work with Guido Montufar and Leon Zhang.

A Taste of Extremal Combinatorics in AG

Series
Algebra Seminar
Time
Tuesday, December 7, 2021 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Robert Walker – University of Wisconsin, Madison –

In this talk, we survey known results and open problems tied to the dual graph of a projective algebraic F-scheme over a field F, a construction that apparently Janos Kollar is familiar with. In particular one can use this construction to answer the following question: if you consider the 27 lines on a cubic surface in P^3, how many lines meet a given line? The dual graph can answer this and more questions in enumerative geometry and intersection theory easily, based on work of Benedetti -- Varbaro and others.

Cayley-Bacharach theorems and measures of irrationality

Series
Algebra Seminar
Time
Tuesday, November 30, 2021 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Brooke Ullery – Emory University –

If Z is a set of points in projective space, we can ask which polynomials of degree d vanish at every point in Z. If P is one point of Z, the vanishing of a polynomial at P imposes one linear condition on the coefficients. Thus, the vanishing of a polynomial on all of Z imposes |Z| linear conditions on the coefficients. A classical question in algebraic geometry, dating back to at least the 4th century, is how many of those linear conditions are independent? For instance, if we look at the space of lines through three collinear points in the plane, the unique line through two of the points is exactly the one through all three; i.e. the conditions imposed by any two of the points imply those of the third. In this talk, I will survey several classical results including the original Cayley-Bacharach Theorem and Castelnuovo’s Lemma about points on rational curves. I’ll then describe some recent results and conjectures about points satisfying the so-called Cayley-Bacharach condition and show how they connect to several seemingly unrelated questions in contemporary algebraic geometry relating to the gonality of curves and measures of irrationality of higher dimensional varieties.

Homology representations of compactified configurations on graphs

Series
Algebra Seminar
Time
Tuesday, November 16, 2021 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Claudia Yun – Brown –

The $n$-th ordered configuration space of a graph parametrizes ways of placing $n$ distinct and labelled particles on that graph. The homology of the one-point compactification of such configuration space is equipped with commuting actions of a symmetric group and the outer automorphism group of a free group. We give a cellular decomposition of these configuration spaces on which the actions are realized cellularly and thus construct an efficient free resolution for their homology representations. As our main application, we obtain computer calculations of the top weight rational cohomology of the moduli spaces $\mathcal{M}_{2,n}$, equivalently the rational homology of the tropical moduli spaces $\Delta_{2,n}$, as a representation of $S_n$ acting by permuting point labels for all $n\leq 10$. This is joint work with Christin Bibby, Melody Chan, and Nir Gadish. Our paper can be found on arXiv with ID 2109.03302.

Clusters and semistable models of hyperelliptic curves

Series
Algebra Seminar
Time
Tuesday, November 9, 2021 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jeffrey Yelton – Emory University –

For every hyperelliptic curve $C$ given by an equation of the form $y^2 = f(x)$ over a discretely-valued field of mixed characteristic $(0, p)$, there exists (after possibly extending the ground field) a model of $C$ which is semistable -- that is, a model whose special fiber (i.e. the reduction over the residue field) consists of reduced components and has at worst very mild singularities.  When $p$ is not $2$, the structure of such a special fiber is determined entirely by the distances (under the discrete valuation) between the roots of $f$, which we call the cluster data associated to $f$.  When $p = 2$, however, the cluster data no longer tell the whole story about the components of the special fiber of a semistable model of $C$, and constructing a semistable model becomes much more complicated.  I will give an overview of how to construct "nice" semistable models for hyperelliptic curves over residue characteristic not $2$ and then describe recent results (from joint work with Leonardo Fiore) on semistable models in the residue characteristic $2$ situation.

u-regeneration: solving systems of polynomials equation-by-equation

Series
Algebra Seminar
Time
Tuesday, November 2, 2021 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jose Rodriguez – University of Wisconsin, Madison –

Solving systems of polynomial equations is at the heart of algebraic geometry. In this talk I will discuss a new method that improves the efficiency of equation-by-equation algorithms for solving polynomial systems. Our approach uses fewer homotopy continuation paths than the current leading method based on regeneration.  Moreover it is applicable in both projective and multiprojective settings. To motivate the approach I will also give some examples coming from applied algebraic geometry.
This is joint work with Tim Duff and Anton Leykin.

Graded rings with rational twist in prime characteristic

Series
Algebra Seminar
Time
Tuesday, October 26, 2021 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Florian Enescu – Georgia State –

Prompted by the definition for the Frobenius complexity of a local ring of positive characteristic, we examine generating functions that can be associated to the twisted construction of a graded ring of positive characteristic. There is a large class of graded rings for which this generating function is rational. We will discuss this class of rings.  This work is joint with Yongwei Yao.

Pages