Seminars and Colloquia by Series

A Fox-Milnor Condition for 1-Solvable Links

Series
Geometry Topology Seminar
Time
Monday, November 8, 2021 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Shawn WilliamsRice University

A well known result of Fox and Milnor states that the Alexander polynomial of slice knots factors as f(t)f(t^{-1}), providing us with a useful obstruction to a knot being slice. In 1978 Kawauchi demonstrated this condition for the multivariable Alexander polynomial of slice links.  In this talk, we will present an extension of this result for the multivariable Alexander polynomial of 1-solvable links. (Note: This talk will be in person) 

Generalization Bounds for Sparse Random Feature Expansions

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 8, 2021 - 14:00 for 1 hour (actually 50 minutes)
Location
https://bluejeans.com/457724603/4379
Speaker
Giang TranUniversity of Waterloo

Random feature methods have been successful in various machine learning tasks, are easy to compute, and come with theoretical accuracy bounds. They serve as an alternative approach to standard neural networks since they can represent similar function spaces without a costly training phase. However, for accuracy, random feature methods require more measurements than trainable parameters, limiting their use for data-scarce applications or problems in scientific machine learning. This paper introduces the sparse random feature expansion to obtain parsimonious random feature models. Specifically, we leverage ideas from compressive sensing to generate random feature expansions with theoretical guarantees even in the data-scarce setting. We provide generalization bounds for functions in a certain class (that is dense in a reproducing kernel Hilbert space) depending on the number of samples and the distribution of features. The generalization bounds improve with additional structural conditions, such as coordinate sparsity, compact clusters of the spectrum, or rapid spectral decay. We show that the sparse random feature expansions outperform shallow networks in several scientific machine learning tasks. Applications to signal decompositions for music data, astronomical data, and various complicated signals are also provided.

Convex hypersurface theory in all dimensions

Series
Geometry Topology Working Seminar
Time
Friday, November 5, 2021 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Austin ChristianGeorgia Tech

In dimension three, Giroux developed the theory of convex surfaces in contact manifolds, and this theory has been used to prove many important results in contact geometry, as well as to establish deep connections with topology.  More recently, Honda and Huang have reformulated the work of Giroux in order to extend the theory to higher dimensions.  The purpose of this sequence of talks is to understand this reformulation and to see some of its applications.

Hardness and Approximations of Submodular Minimum Linear Ordering Problems

Series
ACO Student Seminar
Time
Friday, November 5, 2021 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 314
Speaker
Michael WigalGeorgia Tech Math

The minimum linear ordering problem (MLOP) asks to minimize the aggregated cost of a set function f with respect to some ordering \sigma of the base set. That is, MLOP asks to find a permutation \sigma that minimizes the sum \sum_{i = 1}^{|E|}f({e \in E : \sigma(e) \le i}). Many instances of MLOP have been studied in the literature, for example, minimum linear arrangement (MLA) or minimum sum vertex cover (MSVC). We will cover how graphic matroid MLOP, i.e. where f is taken to be the rank function of a graphic matroid, is NP-hard. This is achieved through a series of reductions beginning with MSVC. During these reductions, we will introduce a new problem, minimum latency vertex cover (MLVC) which we will also show has a 4/3 approximation. Finally, using the theory of principal partitions, we will show MLOP with monotone submodular function f : E \to \mathbb{R}^+ has a 2 - (1 + \ell_f)/(1 + |E|) approximation where \ell_f = f(E)/(\max_{x \in E}f({x})). As a corollary, we obtain a 2 - (1 + r(E))/(1 + |E|) approximation for matroid MLOP where r is the rank function of the matroid. We will also end with some interesting open questions.

Joint work with Majid Farhadi, Swati Gupta, Shengding Sun, and Prasad Tetali.

A Human-Centered Approach to Spacecraft Trajectory Optimization via Immersive Technology

Series
CDSNS Colloquium
Time
Friday, November 5, 2021 - 13:00 for 1 hour (actually 50 minutes)
Location
Online via Zoom
Speaker
Davide GuzzettiAuburn University

Please Note: Zoom link: https://us06web.zoom.us/j/83392531099?pwd=UHh2MDFMcGErbzFtMHBZTmNZQXM0dz09

Traditional spacecraft trajectory optimization approaches focus on automatizing solution generation by capturing the solution space analytically, or numerically, in a single or few instances. However, critical human-computer interactions within optimization processes are almost always disregarded, and they are not well understood. In fact, human intervention spans across the entire optimization process, from the formulation of a problem that lands on known solution schemes, to the identification of an initial guess within the algorithm basin of convergence, to tuning the algorithm hyper-parameters, investigating anomalies, and parsing large databases of optimal solutions to gain insight. Vision-based interaction with sets of multi-dimensional information mitigates the complexity of several applications in astrodynamics. For example, visual-based processes are key to understanding solution space topology for orbit mechanics (e.g., Poincare’ maps), formulating higher quality initial trajectory guesses for early mission design studies, and investigating six-degree-of-freedom (6DOF) dynamics for proximity operations. The capillary diffusion of visual-based data interaction processes throughout astrodynamics has motivated the creation of virtual reality (VR) technology to facilitate scientific discovery since the advent of modern computers. The recent appearance of small, portable, and affordable devices may be a tipping point to advance astrodynamics applications via VR technology. Nonetheless, the tangible benefits for adoption of virtual reality frameworks are not yet fully characterized in the context of astrodynamics applications. What new opportunities virtual reality opens for astrodynamics? What applications benefits from virtual reality frameworks? To answer these and similar questions, our work focuses on a programmatic early assessment and exploration of VR technology for astrodynamics applications. The assessment is constructed by a review of VR literature with elements that are external to the astrodynamics community to facilitate cross-pollination of ideas. Next, the Johnson-Lindenstrauss lemma, together with a set of simplifying assumptions, is employed to analytically capture the value of projecting higher-dimensional information to a given lower dimensional space. Finally, two astrodynamics applications are presented to display solutions that are primarily enabled by virtual reality technology.

Introduction to Diophantine Approximation with Applications to Arithmetic Geometry

Series
Algebra Student Seminar
Time
Friday, November 5, 2021 - 10:00 for 1 hour (actually 50 minutes)
Location
Skile 005
Speaker
Ian LewisGeorgia Tech

One question addressed in the field of Diophantine approximation is precisely quantifying how many "good" approximations an algebraic number has by rational numbers. This is answered most soundly by a 1955 theorem of Klaus Roth. In this talk, I will cover this theorem, some related results and hint at how it can be used to bound the number of rational solutions to curves.

Gibbsian line ensembles and beta-corners processes

Series
Stochastics Seminar
Time
Thursday, November 4, 2021 - 16:30 for 1 hour (actually 50 minutes)
Location
ONLINE
Speaker
Evgeni DimitrovColumbia University

Please Note: The link for the talk is https://bluejeans.com/492736052/2047

Gibbs measures are ubiquitous in statistical mechanics and probability theory. In this talk I will discuss two types of classes of Gibbs measures – random line ensembles and triangular particle arrays, which have received considerable attention due, in part, to their occurrence in integrable probability.
Gibbsian line ensembles can be thought of as collections of finite or countably infinite independent random walkers whose distribution is reweighed by the sum of local interactions between the walkers. I will discuss some recent progress in the asymptotic study of Gibbsian line ensembles, summarizing some joint works with Barraquand, Corwin, Matetski, Wu and others.
Beta-corners processes are Gibbs measures on triangular arrays of interacting particles and can be thought of as analogues/extensions of multi-level spectral measures of random matrices. I will discuss some recent progress on establishing the global asymptotic behavior of beta-corners processes, summarizing some joint works with Das and Knizel.

Signal Reconstruction, Operator Representations of Frames, and Open Problems in Dynamical Sampling

Series
Analysis Seminar
Time
Wednesday, November 3, 2021 - 15:30 for 1 hour (actually 50 minutes)
Location
ZOOM (see abstract for link)
Speaker
Victor BaileyGeorgia Tech

Dynamical Sampling is, in a sense, a hypernym classifying the set of inverse problems arising from considering samples of a signal and its future states under the action of a linear evolution operator. In Dynamical Sampling, both the signal, $f$, and the driving operator, $A$, may be unknown. For example, let $f \in l^2(I)$ where $I=\{1, \ldots, d\}$. Suppose for $\Omega \subset I$ we know  $\{{ A^j f(i)} : j= 0, \ldots l_i, i\in \Omega\}$ for some $A: l^2(I) \to l^2(I)$. In this setting, we can obtain conditions on $\Omega, A, l_i$ that allow the stable reconstruction of $f$. Dynamical Sampling is closely related to frame theory and has applications to wireless sensor networks among other areas. In this talk, we will discuss the Dynamical Sampling problem, its motivation, related problems inspired by it, current/future work, and open problems. 

The seminar will be held on Zoom and can be found at the link

https://us02web.zoom.us/j/71579248210?pwd=d2VPck1CbjltZStURWRWUUgwTFVLZz09

G-equivariant PL-Morse theory

Series
Geometry Topology Student Seminar
Time
Wednesday, November 3, 2021 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006 (also in BlueJeans)
Speaker
Daniel MinahanGeorgia Tech

Please Note: BlueJeans link: https://bluejeans.com/473141052/9784

Morse theory is a standard concept used in the study of manifolds.  PL-Morse theory is a variant of Morse theory developed by Bestvina and Brady that is used to study simplicial complexes.  We develop an extension of PL-Morse theory to simplicial complexes equipped with an action of a group G.  We will discuss some of the basic ideas in this theory and hopefully sketch proofs of some forthcoming results pertaining to the homology of the Torelli group.

Pages