Seminars and Colloquia by Series

On the coequal values of total chromatic number and chromatic index.

Series
Graph Theory Seminar
Time
Tuesday, November 15, 2022 - 15:45 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Yanli HaoGeorgia State University

The chromatic index $\chi'(G)$ of a graph $G$ is the least number of colors assigned to the edges of $G$ such that no two adjacent edges receive the same color. The total chromatic number $\chi''(G)$ of a graph $G$ is the least number of colors assigned to the edges and vertices of $G$ such that no two adjacent edges receive the same color, no two adjacent vertices receive the same color and no edge has the same color as its two endpoints. The chromatic index and the total chromatic number are two of few fundamental graph parameters, and their correlation has always been a subject of intensive study in graph theory.

By definition, $\chi'(G) \le \chi''(G)$ for every graph $G$. In 1984,  Goldberg conjectured that for any multigraph $G$, if $\chi'(G) \ge \Delta(G) +3$ then $\chi''(G) = \chi'(G)$. We show that Goldberg's conjecture is asymptotically true. More specifically,  we prove that for a multigraph $G$ with maximum degree $\Delta$ sufficiently large, $\chi''(G) = \chi'(G)$ provided $\chi'(G) \ge \Delta + 10\Delta^{35/36}$.  When $\chi'(G) \ge \Delta(G) +2$, the chromatic index $\chi'(G)$ is completely determined by the fractional chromatic index. Consequently,   the total chromatic number $\chi''(G)$ can be computed in polynomial-time in this case.

Global-in-space stability of self-similar blowup for supercritical wave maps

Series
PDE Seminar
Time
Tuesday, November 15, 2022 - 15:00 for 1 hour (actually 50 minutes)
Location
Online: https://gatech.zoom.us/j/95574359880?pwd=cGpCa3J1MFRkY0RUeU1xVFJRV0x3dz09
Speaker
Irfan GlogićUniversity of Vienna

A distinctive feature of nonlinear evolution equations is the possibility of breakdown of solutions in finite time. This phenomenon, which is also called singularity formation or blowup, has both physical and mathematical significance, and, as a consequence, predicting blowup and understanding its nature is a central problem of the modern analysis of nonlinear PDEs.

In this talk we concentrate on wave maps – a geometric nonlinear wave equation – and we discuss the existence and stability of self-similar solutions, as in all higher dimensions they appear to drive the generic blowup behavior. We outline a novel framework for studying global-in-space stability of such solutions; we then men-tion some long-awaited results that we thereby obtained, and, finally, we discuss the new mathematical challenges that our approach generates.

Geometric Equations for Matroid Varieties

Series
SIAM Student Seminar
Time
Tuesday, November 15, 2022 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Ashley K. WheelerSchool of Mathematics

Each point x in Gr(r, n) corresponds to an r × n matrix Ax which gives rise to a matroid Mx on its columns. Gel’fand, Goresky, MacPherson, and Serganova showed that the sets {y ∈ Gr(r, n)|My = Mx} form a stratification of Gr(r, n) with many beautiful properties. However, results of Mnëv and Sturmfels show that these strata can be quite complicated, and in particular may have arbitrary singularities. We study the ideals Ix of matroid varieties, the Zariski closures of these strata. We construct several classes of examples based on theorems from projective geometry and describe how the Grassmann-Cayley algebra may be used to derive non-trivial elements of Ix geometrically when the combinatorics of the matroid is sufficiently rich.

Graph Analogues of Big Mapping Class Groups: Coarse Geometry by George Domat

Series
Geometry Topology Seminar
Time
Monday, November 14, 2022 - 14:00 for 1 hour (actually 50 minutes)
Location
Speaker
George DomatRice University

We will introduce an analogue of big mapping class groups as defined by Algom-Kfir and Bestvina which hopes to answer the question: What is “Big Out(Fn)”? This group will consist of proper homotopy classes of proper homotopy equivalences of locally finite, infinite graphs. We will then discuss some classification theorems related to the coarse geometry of these groups. This is joint work with Hannah Hoganson and Sanghoon Kwak.

Inference for Gaussian processes on compact Riemannian manifolds

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 14, 2022 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005 and https://gatech.zoom.us/j/98355006347
Speaker
Didong LiUNC Chapel Hill

Gaussian processes (GPs) are widely employed as versatile modeling and predictive tools in spatial statistics, functional data analysis, computer modeling and diverse applications of machine learning. They have been widely studied over Euclidean spaces, where they are specified using covariance functions or covariograms for modelling complex dependencies. There is a growing literature on GPs over Riemannian manifolds in order to develop richer and more flexible inferential frameworks. While GPs have been extensively studied for asymptotic inference on Euclidean spaces using positive definite covariograms, such results are relatively sparse on Riemannian manifolds. We undertake analogous developments for GPs constructed over compact Riemannian manifolds. Building upon the recently introduced Matérn covariograms on a compact Riemannian manifold, we employ formal notions and conditions for the equivalence of two Matérn Gaussian random measures on compact manifolds to derive the microergodic parameters and formally establish the consistency of their maximum likelihood estimates as well as asymptotic optimality of the best linear unbiased predictor.

Cohomology of moduli spaces of curves

Series
Algebra Seminar
Time
Monday, November 14, 2022 - 13:30 for 1 hour (actually 50 minutes)
Location
Clough 125 Classroom
Speaker
Sam PayneThe University of Texas, Austin

Cohomology groups of moduli spaces of curves are fruitfully studied from several mathematical perspectives, including geometric group theory, stably homotopy theory, and quantum algebra.  Algebraic geometry endows these cohomology groups with additional structures (Hodge structures and Galois representations), and the Langlands program makes striking predictions about which such structures can appear.  In this talk, I will present recent results inspired by, and in some cases surpassing, such predictions.  These include the vanishing of odd cohomology on moduli spaces of stable curves in degrees less than 11, generators and relations for H^11, and new constructions of unstable cohomology on M_g.  


Based on joint work with Jonas Bergström and Carel Faber; with Sam Canning and Hannah Larson; with Melody Chan and Søren Galatius; and with Thomas Willwacher. 

Cohomology of moduli spaces of curves

Series
Algebra Seminar
Time
Monday, November 14, 2022 - 13:30 for 1 hour (actually 50 minutes)
Location
Clough 125 Classroom
Speaker
Sam PayneThe University of Texas, Austin

Cohomology groups of moduli spaces of curves are fruitfully studied from several mathematical perspectives, including geometric group theory, stably homotopy theory, and quantum algebra.  Algebraic geometry endows these cohomology groups with additional structures (Hodge structures and Galois representations), and the Langlands program makes striking predictions about which such structures can appear.  In this talk, I will present recent results inspired by, and in some cases surpassing, such predictions.  These include the vanishing of odd cohomology on moduli spaces of stable curves in degrees less than 11, generators and relations for H^11, and new constructions of unstable cohomology on M_g.  


Based on joint work with Jonas Bergström and Carel Faber; with Sam Canning and Hannah Larson; with Melody Chan and Søren Galatius; and with Thomas Willwacher. 

Statistical and non-statistical dynamics in doubly intermittent maps

Series
CDSNS Colloquium
Time
Friday, November 11, 2022 - 15:30 for 1 hour (actually 50 minutes)
Location
In-person in Skiles 005
Speaker
Stefano LuzzattoAbdus Salam International Centre for Theoretical Physics (ICTP)

Please Note: In-person. Streaming available via zoom: Zoom link: https://us06web.zoom.us/j/83392531099?pwd=UHh2MDFMcGErbzFtMHBZTmNZQXM0dz09

 

We introduce a large family of one-dimensional full branch maps which generalize the classical “intermittency maps” by admitting two neutral fixed points and possibly also critical points and/or singularities. We study the statistical properties of these maps for various parameter values, including the existence (and non-existence) of physical measures, and their properties such as decay of correlations and limit theorems. In particular we describe a new mechanism for relatively persistent non-statistical chaotic dynamics. This is joint work with Douglas Coates and Muhammad Mubarak.

Self-Adjusting Data Structures

Series
ACO Student Seminar
Time
Friday, November 11, 2022 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Robert TarjanPrinceton University

Please Note: Robert Tarjan is the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University. He has held academic positions at Cornell, Berkeley, Stanford, and NYU, and industrial research positions at Bell Labs, NEC, HP, Microsoft, and Intertrust Technologies. He has invented or co-invented many of the most efficient known data structures and graph algorithms. He was awarded the first Nevanlinna Prize from the International Mathematical Union in 1982 for “for outstanding contributions to mathematical aspects of information science,” the Turing Award in 1986 with John Hopcroft for “fundamental achievements in the design and analysis of algorithms and data structures,” and the Paris Kanellakis Award in Theory and Practice in 1999 with Daniel Sleator for the invention of splay trees. He is a member of the U.S. National Academy of Sciences, the U. S. National Academy of Engineering, the American Academy of Arts and Sciences, and the American Philosophical Society.

Data structures are everywhere in computer software.  Classical data structures are specially designed to make each individual operation fast.  A more flexible approach is to design the structure so that it adapts to its use.  This idea has produced data structures that perform well in practice and have surprisingly good performance guarantees.  In this talk I’ll review some recent work on such data structures, specifically on self-adjusting search trees and self-adjusting heaps.

Pages