Seminars and Colloquia by Series

Moments and zeros of L-functions

Series
Job Candidate Talk
Time
Tuesday, November 19, 2024 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Alexandra FloreaUniversity of California Irvine

 

The moments of the Riemann zeta-function were introduced more than 100 years ago by Hardy and Littlewood, who showed that the Lindelof hypothesis (which provides a strong upper bound for the Riemann zeta-function on the critical line) is equivalent to obtaining sharp bounds on all the positive, even integral moments. Since then, the moments of the Riemann zeta-function and of more general L-functions have become natural objects of study. In this talk, I will review some of the history of the problem of evaluating moments, and focus on three different lines of research: studying negative moments of L-functions (which have been much less studied over the years, but which have rich applications nevertheless), computing lower-order terms in the moment asymptotics and obtaining non-vanishing results for L-functions evaluated at special points.

Spinal open books and symplectic fillings with exotic fibers

Series
Geometry Topology Seminar
Time
Monday, November 18, 2024 - 16:30 for 1 hour (actually 50 minutes)
Location
University Of Georgia
Speaker
Luya Wang Institute for Advanced Study

Pseudoholomorphic curves are pivotal in establishing uniqueness and finiteness results in the classification of symplectic manifolds. In a series of works, Wendl used punctured pseudoholomorphic foliations to classify symplectic fillings of contact three-manifolds supported by planar open books, turning it into a problem about monodromy factorizations. In a joint work with Hyunki Min and Agniva Roy, we build on the works of Lisi--Van Horn-Morris--Wendl in using spinal open books to further delve into the classification problem of symplectic fillings of higher genus open books. In particular, we provide the local model of the mysterious "exotic fibers" in a generalized version of Lefschetz fibrations, which captures a natural type of singularity at infinity. We will give some applications to classifying symplectic fillings via this new phenomenon.

Contact invariants in bordered Floer homology

Series
Geometry Topology Seminar
Time
Monday, November 18, 2024 - 15:00 for 1 hour (actually 50 minutes)
Location
University Of Georgia
Speaker
Hyunki MinUCLA

In this talk, we introduce contact invariants in bordered sutured Floer homology. Given a contact 3-manifold with convex boundary, we apply a result of Zarev to derive contact invariants in the bordered sutured modules BSA and BSD. We show that these invariants satisfy a pairing theorem, which is a bordered extension of the Honda-Kazez-Matic gluing map for sutured Floer homology. We also show that there is a correspondence between certain A-infinity operations in bordered modules and bypass attachment maps in sutured Floer homology. As an application, we characterize the Stipsicz-Vertesi map in terms of A-infinity action on CFA. If time permits, we will further discuss applications to contact surgery.

Mathematical and Numerical Understanding of Neural Networks: From Representation to Learning Dynamics

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 18, 2024 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005 and https://gatech.zoom.us/j/94954654170
Speaker
Hongkai ZhaoDuke University

In this talk I will present both mathematical and numerical analysis as well as experiments to study a few basic computational issues in using neural network to approximate functions: (1) the stability and accuracy, (2) the learning dynamics and computation cost, and (3) structured and balanced approximation. These issues are investigated for both approximation and optimization in asymptotic and non-asymptotic regimes.

Syzygies and parking functions from hypergraph polytopes

Series
Algebra Seminar
Time
Monday, November 18, 2024 - 11:30 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Anton DochtermannTexas State University

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

For a connected graph G, the set of G-parking functions are integer sequences counted by spanning trees that arise in the theory of chip-firing on G.  They can also be defined as the standard monomials of a `G-parking function ideal', whose homological properties have interesting combinatorial interpretations. We extend these constructions to the setting of hypergraphs, where edges can have multiple vertices. We study algebraic and combinatorial aspects of parking functions in this context, employing generalized notions of acyclic orientations and spanning trees. Minimal cellular resolutions of the underlying ideals can be understood in terms of certain generalized permutohedra. This is joint work with Ayah Almousa and Ben Smith, as well as an REU project with Timothy Blanton, Isabelle Hong, Suho Oh, and Zhan Zhan.

New results on the Erdős-Rogers function

Series
Time
Friday, November 15, 2024 - 15:15 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Dhruv MubayiUniversity of Illinois at Chicago

Given integers $1 < s < t$, what is the maximum size of a $K_s$-free subgraph that every $n$ vertex $K_t$-free graph is guaranteed to contain? This problem was posed by Hajnal, Erdős and Rogers in the 1960s as a way to generalize classical graph Ramsey numbers (which corresponds to the case $s=2$). We  prove almost optimal results in the case $t=s+1$ using recent constructions in Ramsey theory. We also consider the problem where we replace $K_s$ and $K_t$ by arbitrary graphs $H$ and $G$ and discover several interesting new phenomena.  This is joint work with Jacques Verstraete.

Dependent random choice, statistical physics, and the local rank of tensors

Series
Other Talks
Time
Friday, November 15, 2024 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Daniel ZhuPrinceton

We present a lemma, inspired by dependent random choice and sampling procedures from statistical physics, for finding dense structure in arbitrary $d$-partite $d$-uniform hypergraphs. We will then discuss how this lemma leads to the concept of local rank, a notion of tensor rank which is instrumental in proving a "structure vs. randomness" result for tensors (and by extension, polynomials): namely, a relation between the partition and analytic ranks of tensors over finite fields. This is joint work with Guy Moshkovitz.

A criterion for crystallization in hard-core lattice particle systems

Series
Math Physics Seminar
Time
Friday, November 15, 2024 - 11:00 for 1 hour (actually 50 minutes)
Location
Clough 280
Speaker
Ian JauslinRutgers University

As is well known, many materials freeze at low temperatures. Microscopically,
  this means that their molecules form a phase where there is long range order
  in their positions. Despite their ubiquity, proving that these freezing
  transitions occur in realistic microscopic models has been a significant
  challenge, and it remains an open problem in continuum models at positive
  temperatures. In this talk, I will focus on lattice particle models, in which
  the positions of particles are discrete, and discuss a general criterion
  under which crystallization can be proved to occur. The class of models that
  the criterion applies to are those in which there is *no sliding*, that is,
  particles are largely locked in place when the density is large. The tool
  used in the proof is Pirogov-Sinai theory and cluster expansions. I will
  present the criterion in its general formulation, and discuss some concrete
  examples. This is joint work with Qidong He and Joel L. Lebowitz.

Limiting Expectations: The Central Limit Phenomenon

Series
Stochastics Seminar
Time
Thursday, November 14, 2024 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
David Grzybowski

The normal distribution appears in a wide and disparate set of circumstances, and this ubiquity is explained by the central limit phenomenon. This talk will explore several forms of the central limit theorem, as well as different methods of proof. Highlights include a new method of moments proof for entries on a hypersphere sphere and results for traces of large random matrices utilizing the Malliavin-Stein method.

Additive energies of subsets of discrete cubes

Series
Number Theory
Time
Wednesday, November 13, 2024 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Fernando Xuancheng ShaoUniversity of Kentucky

 For a positive integer , define  to be the smallest number such that the additive energy of any subset and any  is at most . In this talk, I will survey recent results on bounds for , explore the connections with (variants of) the Hausdorff-Young inequality in analysis and with the Balog-Szemeredi-Gowers theorem in additive combinatorics, and then discuss new results on the asymptotic behavior of  as .

Pages