Seminars and Colloquia by Series

Tuesday, April 3, 2012 - 14:00 , Location: Skiles 006 , Jonathan Hauenstein , Texas A&M , Organizer: Anton Leykin
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.
Tuesday, February 28, 2012 - 14:05 , Location: Skiles 006 , Cynthia Vinzant , University of Michigan , Organizer: Josephine Yu
 The central curve of a linear program is an algebraic curve specified by a hyperplane arrangement and a cost vector. This curve is the union of the various central paths for minimizing or maximizing the cost function over any region in this hyperplane arrangement. I will discuss the algebraic properties of this curve and its beautiful global geometry, both of which are controlled by the corresponding matroid and hyperplane arrangement.  
Tuesday, February 7, 2012 - 14:00 , Location: Skiles 006 , Douglas A. Leonard , Auburn University , Organizer: Anton Leykin
Let I be an ideal in a polynomial ring R := F[x_n,...,x_1] Let A := R/I be the corresponding quotient ring, and let Q(A) be its eld of fractions. The integral closure C(A, Q(A)) of A in Q(A) is a subring of the latter. But it is often given as a separate quotient ring, a presentation. Surprisingly, different computer algebra systems (Magma, Macaulay2, and Singular) choose to produce very different presentations. Some of these opt for presentations that have seductive forms, but miss the most important, namely a form that allows for determining when elements ofQ(A) are in C(A,Q(A)). This is called membership and is directly related to determining isomorphism.
Tuesday, January 24, 2012 - 14:05 , Location: Skiles 006 , Jonathan Hanke , University of Georgia , Organizer: Josephine Yu
This talk will describe some recent results using exact massformulas to determine all definite quadratic forms of small class number inn>=3 variables, particularly those of class number one.The mass of a quadratic form connects the class number (i.e. number ofclasses in the genus) of a quadratic form with the volume of its adelicstabilizer, and is explicitly computable in terms of special values of zetafunctions.  Comparing this with known results about the sizes ofautomorphism groups, one can make precise statements about the growth ofthe class number, and in principle determine those quadratic forms of smallclass number.We will describe some known results about masses and class numbers (overnumber fields), then present some new computational work over the rationalnumbers, and perhaps over some totally real number fields.
Tuesday, January 10, 2012 - 14:05 , Location: Skiles 006 , Benjamin Weiss , Technion , Organizer:
For two polynomials G(X), H(Y) with rational coefficients, when does G(X) = H(Y) have infinitely many solutions over the rationals? Such G and H have been classified in various special cases by previous mathematicians. A theorem of Faltings (the Mordell conjecture) states that we need only analyze curves with genus at most 1.In my thesis (and more recent work), I classify G(X) = H(Y) defining irreducible genus zero curves. In this talk I'll present the infinite families which arise in this classification, and discuss the techniques used to complete the classification.I will also discuss in some detail the examples of polynomial which occur in the classification. The most interesting infinite family of polynomials are those H(Y) solving a Pell Equation H(Y)^2 - P(Y)Q(Y)^2 = 1. It turns out to be difficult to describe these polynomials more explicitly, and yet we can completely analyze their decompositions, how many such polynomials there are of a fixed degree, which of them are defined over the rationals (as opposed to a larger field), and other properties.
Monday, December 5, 2011 - 16:05 , Location: Skiles 006 , Milena Hering , University of Connecticut , Organizer: Josephine Yu
The ring of invariants for the action of the automorphism group of the projective line on the n-fold product of the projective line is a classical object of study. The generators of this ring were determined by Kempe in the 19th century. However, the ideal of relations has been only understood very recently in work of Howard, Millson, Snowden and Vakil. They prove that the ideal of relations is generated byquadratic equations using a degeneration to a toric variety. I will report on joint work with Benjamin Howard where we further study the  toric varieties arising in this degeneration. As an application we show that the second Veronese subring of the ring of invariants admits a presentation whose ideal admits a quadratic Groebner basis.
Monday, November 28, 2011 - 16:05 , Location: 006 Skiles , Robert Lemke Oliver , Emory University , Organizer: Ernie Croot
Granville and Soundararajan have recently introduced thenotion of pretentiousness in the study of multiplicative functions ofmodulus bounded by 1, essentially the idea that two functions whichare similar in a precise sense should exhibit similar behavior. Itturns out, somewhat surprisingly, that this does not directly extendto detecting power cancellation - there are multiplicative functionswhich exhibit as much cancellation as possible in their partial sumsthat, modified slightly, give rise to functions which exhibit almostas little as possible. We develop two new notions of pretentiousnessunder which power cancellation can be detected, one of which appliesto a much broader class of multiplicative functions.  This work isjoint with Junehyuk Jung.
Monday, November 21, 2011 - 16:05 , Location: Skiles 006 , Ye Luo , Georgia Tech , , Organizer: Josephine Yu
Metric graphs arise naturally in tropical tropical geometry and Berkovich geometry. Recent efforts have extend conventional notion of divisors and linear systems on algebraic curves to finite graphs and metric graphs (tropical curves). Reduced divisors are introduced as an essential tool in proving graph-theoretic Riemann-Roch. In short, a q-reduced divisor is the unique divisor in a linear system with respect to a point q in the graph. In this talk, I will show how tropical convexity is related to linear systems on metric graphs, and define a canonical metric on the linear systems. In addition, I will introduce a generalized notion of reduced divisors, which are defined with respect to any effective divisor as in comparison a single point (effective divisor of degree one) in the conventional case.
Monday, November 14, 2011 - 16:05 , Location: Skiles 006 , Luis Garcia , Sam Houston State University , Organizer: Josephine Yu
Geometric modeling builds computer models for industrial design and manufacture from basic units, called patches, such as,  Bézier curves and surfaces. The control polygon of a Bézier curve is well-defined and has geometric significance—there is a sequence of weights under which the limiting position of the curve is the control polygon. For a Bezier surface patch, there are many possible polyhedral control structures, and none are canonical.  In this talk, I will present a not necessarily polyhedral control structure for surface patches, regular control surfaces, which are certain C^0 spline surfaces. While not unique, regular control surfaces are exactly the possible limiting positions of a Bezier patch when the weights are allowed to vary. While our primary interest is to explain the meaning of control  nets for the classical rational Bezier patches, we work in the generality of Krasauskas’ toric Bezier patches. Toric Bezier patches are multi-sided parametric patches based on the geometry of toric varieties and depend on a polytope and some weights. Our results rely upon a construction in computational algebraic geometry called a toric degeneration.
Monday, November 7, 2011 - 16:05 , Location: Skiles 006 , Farbod Shokrieh , Georgia Tech , , Organizer: Josephine Yu
A matroid is a structure that captures the notion of "independence". For example, given a set of vectors in a vector space, one can define a matroid. Graphs also naturally give rise to matroids. I will talk about various simplicial complexes associated to matroids. These include the "matroid complex", the "broken circuit complex", and the "order complex" of the associated geometric lattice. They carry some of the most important invariants of matroids and graphs. I will also show how the Bergman fan and its refinement (which arise in tropical geometry) relate to the classical theory. If time permits, I will give an outline of a recent breakthrough result of Huh and Katz on log-concavity of characteristic (chromatic) polynomials of matroids. No prior knowledge of the subject will be assumed. Most of the talk should be accessible to advanced undergraduate students.