Seminars and Colloquia by Series

A real analogue of the Bezout inequality and connected components of sign conditions

Series
Algebra Seminar
Time
Monday, September 16, 2013 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Sal BaroneGeorgia Tech

Please Note: Joint work with Saugata Basu sbasu@math.purdue.edu On a real analogue of Bezout inequality and the number of connected components of sign conditions. http://arxiv.org/abs/1303.1577

It is a classical problem in real algebraic geometry to try to obtain tight bounds on the number of connected components of semi-algebraic sets, or more generally to bound the higher Betti numbers, in terms of some measure of complexity of the polynomials involved (e.g., their number, maximum degree, and number of variables or so-called dense format). Until recently, most of the known bounds relied ultimately on the Oleinik-Petrovsky-Thom-Milnor bound of d(2d-1)^{k-1} on the number of connected components of an algebraic subset of R^k defined by polynomials of degree at most d, and hence the resulting bounds depend on only the maximum degree of the polynomials involved. Motivated by some recent results following the Guth-Katz solution to one of Erdos' hard problems, the distinct distance problem in the plane, we proved that in fact a more refined dependence on the degrees is possible, namely that the number of connected components of sign conditions, defined by k-variate polynomials of degree d, on a k'-dimensional variety defined by polynomials of degree d_0, is bounded by (sd)^k' d_0^{k−k'} O(1)^k. Our most recent work takes this refinement of the dependence on the degrees even further, obtaining what could be considered a real analogue to the classical Bezout inequality over algebraically closed fields.

Noetherianity for infinite-dimensional toric ideals

Series
Algebra Seminar
Time
Monday, September 9, 2013 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Robert KroneGeorgia Tech
Given a family of ideals which are symmetric under some group action on the variables, a natural question to ask is whether the generating set stabilizes up to symmetry as the number of variables tends to infinity. We answer this in the affirmative for a broad class of toric ideals, settling several open questions in work by Aschenbrenner-Hillar, Hillar-Sullivant, and Hillar-Martin del Campo. The proof is largely combinatorial, making use of matchings on bipartite graphs, and well-partial orders.

Chip-firing via open covers

Series
Algebra Seminar
Time
Monday, August 26, 2013 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Spencer BackmanGeorgia Institute of Technology
Chip-firing on graphs is a simple process with suprising connections to various areas of mathematics. In recent years it has been recognized as a combinatorial language for describing linear equivalence of divisors on graphs and tropical curves. There are two distinct chip-firing games: the unconstrained chip-firing game of Baker and Norine and the Abelian sandpile model of Bak, Tang, and Weisenfled, which are related by a duality very close to Riemann-Roch theory. In this talk we introduce generalized chip-firing dynamics via open covers which provide a fine interpolation between these two previously studied models.

Maximum Likelihood Estimation for Data with Zeros

Series
Algebra Seminar
Time
Wednesday, August 21, 2013 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Jose RodriguezUC Berkeley
Maximum likelihood estimation is a fundamental computational task in statistics and it also involves some beautiful mathematics. The MLE problem can be formulated as a system of polynomial equations whose number of solutions depends on data and the statistical model. For generic choices of data, the number of solutions is the ML-degree of the statistical model. But for data with zeros, the number of solutions can be different. In this talk we will introduce the MLE problem, give examples, and show how our work has applications with ML-duality.This is a current research project with Elizabeth Gross.

Effective Chabauty for Sym^2

Series
Algebra Seminar
Time
Monday, April 29, 2013 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jennifer ParkMIT
While we know by Faltings' theorem that curves of genus at least 2 have finitely many rational points, his theorem is not effective. In 1985, R. Coleman showed that Chabauty's method, which works when the Mordell-Weil rank of the Jacobian of the curve is small, can be used to give a good effective bound on the number of rational points of curves of genus g > 1. In this talk, we draw ideas from tropical geometry to show that we can also give an effective bound on the number of rational points of Sym^2(X) that are not parametrized by a projective line or an elliptic curve, where X is a (hyperelliptic) curve of genus g > 2, when the Mordell-Weil rank of the Jacobian of the curve is at most g-2.

p-adic heights and integral points on hyperelliptic curves

Series
Algebra Seminar
Time
Monday, April 22, 2013 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Jennifer BalakrishnanHarvard University
We give a Chabauty-like method for finding p-adic approximations to integral points on hyperelliptic curves when the Mordell-Weil rank of the Jacobian equals the genus. The method uses an interpretation ofthe component at p of the p-adic height pairing in terms of iterated Coleman integrals. This is joint work with Amnon Besser and Steffen Mueller.

Athens-Atlanta number theory seminar 2 - Arithmetic statistics over function fields

Series
Algebra Seminar
Time
Tuesday, April 16, 2013 - 17:15 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jordan EllenbergUniversity of Wisconsin
What is the probability that a random integer is squarefree? Prime? How many number fields of degree d are there with discriminant at most X? What does the class group of a random quadratic field look like? These questions, and many more like them, are part of the very active subject of arithmetic statistics. Many aspects of the subject are well-understood, but many more remain the subject of conjectures, by Cohen-Lenstra, Malle, Bhargava, Batyrev-Manin, and others. In this talk, I explain what arithmetic statistics looks like when we start from the field Fq(x) of rational functions over a finite field instead of the field Q of rational numbers. The analogy between function fields and number fields has been a rich source of insights throughout the modern history of number theory. In this setting, the analogy reveals a surprising relationship between conjectures in number theory and conjectures in topology about stable cohomology of moduli spaces, especially spaces related to Artin's braid group. I will discuss some recent work in this area, in which new theorems about the topology of moduli spaces lead to proofs of arithmetic conjectures over function fields, and to new, topologically motivated questions about counting arithmetic objects.

Athens-Atlanta number theory seminar 1 - The arithmetic of hyperelliptic curves

Series
Algebra Seminar
Time
Tuesday, April 16, 2013 - 16:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Dick GrossHarvard University
Hyperelliptic curves over Q have equations of the form y^2 = F(x), where F(x) is a polynomial with rational coefficients which has simple roots over the complex numbers. When the degree of F(x) is at least 5, the genus of the hyperelliptic curve is at least 2 and Faltings has proved that there are only finitely many rational solutions. In this talk, I will describe methods which Manjul Bhargava and I have developed to quantify this result, on average.

Stark-Heegner/Darmon points on elliptic curves over totally real fields

Series
Algebra Seminar
Time
Monday, April 15, 2013 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Amod AgasheFlorida State University
The classical theory of complex multiplication predicts the existence of certain points called Heegner points defined over quadratic imaginary fields on elliptic curves (the curves themselves are defined over the rational numbers). Henri Darmon observed that under certain conditions, the Birch and Swinnerton-Dyer conjecture predicts the existence of points of infinite order defined over real quadratic fields on elliptic curves, and under such conditions, came up with a conjectural construction of such points, which he called Stark-Heegner points. Later, he and others (especially Greenberg and Gartner) extended this construction to many other number fields, and the points constructed have often been called Darmon points. We will outline a general construction of Stark-Heegner/Darmon points defined over quadratic extensions of totally real fields (subject to some mild restrictions) that combines past constructions; this is joint work with Mak Trifkovic.

Geometric perspectives on phylogenetics

Series
Algebra Seminar
Time
Monday, April 8, 2013 - 17:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Seth SullivantNorth Carolina State University
I will discuss two problems in phylogenetics where a geometric perspective provides substantial insight. The first is the identifiability problem for phylogenetic mixture models, where the main problem is to determine which circumstances make it possible to recover the model parameters (e.g. the tree) from data. Here tools from algebraic geometry prove useful for deriving the current best results on the identifiability of these models. The second problem concerns the performance of distance-based phylogenetic algorithms, which take approximations to distances between species and attempt to reconstruct a tree. A classical result of Atteson gives guarantees on the reconstruction, if the data is not too far from a tree metric, all of whose edge lengths are bounded away from zero. But what happens when the true tree metric is very near a polytomy? Polyhedral geometry provides tools for addressing this question with some surprising answers.

Pages