Seminars and Colloquia by Series

Seafloor identification in sonar imagery via simulations of Helmholtz equations and discrete optimization

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 21, 2016 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Dr. Christina FrederickGeorgia Tech Mathematics
We present a multiscale approach for identifying features in ocean beds by solving inverse problems in high frequency seafloor acoustics. The setting is based on Sound Navigation And Ranging (SONAR) imaging used in scientific, commercial, and military applications. The forward model incorporates multiscale simulations, by coupling Helmholtz equations and geometrical optics for a wide range of spatial scales in the seafloor geometry. This allows for detailed recovery of seafloor parameters including material type. Simulated backscattered data is generated using numerical microlocal analysis techniques. In order to lower the computational cost of the large-scale simulations in the inversion process, we take advantage of a \r{pre-computed} library of representative acoustic responses from various seafloor parameterizations.

Homology cobordism and Dehn surgery

Series
Geometry Topology Seminar
Time
Monday, November 21, 2016 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Francesco LinPrinceton
We discuss a few applications of Pin(2)-monopole Floer homology to problems in homology cobordism. Our main protagonists are (connected sums of) homology spheres obtained by surgery on alternating and L-space knots with Arf invariant zero.

Problems, Algorithms, and Complexity in Algebraic Geometry

Series
ACO Student Seminar
Time
Friday, November 18, 2016 - 13:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Tim DuffSchool of Mathematics, Georgia Tech
At the intersection of computability and algebraic geometry, the following question arises: does an integral polynomial system of equations have any integral solutions? Famously, the combined work of Robinson, Davis, Putnam, and Matiyasevich answers this in the negative. Nonetheless, algorithms have played in increasing role in the development of algebraic geometry and its many applications. I address some research related to this general theme and some outstanding questions.

Math Graduate Student Information Session

Series
GT-MAP Seminar
Time
Friday, November 18, 2016 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Luca Dieci and Sung Ha KangGT Math
This is an information session about research opportunities related to GT MAP activities. If you are a math graduate student, please join for free pizza as well.

On the Erdos-Szekeres convex polygon problem: A discussion

Series
Combinatorics Seminar
Time
Thursday, November 17, 2016 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 269
Speaker
Andrew SukUniversity of Illinois, Chicago
Andew Suk will discuss some of the techincal details in his colloquium talk about the Erdos-Szekeres convex polygon problem. This is mainly an informal discussion.

On the Erdos-Szekeres convex polygon problem

Series
School of Mathematics Colloquium
Time
Thursday, November 17, 2016 - 11:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Andrew Suk University of Illinois at Chicago
The classic 1935 paper of Erdos and Szekeres entitled ``A combinatorial problem in geometry" was a starting point of a very rich discipline within combinatorics: Ramsey theory. In that paper, Erdos and Szekeres studied the following geometric problem. For every integer n \geq 3, determine the smallest integer ES(n) such that any set of ES(n) points in the plane in general position contains n members in convex position, that is, n points that form the vertex set of a convex polygon. Their main result showed that ES(n) \leq {2n - 4\choose n-2} + 1 = 4^{n -o(n)}. In 1960, they showed that ES(n) \geq 2^{n-2} + 1 and conjectured this to be optimal. Despite the efforts of many researchers, no improvement in the order of magnitude has been made on the upper bound over the last 81 years. In this talk, we will sketch a proof showing that ES(n) =2^{n +o(n)}.

Legendrian Contact Homology Examples

Series
Geometry Topology Student Seminar
Time
Wednesday, November 16, 2016 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Caitlin LeversonGeorgia Tech
We will review the definition of the Chekanov-Eliashberg differentialgraded algebra for Legendrian knots in R^3 and look at examples tounderstand a few of the invariants that come from Legendrian contacthomology.

Joint Stochastics-Math Finance Seminar - Three puzzles in quantitative finance

Series
Other Talks
Time
Wednesday, November 16, 2016 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Viorel CosteanuJ.P. Morgan
1. One day before the election, the statistics site 538 predicted a 70% chance of a Clinton victory. How do we judge the quality of probabilistic prediction models? Ultimately every quant finance model has a probabilistic prediction model at its core, for instance the geometric Brownian Motion is the core of Black-Scholes. I will explain the Basel Traffic Ligths Framework and then I'll ask the audience to think how the framework can be extended. 2. Multi-factor local volatility. I will explain Dupire's local volatility model and ask how this model can be extended to a multi-factor framework. 3. Model overfitting. There are objective criteria for statistical model overfitting, such as AIC. Such criteria don't exist for risk-neutral derivatives pricing models.

Pages