Seminars and Colloquia by Series

Automorphisms of the fine 1-curve graph

Series
Geometry Topology Seminar
Time
Monday, August 28, 2023 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Roberta ShapiroGeorgia Tech

The fine curve graph of a surface S was introduced by Bowden–Hensel–Webb in 2019 to study the diffeomorphism group of S. We consider a variant of this graph, called the fine 1-curve graph, whose vertices are essential simple closed curves and edges connect curves that intersect in at most one point. Building on the works of Long–Margalit–Pham–Verberne–Yao and Le Roux–Wolff, we show that the automorphism group of the fine 1-curve graph is isomorphic to the homeomorphism group of S. This is joint work with Katherine W. Booth and Daniel Minahan.

Computing isotopy type of real zero sets faster for n-variate (n+k)-nomials

Series
Algebra Seminar
Time
Monday, August 28, 2023 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Weixun DengTexas A&M
Suppose f is a Laurent polynomial in n variables with degree d, exactly (n+2) monomial terms, and all its coefficients in {-H,...,H} for some positive integer H. Suppose further that the exponent vectors of f do not all lie in an affine hyperplane: Such a set of exponent vectors is referred to as a circuit. We prove that the positive zero set of f is isotopic to the real zero set of an explicit n-variate quadric q, and give a fast algorithm to explicitly compute q: The bit complexity is (log(dH))^O(n). The best previous bit-complexity bounds were of the form (dlog(H))^{\Omega(n)} (to compute a data structure called a roadmap). Our results also extend to real zero sets of n-variate exponential sums over circuits. Finally, we discuss how to approach the next case up: n-variate polynomials with exactly (n+3) terms.

An introduction to the combinatorial topology of surfaces

Series
Geometry Topology Seminar Pre-talk
Time
Monday, August 28, 2023 - 12:45 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Roberta ShapiroGeorgia Tech

This talk will be an introduction to the theory of surfaces, some tools we use to study surfaces, and some uses of surfaces in "real life". In particular, we will discuss the mapping class group and the curve complex. This talk will be aimed at an audience with a minimal background in low-dimensional topology. 

An Introduction to Teichmüller Theory

Series
Geometry Topology Student Seminar
Time
Wednesday, August 23, 2023 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Alex NolteRice University

Say you’ve got an (orientable) surface S and you want to do geometry with it. Well, the complex plane C has dimension 2, so you might as well try to model S on C and see what happens. The objects you get from following this thought are called complex structures. It turns out that most surfaces have a rich but manageable amount of genuinely different complex structures. I’ll focus in this talk on how to think about comparing and deforming complex structures on S. I’ll explain the remarkable result that there are highly structured “best” maps between (marked) complex structures, and how this can be used to show the right space of complex structures on S is a finite-dimensional ball. This is known as Teichmüller’s theorem, and I’ll be following Bers’ proof.

Non-positive Stein-fillable open books of genus one

Series
Geometry Topology Seminar
Time
Monday, August 21, 2023 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Vitalijs BrejevsUniversity of Vienna

Contact 3-manifolds arise organically as boundaries of symplectic 4-manifolds, so it’s natural to ask: Given a contact 3-manifold Y, does there exist a symplectic 4-manifold X filling Y in a compatible way? Stein fillability is one such notion of compatibility that can be explored via open books: representations of a 3-manifold by means of a surface with boundary and its self-diffeomorphism, called a monodromy. I will discuss joint work with Andy Wand in which we exhibit first known Stein-fillable contact manifolds whose supporting open books of genus one have non-positive monodromies. This settles the question of correspondence between Stein fillings and positive monodromies for open books of all genera. Our methods rely on a combination of results of J. Conway, Lecuona and Lisca, and some observations about lantern relations in the mapping class group of the twice-punctured torus.

Appearance of multistability and hydra effect in a discrete-time epidemic model

Series
Other Talks
Time
Friday, August 18, 2023 - 13:30 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Lauren ChildsVirginia Tech

Please Note: This seminar will be delivered in a hybrid Zoom format. The in-person version is held in Skiles 005 while the Zoom version is held at this link: https://gatech.zoom.us/j/99424341824

One-dimensional discrete-time population models, such as Logistic or Ricker growth, can exhibit periodic and chaotic dynamics. Incorporating epidemiological interactions through the addition of an infectious class causes an interesting complexity of new behaviors. Here, we examine a two-dimensional susceptible-infectious (SI) model with underlying Ricker population growth. In particular, the system with infection has a distinct bifurcation structure from the disease-free system. We use numerical bifurcation analysis to determine the influence of infection on the types and appearance of qualitatively distinct long-time dynamics. We find that disease-induced mortality leads to the appearance of multistability, such as stable four-cycles and chaos dependent upon the initial condition. Furthermore, previous work showed that infection that alters the ability to reproduce can lead to unexpected increases in total population size. A similar phenomenon is seen in some models where an increase in population size with a decreased growth rate occurs, known as the ‘hydra effect.’ Thus, we examine the appearance and extent of the hydra effect, particularly when infection is introduced during cyclic or chaotic population dynamics.

Knots in overtwisted contact manifolds

Series
Geometry Topology Seminar
Time
Wednesday, July 12, 2023 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Rima ChatterjeeUniversity of Cologne

Knots in contact manifolds are interesting objects to study. In this talk, I will focus on knots in overtwisted manifolds. There are two types of knots in an overtwisted manifold, one with overtwisted complement (known as loose) and one with tight complement (known as non-loose). Not very surprisingly, non-loose knots behave very mysteriously. They are interesting in their own right as we still do not understand them well. But also one might want to study them because surgery on them produces tight contact structures and understanding tight contact structures is a major problem in the contact world. I'll give a brief history on these knots and discuss some of their classification and structure problems and how these problems differ from the classification/ structure problems of knots in tight manifolds.
 

Dissertation defense: Constructions and Invariants of High-Dimensional Legendrian Submanifolds

Series
Time
Friday, July 7, 2023 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Agniva RoyGEORGIA INSTITUTE OF TECHNOLOGY

The study of contact and symplectic manifolds has relied heavily on understanding Legendrian and Lagrangian submanifolds in them -- both for constructing the manifolds using these submanifolds, and for computing invariants of the ambient space in terms of invariants of the submanifolds. This thesis explores the construction of Legendrian submanifolds in high dimensional contact manifolds (greater than 3) in two directions. In one, using open book decompositions, we generalise a doubling construction defined by Ekholm and show that the Legendrians obtained are trivial. In the second, which is joint work in progress with Hughes, we use the doubling and twist spun constructions to build a large family of Legendrians, compute their sheaf-theoretic invariants to distinguish them using techniques of Casals-Zaslow, and study their exact Lagrangian fillability properties.

Zoom link:

https://gatech.zoom.us/j/93109756512?pwd=Skljb0tVdjZVNEUvSm9tNnFHZFREUT09 

Matroids, Matrices, and Partial Hyperstructures

Series
Dissertation Defense
Time
Wednesday, July 5, 2023 - 02:00 for 1.5 hours (actually 80 minutes)
Location
Skiles 006
Speaker
Tianyi ZhangGeorgia Tech

Please Note: Zoom Link: https://gatech.zoom.us/j/7776548887?pwd=SFEySmpVUW9FckxJVEZRY2hUbUVOQT09 Committee Members: Matt Baker (Co-advisor) Oliver Lorscheid (Co-advisor) Anton Leykin Josephine Yu Xingxing Yu

I will talk about the application of algebra and algebraic geometry to matroid theory. Baker and Bowler developed the notions of weak and strong matroids over tracts. Later, Baker and Lorscheid developed the notion of foundation of a matroid, which characterize the representability of the matroid. I will introduce a variety of topics under this theme. First, I will talk about a condition which is sufficient to guarantee that the notions of strong and weak matroids coincide. Next, I will describe a software program that computes all representations of matroids over a field, based on the theory of foundations. Finally, I will define a notion of rank for matrices over tracts in order to get uniform proofs of various results about ranks of matrices over fields.

Strong bounds for three-term progressions

Series
ACO Colloquium
Time
Friday, June 30, 2023 - 11:00 for 1 hour (actually 50 minutes)
Location
Klaus 2100
Speaker
Raghu MekaUCLA

Suppose you have a set S of integers from {1,2,...,N} that contains at least N / C elements. Then for large enough N, must S contain three equally spaced numbers (i.e., a 3-term arithmetic progression)?

In 1953, Roth showed this is the case when C is roughly (log log N). Behrend in 1946 showed that C can be at most exp(sqrt(log N)). Since then, the problem has been a cornerstone of the area of additive combinatorics. Following a series of remarkable results, a celebrated paper from 2020 due to Bloom and Sisask improved the lower bound on C to C = (log N)^(1+c) for some constant c > 0.

This talk will describe a new work showing that C can be as big as exp((log N)^0.08), thus getting closer to Behrend's construction. Based on joint work with Zander Kelley

Pages