Seminars and Colloquia by Series

Diophantine Approximation and Solving Sparse Polynomial Equations

Series
Algebra Seminar
Time
Monday, November 3, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Maurice RojasTexas A&M University

Please Note: There will be a pre-seminar 10:55-11:15 in Skiles 005.

Suppose $f$ is a univariate polynomial with integer coefficients of absolute value at most $H$, exactly $t$ monomial terms, and degree $d$. Suppose also that $p,q$ are integers of absolute value at most $H$. Then one can determine the sign of $f(p/q)$ in time $(d^3 \log H)^{2+\epsilon}$, by combining work of Liouville from about 170 years ago, work of Mahler from about 60 years ago, work of Neff, Reif, and Pan from about 30 years ago, and more recent refinements.

However, when $t$ is small, one can do much better: When $t=2$, one can determine the sign of $f(p/q)$ in time $\log^5(dH)$, via work of Baker from about 55 years ago. Koiran asked, around 2016, about the $t=3$ case, after proving new bounds on the minimal separation of complex roots of univariate trinomials.

We make progress on Koiran's question by giving a new, dramatically faster algorithm for solving univariate trinomials over the real numbers. The key innovation is a new family of non-hypergeometric series for the roots of $f$ when $f$ is close to having a degenerate root. This is joint work with Emma Boniface and Weixun Deng.

Lagrangian Dual Sections: A Topological Perspective on Hidden Convexity

Series
Algebra Seminar
Time
Monday, October 27, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Kevin ShuCalifornia Institute of Technology

Convex relaxations are of central interest in optimization, and it is typically challenging to determine whether a given convex relaxation will be tight for a given problem. We introduce a topological framework for analyzing  situations in which a constrained optimization problem over a nonconvex set (such as a manifold) has a tight convex relaxation. In particular, we give a criterion for the existence of such a tight convex relaxation in terms of the existence of a continuous function of Lagrange multipliers for the constrained problem maximizing the corresponding Lagrangian. We call such a function a Lagrangian dual section, in reference to the topological notion of a section of a bundle.

As a corollary of this result, we will give new criteria for the exactness of SDP relaxations for Stiefel manifold optimization and inverse eigenvalue problems in terms of linear subspaces of matrices satisfying spectral properties such as being nonsingular. We will also illustrate a homotopy continuation style algorithm with global optimality guarantees with applications to the unbalanced procrustes problem.

Ars Conjectandi

Series
Algebra Seminar
Time
Monday, October 20, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Manuel KauersJohannes Kepler University

Please Note: There will be a pre-seminar 10:55-11:15 in Skiles 005.

Proving conjectures is an essential part of our job as mathematicians. Another essential part is to come up with plausible conjectures. In the talk, we focus on this part. We present a new twist to an old method from computer algebra for detecting recurrence equations of infinite sequences of which only the first few terms are known. By applying this new version systematically to all the entries of the Online Encyclopedia of Integer Sequences, we detected a number of potential recurrence equations that could not be found by the classical methods. Some of these have meanwhile been proven. This is joint work with Christoph Koutschan. 

====(Below is the information on the pre-talk.)====

Titile: Lattice Reduction 
                                                                                                           
Abstract: It is well known how to go from an exact number (e.g. 1/3) into an approximation (e.g. 0.333). But how can we get back? At first glance, this seems impossible, because some information got lost during the approximation. However, there are techniques for doing this and similar seemingly magic tricks. We will discuss some such tricks that rely on an algorithm for finding short vectors in integer lattices.          

Algebraic Topology and Aggregations of Quadratic Inequalities

Series
Algebra Seminar
Time
Monday, September 29, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Alex DunbarGeorgia Tech

We study the problem of computing the convex hull of a set $S \subseteq \mathbb{R}^n$ defined by three quadratic inequalities. A simple way to generate inequalities valid on $S$ is to take nonnegative linear combinations, called aggregations, of the defining inequalities. We study the set defined by aggregations using topological duality results for quadratic inequalities. In the case of three quadratic inequalities, this relates aggregations to an algebraic curve. This viewpoint allows us to find new cases for which the convex hull of $S$ can be recovered by aggregations. Joint work with Greg Blekherman.

MacPhersonians and Pseudocircle Arrangements

Series
Algebra Seminar
Time
Monday, September 22, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Michael DobbinsBinghamton University

Please Note: There will be a pre-seminar 10:55-11:15 in Skiles 005.

MacPhersonians are a combinatorial analog of real Grassmannians defined by oriented matroids.  A long standing conjecture says that each MacPhersonian is homotopy equivalent to the corresponding Grassmannian.  Pseudolinear Grassmannians are spaces of topological representations of oriented matroids, and these are each homotopy equivalent to the corresponding Grassmannian in rank 3.  I will present a good cover of the rank 3 pseudolinear Grassmannian with nerve complex isomorphic to the order complex of the corresponding MacPhersonian, confirming the conjecture in rank 3.

Degenerations and irreducibility problems in dynamics

Series
Algebra Seminar
Time
Monday, September 15, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Rohini RamadasEmory University

Please Note: There will be a pre-seminar 10:55-11:15 in Skiles 005.

This talk is about an application of combinatorial algebraic geometry to complex/arithmetic dynamics. The n-th Gleason polynomial G_n is a polynomial in one variable with Z-coefficients, whose roots correspond to degree-2 polynomials with an n-periodic ramification point. Per_n is an affine algebraic curve, defined over Q, parametrizing degree-2 rational maps with an n-periodic ramification point. Two long-standing open questions in complex dynamics are: (1) Is G_n is irreducible over Q? (2) Is Per_n connected? We show that if G_n is irreducible over Q, then Per_n is irreducible over C, and is therefore connected. In order to do this, we find a Q-rational smooth point on a projective completion of Per_n — this Q-rational smooth point represents a special degeneration of degree-2 self-maps.

Power flow, toric deficiency, and strata-confined polyhedral homotopies

Series
Algebra Seminar
Time
Monday, September 8, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Tianran ChenAuburn University at Montgomery

Please Note: There will be a pre-seminar 10:55-11:15 in Skiles 005.

Power-flow equations model the intricate balancing conditions in electric power grids and are central to analysis and control.  They can be reformulated as Laurent polynomial systems, which makes algebraic and polyhedral techniques applicable.  In this talk, we first explore different ways in which this can be done.

However, certain algebraic formulations may be deficient: the actual number of isolated solutions (counting multiplicity) may fall below the Bernshtein–Kushnirenko–Khovanskii (BKK) bound predicted from Newton polytopes.  By choosing a proper parametrization one uncovers that this deficiency exhibits a certain toric structure.  Recognizing that structure reframes the deficit as a geometric feature rather than a numerical anomaly.  In the second part of this talk, we explore variations of polyhedral homotopy methods designed to respect and exploit this structure.

====(Below is the information on the pre-talk.)====

Title: Mixed volume, mixed cells, and stable self intersections

Abstract: This talk provides an introduction to mixed volume, mixed cells, and their connections to the Bernshtein–Kushnirenko–Khovanskii bound, as well as stable intersections of tropical hypersurfaces.

Chip-Firing and Consistency on Regular Matroids

Series
Algebra Seminar
Time
Monday, August 25, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Alex McDonoughUniversity of Oregon

Please Note: There will be a pre-seminar 10:55-11:15 in Skiles 005.

Traditionally, chip-firing is a discrete dynamical system where poker chips move around the vertices of a graph. One fascinating result is that number of configurations of a fixed number of chips, modulo a firing equivalence relation, is the number of spanning trees of the graph. This relationship gives the set of spanning trees group-like properties.

In this talk, I will discuss how chip-firing ideas can be generalized from graphs to regular matroids, where bases play the role of spanning trees. This will lead to an overview of joint work with Ding, Tóthmérész, and Yuen on the consistency of the Backman-Baker-Yuen Sandpile Torsor. 

============(Below is the information on the pre-talk.)============

Title (pre-talk): Transforming Spanning Trees Using Mathematicians and Coffee Cups

Abstract (pre-talk): There is a fascinating structure to the set of spanning trees of a plane graph, which allows this set to behave much like a group. Perhaps most incredibly, there is a sense in which this structure is canonical.
In this talk, I will show you how spanning trees can be transformed after introducing mathematicians and coffee cups on some of the vertices. This is a variant of the rotor-routing process which takes advantage of a special property of plane graphs.

The tropical trigonal construction

Series
Algebra Seminar
Time
Monday, April 21, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Dmitry ZakharovCentral Michigan University

Please Note: There will be a pre-seminar 10:55-11:15 in Skiles 005.

There are two standard ways to associate a principally polarized abelian variety (ppav) to a smooth algebraic curve X of genus g. The Jacobian variety Jac(X) is a ppav of dimension g. An etale double cover X’->X determines the Prym variety Prym(X’/X), which is a ppav of dimension g-1. These two objects are related by Recillas’ trigonal construction: given an etale double cover X’->X of a trigonal curve X, we can construct a tetragonal curve Y such that Prym(X’/X) is isomorphic to Jac(Y).

I will talk about a tropical version of the trigonal construction, where algebraic curves are replaced by metric graphs and ppavs by real tori with integral structure. Given a double cover X’->X of a trigonal graph X, we obtain a tetragonal graph Y such that the tropical Prym variety Prym(X’/X) and the tropical Jacobian Jac(Y) are isomorphic.

This construction has two applications. First, we can use it to compute the second moment of the tropical Prym variety for g up to 4, and conjecturally for all g, which has arithmetic applications. Second, the tropical trigonal construction provides an explicit resolution of the Prym—Torelli map in genus 4.

Springer fibers and Richardson varieties

Series
Algebra Seminar
Time
Monday, April 14, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Steven KarpUniversity of Notre Dame

Please Note: There will be a pre-seminar from 10:55 to 11:15 in Skiles 005.

A Springer fiber is the set of complete flags in Cn which are fixed by a given nilpotent matrix. It is a fundamental object of study in geometric representation theory and algebraic combinatorics. The irreducible components of a Springer fiber are indexed by combinatorial objects called standard Young tableaux. It is an open problem to describe geometric properties of these components (such as their singular loci and cohomology classes) in terms of the combinatorics of tableaux. We initiate a new approach to this problem by characterizing which irreducible components are equal to Richardson varieties, which are comparatively much better understood. Another motivation comes from Lusztig's recent study of the cell decomposition of the totally nonnegative part of a Springer fiber into totally positive Richardson cells. This is joint work in progress with Martha Precup.

Pages