### TBA by Lingjiong Zhu

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, October 18, 2021 - 14:00 for
- Location
- TBD
- Speaker
- Lingjiong Zhu – FSU

TBA

- You are here:
- GT Home
- Home
- News & Events

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, October 18, 2021 - 14:00 for
- Location
- TBD
- Speaker
- Lingjiong Zhu – FSU

TBA

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, September 20, 2021 - 14:00 for 1 hour (actually 50 minutes)
- Location
- TBD
- Speaker
- Florian Schaefer – GT CSE

TBA

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, September 13, 2021 - 14:00 for 1 hour (actually 50 minutes)
- Location
- ONLINE
- Speaker
- Prof. Rose Yu – UCSD

TBA

- Series
- Combinatorics Seminar
- Time
- Friday, July 23, 2021 - 15:00 for 1 hour (actually 50 minutes)
- Location
- https://bluejeans.com/751242993/6673
- Speaker
- Maksim Zhukovskii – Moscow 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.

- Series
- Dissertation Defense
- Time
- Friday, July 9, 2021 - 11:00 for 1 hour (actually 50 minutes)
- Location
- ONLINE: Bluejeans: https://gatech.bluejeans.com/6489493135
- Speaker
- Yian Yao – Georgia Tech – yyao93@gatech.edu

In this dissertation, we present, analyze, and implement a quadratically convergent algorithm to compute the invariant circle and the foliation by stable manifolds for 2-dimensional maps. The 2-dimensional maps we are considering are mainly motivated by oscillators subject to periodic perturbation.

The algorithm is based on solving an invariance equation using a quasi-Newton method, and the algorithm works irrespective of whether the dynamics on the invariant circle conjugates to a rotation or is phase-locked, and thus we expect only finite regularity on the invariant circle but analytic on the stable manifolds.

More specifically, the dissertation is divided into the following two parts.

In the theoretical part, we derive our quasi-Newton algorithm and prove that starting from an initial guess that satisfies the invariance equation very approximately, the algorithm converges quadratically to a true solution which is close to the initial guess. The proof of the convergence is based on an abstract Nash-Moser Implicit Function Theorem specially tailored for this problem.

In the numerical part, we discuss some implementation details regarding our algorithm and implemented it on the dissipative standard map. We follow different continuation paths along the perturbation and drift parameter and explore the "bundle merging" scenario when the hyperbolicity of the map losses due to the increase of the perturbation. For non-resonant eigenvalues, we also generalize the algorithm to 3-dimension and implemented it on the 3-D Fattened Arnold Family.

- Series
- Dissertation Defense
- Time
- Thursday, July 8, 2021 - 10:00 for 2 hours
- Location
- https://bluejeans.com/675272964/8610
- Speaker
- Hassan Attarchi – Georgia Institute of Technology – hattarchi@gatech.edu

This thesis consists of four works in dynamical systems with a focus on billiards. In the first part, we consider open dynamical systems, where there exists at least a ``hole" of positive measure in the phase space which some portion of points in phase space escapes through that hole at each iterate of the dynamical system map. Here, we study the escape rate (a quantity that presents at what rate points in phase space escape through the hole) and various estimations of the escape rate of an open dynamical system. We uncover a reason why the escape rate is faster than expected, which is the convexity of the function defining escape rate. Moreover, exact computations of escape rate and its estimations are present for the skewed tent map and Arnold’s cat map.

In the second part of the thesis, we study physical billiards where the moving particle has a finite nonzero size. In contrast to mathematical billiards where a trajectory is excluded when it hits a corner point of the boundary, in physical billiards reflection of the physical particle (a ball) off a visible corner point is well-defined. Initially, we study properties of such reflections in a physical billiards. Our results confirm that the reflection considered in the literature about physical billiards are indeed no-slip friction-free (elastic) collisions.

In the third part of the thesis, we study physical Ehrenfests' wind-tree models, where we show that physical wind-tree models are dynamically richer than the well-known Lorentz gas model. More precisely, when we replace the point particle by a physical one (a ball), the wind-tree models show a new superdiffusive regimes that never been observed in any other model such as Lorentz gas.

Finally, we prove that typical physical polygonal billiard is hyperbolic at least on a subset of positive measure and therefore has a positive Kolmogorov-Sinai entropy for any positive radius of the moving particle.

- Series
- Geometry Topology Seminar
- Time
- Wednesday, July 7, 2021 - 14:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Hannah Turner – University of Texas, Austin

A 3-manifold is called an L-space if its Heegaard Floer homology is "simple." No characterization of all such "simple" 3-manifolds is known. Manifolds obtained as the double-branched cover of alternating knots in the 3-sphere give examples of L-spaces. In this talk, I'll discuss the search for L-spaces among higher index branched cyclic covers of knots. In particular, I'll give new examples of knots whose branched cyclic covers are L-spaces for every index n. I will also discuss an application to "visibility" of certain periodic symmetries of a knot. Some of this work is joint with Ahmad Issa.

- Series
- Dissertation Defense
- Time
- Wednesday, July 7, 2021 - 10:30 for 2 hours
- Location
- BlueJeans: https://gatech.bluejeans.com/8515708345
- Speaker
- Renyi Chen – Georgia Tech – renyi@gatech.edu

This thesis focuses on analyzing the physics and designing multiscale methods for nonlinear dynamics in mechanical systems, such as those in astronomy. The planetary systems (e.g. the Solar System) are of great interest as rich dynamics of different scales contribute to many interesting physics. Outside the Solar System, a bursting number of exoplanets have been discovered in recent years, raising interest in understanding the effects of the spin dynamics to the habitability. In part I of this thesis, we investigate the spin dynamics of circumbinary exoplanets, which are planets that orbit around stellar binaries. We found that habitable zone planets around the stellar binaries in near coplanar orbits may hold higher potential for stable climate compared to their single star analogues. And in terms of methodology, secular theory of the slow dominating dynamics is calculated via averaging. Beyond analyzing the dynamics mathematically, to simulate the spin-orbit dynamics for long term accurately, symplectic Lie-group (multiscale) integrators are designed to simulate systems consisting of gravitationally interacting rigid bodies in part II of the thesis. Schematically, slow and fast scales are tailored to compose efficient algorithms. And the integrators are tested via our package GRIT. For the systems that are almost impossible to simulate (e.g. the Solar System with the asteroid belt), how can we understand the dynamics from the observations? In part III, we consider the learning and prediction of nonlinear time series purely from observations of symplectic maps. We represent the symplectic map by a generating function, which we approximate by a neural network (hence the name GFNN). And we will prove, under reasonable assumptions, the global prediction error grows at most linearly with long prediction time as the prediction map is symplectic.

- Series
- Dissertation Defense
- Time
- Wednesday, June 30, 2021 - 15:00 for 1 hour (actually 50 minutes)
- Location
- ONLINE
- Speaker
- Cvetelina Hill – Georgia Tech – cvetelina.hill@gatech.edu

**Please Note:** BlueJeans link: https://bluejeans.com/298474885/8484

This dissertation consists of various topics in nonlinear algebra. Particularly, it focuses on solving algebraic problems and polynomial systems through the use of combinatorial tools. We give a broad introduction and discuss connections to applied algebraic geometry, polyhedral, and tropical geometry. The individual topics discussed are as follows:

- Interaction between tropical and classical convexity, with a focus on the tropical convex hull of convex sets and polyhedral complexes. Amongst other results, we characterize tropically convex sets in any dimension, and give a combinatorial description for the dimension of the tropical convex hull of an ordinary affine space.
- The steady-state degree and mixed volume of a chemical reaction network. We present three case studies of infinite families of networks. For each family, we give a formula for the steady-state degree and mixed volume of the corresponding polynomial system.
- Methods for finding the solution set of a generic system in a family of polynomial systems with parametric coefficients. We present a framework for describing monodromy-based solvers in terms of decorated graphs.

Thesis may be viewed here.

BlueJeans link

- Series
- Dissertation Defense
- Time
- Wednesday, June 16, 2021 - 12:00 for 1.5 hours (actually 80 minutes)
- Location
- ONLINE
- Speaker
- Timothy Duff – GA Tech – tduff3@gatech.edu

Final doctoral examination and defense of dissertation of Timothy Duff, June 16, 2021

Date: June 16, 2021, 12:00pm EST

Bluejeans Link is https://bluejeans.com/151393219/

Title: Applications of monodromy in solving polynomial systems

Advisor: Dr. Anton Leykin, School of Mathematics, Georgia Institute of Technology

Committee:

Dr. Matthew Baker, School of Mathematics, Georgia Institute of Technology

Dr. Gregory Blekherman, School of Mathematics, Georgia Institute of Technology

Dr. Richard Peng, School of Computer Science, Georgia Institute of Technology

Dr. Rekha Thomas, Department of Mathematics, University of Washington

Dr. Josephine Yu, School of Mathematics, Georgia Institute of Technology

Reader: Dr. Rekha Thomas, Department of Mathematics, University of Washington

---------------------------------------------------------------------------------------------------------

The thesis is available here:

fhttps://timduff35.github.io/timduff35/thesis.pdf

Summary:

Polynomial systems of equations that occur in applications frequently have a special structure. Part of that structure can be captured by an associated Galois/monodromy group. This makes numerical homotopy continuation methods that exploit this monodromy action an attractive choice for solving these systems; by contrast, other symbolic-numeric techniques do not generally see this structure. Naturally, there are trade-offs when monodromy is chosen over other methods. Nevertheless, there is a growing literature demonstrating that the trade can be worthwhile in practice.

In this thesis, we consider a framework for efficient monodromy computation which rivals the state-of-the-art in homotopy continuation methods. We show how its implementation in the package MonodromySolver can be used to efficiently solve challenging systems of polynomial equations. Among many applications, we apply monodromy to computer vision---specifically, the study and classification of minimal problems used in RANSAC-based 3D reconstruction pipelines. As a byproduct of numerically computing their Galois/monodromy groups, we observe that several of these problems have a decomposition into algebraic subproblems. Although precise knowledge of such a decomposition is hard to obtain in general, we determine it in some novel cases.

- Offices & Departments
- News Center
- Campus Calendar
- Special Events
- GreenBuzz
- Institute Communications
- Visitor Resources
- Campus Visits
- Directions to Campus
- Visitor Parking Information
- GTvisitor Wireless Network Information
- Georgia Tech Global Learning Center
- Georgia Tech Hotel & Conference Center
- Barnes & Noble at Georgia Tech
- Ferst Center for the Arts
- Robert C. Williams Paper Museum