Women In Mathematics – Spring 2018 Schedule

Our seminar will meet on a biweekly schedule, on Wednesdays, starting January 17, 2018. All the mathematicians in the Atlanta area, at all stages in their career are welcome to participate! The talks are intended for a general audience.

Yulia Babenko, Kennesaw State University,


Galyna Livshyts, Georgia Institute of Technology,

Location: Georgia Institute of Technology, Skiles bldg room 006, 686 Cherry St NW, Atlanta, GA 30313.
Time: Wednesdays at 5 pm; the refreshments are served at 4:30 pm.

Schedule for Spring 2018:

January 17: cancelled due to snow;


January 31: Olivia Beckwith, Emory University.

Title: Arithmetic in quadratic fields
Abstract: Quadratic fields arise naturally in the study of primes and in solving Diophantine equations. Their arithmetic is in many ways similar to the familiar arithmetic of whole numbers, but an important difference is that in quadratic fields, integers cannot be factored uniquely into primes. Class numbers measure the degree to which unique factorization fails, and it turns out that consequences of deep knowledge about these numbers percolate through virtually every important question in number theory. We’ll look at some of the rich history in the study of class numbers and at important questions that are the subject of current research.


February 14:  Rachel Kuske, Georgia Institute of Technology.

Title: New patterns in stochastic PDE’s with Pyragas control
Abstract: We provide a multiple time scales analysis for the Swift-Hohenberg equation with delayed feedback via Pyragas control, focusing on Turing bifurcations with and without additive noise. In the deterministic case, a Ginzburg-Landau-type modulation equation is derived that inherits Pyragas control terms from the original equation. The Eckhaus stability criteria is obtained for the rolls, with the delay driving the appearance of an intermediate time scale observed in the transients. In the stochastic context, slow modulation equations are derived for the amplitudes of the primary modes that are coupled to a fast Ornstein-Uhlenbeck-type equation with delay for the zero mode driven by the additive noise. By deriving an averaging approximation for the amplitude of the primary mode, we show how the interaction of noise and delay influences the existence and stability range for the noisy roll-type patterns. Furthermore, approximations for the spectral densities of the primary and zero modes show that oscillations on the intermediate times scale are sustained through the phenomenon of coherence resonance. These dynamics on the intermediate time scale are sustained through the interaction of noise and delay, in contrast to the deterministic context where dynamics on the intermediate times scale are transient.


February 28: Alexandra Smirnova, Georgia State University.

Title: Disease forecasting by new regularized Broyden-type optimization algorithms
Abstract: In this talk, we will outline a new approach to the development of iteratively regularized Broyden-type algorithms for solving nonlinear ill-posed inverse problems in either finite or infinite dimensional spaces. The novel regularization methods are designed to solve large-scale unstable least squares problems, where the Jacobian of a discretized nonlinear operator is difficult or even infeasible to compute. To face this challenge, a family of Gauss-Newton and Levenberg-Marquardt algorithms with the Fréchet derivative operator recalculated iteratively by using Broyden-type single rank updates is considered. To balance accuracy and stability, the pseudo-inverse for the derivative-free Jacobian is regularized in a problem-specific manner at every step of the iteration process. The study has been motivated by applications of inverse problems in epidemiology and infectious disease modeling, where stable estimation of key epidemiological parameters at the onset of an emerging virus is paramount in assisting public health authorities to rapidly assess the situation in order to determine whether the pathogen in question is capable of generating sustained local or global outbreaks. To illustrate theoretical findings, numerical simulations for both parameter estimation and forecasting of future incidence cases will be presented.


March 14Amalia Culiuc, Georgia Institute of Technology.

Title: Sparse domination principles for singular integral operators
Abstract: The estimation of singular integrals, which are generally non-local and non-positive operators, by sparse forms, which by contrast are positive and localized, has recently become a leading trend in Calderon-Zygmund theory and beyond. In this talk we will explore the concept of sparse domination and its implications for weighted norm inequalities. In particular, we will discuss several sparse domination results, including the study of the bilinear Hilbert transform and rough homogeneous singular integrals.


March 28: Kirsten Wickelgren, Georgia Institute of Technology.

   Title: How to count lines on a cubic surface

Abstract: I’ll introduce some enumerative geometry, algebraic topology, and A1 or motivic algebraic topology, and then discuss a joint result with Jesse Kass giving a generalization to all fields of characteristic not 2 of the classical enumerative result that there are 27 lines on a smooth cubic surface defined over the complex numbers

April 11:  Samantha Petti, Georgia Institute of Technology.

   Title: Graph Approximation: Szemer\’edi’s regularity lemma, graph limits, and the ROC model

Abstract: How can we approximate sparse graphs and sequences of sparse graphs (with average degree unbounded and o(n))? We consider convergence in the first k moments of the graph spectrum (equivalent to the numbers of closed k-walks) appropriately normalized. We introduce a simple, easy to sample, random graph model that captures the limiting spectra of many sequences of interest, including the sequence of hypercube graphs. The Random Overlapping Communities (ROC) model is specified by a distribution on pairs (s,q), s∈ℤ+,q∈(0,1]. A graph on n vertices with average degree d is generated by repeatedly picking pairs (s,q) from the distribution, adding an Erd\H{o}s-R\'{e}nyi random graph of edge density q on a subset of vertices chosen by including each vertex with probability s/n, and repeating this process so that the expected degree is d. Our proof of convergence to a ROC random graph is based on the Stieltjes moment condition. We also show that the model is an effective approximation for individual graphs. For almost all possible triangle-to-edge and four-cycle-to-edge ratios, there exists a pair (s,q) such that the ROC model with this single community type produces graphs with both desired ratios, a property that cannot be achieved by stochastic block models of bounded description size. Moreover, ROC graphs exhibit an inverse relationship between degree and clustering coefficient, a characteristic of many real-world networks.


Schedule for Fall 2018:

In the Fall 2018, in place of the biweekly seminar we shall have two events, in September and in November; multiple talks shall be delivered during those events. Please contact Galyna or Yulia in case you are interested to speak. More details to follow later.

TBA:  Megan Cream, Spelman College.
Title: TBA
Abstract: TBA.