Seminars and Colloquia by Series

Induced subgraphs and treewidth

Series
Graph Theory Seminar
Time
Tuesday, September 14, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location
ONLINE
Speaker
Sophie SpirklUniversity of Waterloo

Treewidth, introduced by Robertson and Seymour in the graph minors series, is a fundamental measure of the complexity of a graph. While their results give an answer to the question, “what minors occur in graphs of large treewidth?,” the same question for induced subgraphs is still open. I will talk about some conjectures and recent results in this area. Joint work with Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Pawel Rzazewski, Kristina Vuskovic.

(Differential) primary decomposition of modules

Series
Algebra Seminar
Time
Tuesday, September 14, 2021 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Justin ChenICERM/Georgia Tech

Primary decomposition is an indispensable tool in commutative algebra, both theoretically and computationally in practice. While primary decomposition of ideals is ubiquitous, the case for general modules is less well-known. I will give a comprehensive exposition of primary decomposition for modules, starting with a gentle review of practical symbolic algorithms, leading up to recent developments including differential primary decomposition and numerical primary decomposition. Based on joint works with Yairon Cid-Ruiz, Marc Harkonen, Robert Krone, and Anton Leykin.

Incorporating Symmetry for Improved Deep Dynamics Learning

Series
Applied and Computational Mathematics Seminar
Time
Monday, September 13, 2021 - 14:00 for 1 hour (actually 50 minutes)
Location
https://bluejeans.com/457724603/4379
Speaker
Prof. Rose YuUCSD

While deep learning has been used for dynamics learning, limited physical accuracy and an inability to generalize under distributional shift limit its applicability to real world. In this talk, I will demonstrate how to incorporate symmetries into deep neural networks and significantly improve the physical consistency, sample efficiency, and generalization in learning dynamics. I will showcase the applications of these models to challenging problems such as turbulence forecasting and trajectory prediction for autonomous vehicles.

A curve graph for Artin groups

Series
Geometry Topology Seminar
Time
Monday, September 13, 2021 - 14:00 for 1 hour (actually 50 minutes)
Location
online
Speaker
Rose Morris-WrightUCLA

Please Note: Meeting URL https://bluejeans.com/770198652/3456?src=join_info Meeting ID 770 198 652 Participant Passcode 3456 Want to dial in from a phone? Dial one of the following numbers: +1.408.419.1715 (United States (San Jose)) +1.408.915.6290 (United States (San Jose)) (see all numbers - https://www.bluejeans.com/numbers) Enter the meeting ID and passcode followed by # Connecting from a room system? Dial: bjn.vc or 199.48.152.152 and enter your meeting ID & passcode

Artin groups are a generalization of braid groups, first defined by Tits in the 1960s. While specific types of Artin groups have many of the same properties as braid groups, other examples of Artin groups are still very mysterious. Braid groups are can be thought of as the mapping class groups of a punctured disc. The combinatorial and geometric structure of the mapping class group is reflected in a Gromov-hyperbolic space called the curve graph of the mapping class group. Using the curve graph of the mapping class group of a punctured disc, we can define a graph associated to a given braid group. In this talk, I will discuss how to generalize this construction to more general classes of Artin groups. I will also discuss the current known properties of this graph and further open questions about what properties of the curve graph carry over to this new graph. 

A new approach to the Fourier extension problem for the paraboloid

Series
Analysis Seminar
Time
Wednesday, September 8, 2021 - 03:30 for 1 hour (actually 50 minutes)
Location
ONLINE
Speaker
Itamar OliveiraCornell University

An equivalent formulation of the Fourier Extension (F.E.) conjecture for a compact piece of the paraboloid states that the F.E. operator maps $ L^{2+\frac{2}{d}}([0,1]^{d}) $ to $L^{2+\frac{2}{d}+\varepsilon}(\mathbb{R}^{d+1}) $ for every $\varepsilon>0 $. It has been fully solved only for $ d=1 $ and there are many partial results in higher dimensions regarding the range of $ (p,q) $ for which $L^{p}([0,1]^{d}) $ is mapped to $ L^{q}(\mathbb{R}^{d+1}) $. In this talk, we will take an alternative route to this problem: one can reduce matters to proving that a model operator satisfies the same mapping properties, and we will show that the conjecture holds in higher dimensions for tensor functions, meaning for all $ g $  of the form $ g(x_{1},\ldots,x_{d})=g_{1}(x_{1})\cdot\ldots\cdot g_{d}(x_{d}) $. Time permitting, we will also address multilinear versions of the statement above and get similar results, in which we will need only one of the many functions involved in each problem to be of such kind to obtain the desired conjectured bounds, as well as almost sharp bounds in the general case. This is joint work with Camil Muscalu.

Polynomial $\chi$-binding functions for $t$-broom-free graphs

Series
Graph Theory Seminar
Time
Tuesday, September 7, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Joshua SchroederGeorgia Institute of Technology

For any positive integer $t$, a $t$-broom is a graph obtained from $K_{1,t+1}$ by subdividing an edge once.  In this paper, we show that, for graphs $G$ without induced $t$-brooms, we have $\chi(G) =  o(\omega(G)^{t+1})$, where  $\chi(G)$ and $\omega(G)$ are the chromatic number and clique number of $G$, respectively. When $t=2$, this answers a question of  Schiermeyer and Randerath. Moreover, for $t=2$, we strengthen the bound on $\chi(G)$ to $7.5\omega(G)^2$, confirming a conjecture of Sivaraman. For $t\geq 3$ and {$t$-broom, $K_{t,t}$}-free graphs, we improve the bound to $o(\omega^{t-1+\frac{2}{t+1}})$. Joint work with Xiaonan Liu, Zhiyu Wang, and Xingxing Yu.

Long cycles in essentially 4-connected projective-planar graphs

Series
Graph Theory Seminar
Time
Tuesday, August 31, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Michael WigalGeorgia Institute of Technology

Tutte paths have a critical role in the study of Hamiltonicity for 4-connected planar and other graph classes. We show quantitative Tutte path results in which we bound the number of bridges of the path. A corollary of this result is near optimal circumference bounds for essentially 4-connected planar and projective-planar graphs. Joint work with Xingxing Yu.

Chi-slice 3-braid links

Series
Geometry Topology Seminar
Time
Monday, August 30, 2021 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jonathan SimoneGeorgia Tech

A link L in the 3-sphere is called chi-slice if it bounds a properly embedded surface F in the 4-ball with Euler characteristic 1. If L is a knot, then this definition coincides with the usual definition of sliceness. One feature of such a link L is that if the determinant of L is nonzero, then the double cover of the 3-sphere branched over L bounds a rational homology ball. In this talk, we will explore the chi-sliceness of 3-braid links. In particular, we will construct explicit families of chi-slice quasi-alternating 3-braids using band moves and we will obstruct the chi-sliceness of almost all other quasi-alternating 3-braid links by showing that their double branched covers do not bound rational homology 4-balls. This is a work in progress joint with Vitaly Brejevs.

Domains of Analyticity and Gevrey estimates in weakly dissipative systems.

Series
Dissertation Defense
Time
Friday, August 27, 2021 - 12:00 for 1 hour (actually 50 minutes)
Location
ONLINE
Speaker
Adrian Perez BustamanteGeorgia Tech

We consider the problem of following quasi-periodic tori in perturbations of Hamiltonian systems which involve friction and external forcing.
In the first part, we study a family of dissipative standard maps of the cylinder for which the dissipation is a function of a small complex parameter of perturbation, $\varepsilon$.  We compute perturbative expansions formally in $\varepsilon$ and use them to estimate the shape of the domains of analyticity of invariant circles as functions of $\varepsilon$. We also give evidence that the functions might belong to a Gevrey class. The numerical computations we perform support conjectures on the shape of the domains of analyticity.

In the second part, we study rigorously the(divergent) series of formal expansions of the torus obtained using Lindstedt method.   We show that, for some systems in the literature, the series is Gevrey. We hope that the method of proof can be of independent interest: We develop KAM estimates for the divergent series. In contrast with the regular KAM method, we loose control of all the domains, so that there is no convergence, but we can generate enough control to show that the series is Gevrey.

https://bluejeans.com/417759047/0103

Extremal independence and applications in random graphs.

Series
Combinatorics Seminar
Time
Friday, July 23, 2021 - 15:00 for 1 hour (actually 50 minutes)
Location
https://bluejeans.com/751242993/6673
Speaker
Maksim ZhukovskiiMoscow Institute of Physics and Technology

Let, for every positive integer d, a tuple of events A_1,...,A_d be given. Let X_d be the number of events that occur. We state new sufficient conditions for the following extremal independence property: |P(X_d=0)-\prod_{i=1}^d(1-P(A_i))|\to 0. These conditions imply a series of results on asymptotic distributions of certain maximum statistics. In particular, for the maximum number X_n of cliques sharing one vertex in G(n,p), we find sequences a_n and b_n such that (X_n-a_n)/b_n converges in distribution to a standard Gumbel random variable.

Pages