## Seminars and Colloquia by Series

Friday, February 22, 2019 - 16:00 , Location: Skiles 005 , Ian Jauslin , Princeton University , , Organizer: Federico Bonetto
Consider a metallic field emitter shaped like a thin needle, at the tip of which a large electric field is applied. Electrons spring out of the metal under the influence of the field. The celebrated and widely used Fowler-Nordheim equation predicts a value for the current outside the metal. In this talk, I will show that the Fowler-Nordheim equation emerges as the long-time asymptotic solution of a Schrodinger equation with a realistic initial condition, thereby justifying the use of the Fowler Nordheim equation in real setups. I will also discuss the rate of convergence to the Fowler-Nordheim regime.
Friday, February 22, 2019 - 12:00 , Location: Skile 006 , Cvetelina Hill , Georgia Tech , , Organizer: Cvetelina Hill
Friday, February 22, 2019 - 03:05 , Location: Skiles 246 , Longmei Shu , GT Math , Organizer: Jiaqi Yang
Isospectral reductions on graphs remove certain nodes and change the weights of remaining edges. They preserve the eigenvalues of the adjacency matrix of the graph, their algebraic multiplicities and geometric multiplicities. They also preserve the eigenvectors. We call the graphs that can be isospectrally reduced to one same graph spectrally equivalent. I will give examples to show that two graphs can be spectrally equivalent or not based on the feature one picks for the equivalence class.
Thursday, February 21, 2019 - 15:05 , Location: Skiles 006 , , University of Rochester , , Organizer: Michael Damron
Consider a measurable dense family of semi-infinite nearest-neighbor paths on the integer lattice in d dimensions. If the measure on the paths is translation invariant, we completely classify their collective behavior in d=2 under mild assumptions. We use our theory to classify the behavior of families of semi-infinite geodesics in first- and last-passage percolation that come from Busemann functions. For d>=2, we describe the behavior of bi-infinite trajectories, and show that they carry an invariant measure. We also construct several examples displaying unexpected behavior. One of these examples lets us answer a question of C. Hoffman's from 2016. (joint work with Jon Chaika)
Wednesday, February 20, 2019 - 16:30 , Location: Skiles 006 , Michael Wigal , Georgia Tech , Organizer: Xingxing Yu
Let $g(n) = \max_{|T| = n}|\text{Aut}(T)|$ where $T$ is a tournament. Goldberg and Moon conjectured that $g(n) \le \sqrt{3}^{n-1}$ for all $n \ge 1$ with equality holding if and only if $n$ is a power of 3. Dixon proved the conjecture using the Feit-Thompson theorem. Alspach later gave a purely combinatorial proof. We discuss Alspach's proof and and some of its applications.
Wednesday, February 20, 2019 - 15:00 , Location: Skiles 006 , Steven Heilman , USC , Organizer: Galyna Livshyts
A single soap bubble has a spherical shape since it minimizes its surface area subject to a fixed enclosed volume of air.&nbsp; When two soap bubbles collide, they form a “double-bubble” composed of three spherical caps.&nbsp; The double-bubble minimizes total surface area among all sets enclosing two fixed volumes.&nbsp; This was proven mathematically in a landmark result by Hutchings-Morgan-Ritore-Ros and Reichardt using the calculus of variations in the early 2000s.&nbsp; The analogous case of three or more Euclidean sets is considered difficult if not impossible.&nbsp; However, if we replace Lebesgue measure in these problems with the Gaussian measure, then recent work of myself (for 3 sets) and of Milman-Neeman (for any number of sets) can actually solve these problems.&nbsp; We also use the calculus of variations.&nbsp; Time permitting, we will discuss an improvement to the Milman-Neeman result and applications to optimal clustering of data and to designing elections that are resilient to hacking. &nbsp;<a href="http://arxiv.org/abs/1901.03934">http://arxiv.org/abs/1901.03934</a>
Wednesday, February 20, 2019 - 13:55 , Location: Skiles 005 , Steven Heilman , USC , Organizer: Galyna Livshyts
&nbsp;It is well known that a Euclidean set of fixed Euclidean volume with least Euclidean surface area is a ball.&nbsp; For applications to theoretical computer science and social choice, an analogue of this statement for the Gaussian density is most relevant.&nbsp; In such a setting, a Euclidean set with fixed Gaussian volume and least Gaussian surface area is a half space, i.e. the set of points lying on one side of a hyperplane.&nbsp; This statement is called the Gaussian Isoperimetric Inequality.&nbsp; In the Gaussian Isoperimetric Inequality, if we restrict to sets that are symmetric (A= -A), then the half space is eliminated from consideration.&nbsp; It was conjectured by Barthe in 2001 that round cylinders (or their complements) have smallest Gaussian surface area among symmetric sets of fixed Gaussian volume.&nbsp; We discuss our result that says this conjecture is true if an integral of the curvature of the boundary of the set is not close to 1. &nbsp;<a href="https://arxiv.org/abs/1705.06643">https://arxiv.org/abs/1705.06643</a>&nbsp;&nbsp; &nbsp;<a href="http://arxiv.org/abs/1901.03934">http://arxiv.org/abs/1901.03934</a>
Series: Other Talks
Wednesday, February 20, 2019 - 12:00 , Location: 005 , Anna Kirkpatrick , Georgia Tech , , Organizer: Cvetelina Hill
Understanding the structure of RNA is a problem of significant interest&nbsp;to biochemists. Thermodynamic energy functions are often key to this&nbsp;pursuit, but it is well-established that these energy functions do not&nbsp;perform well when applied to longer RNA sequences. This work&nbsp;specifically investigates the branching properties of RNA secondary&nbsp;structures, viewed as plane trees. By employing Markov chain Monte Carlo&nbsp;techniques, we sample from the probability distributions determined by&nbsp;these thermodynamic energy functions. We also investigate some of the&nbsp;challenges in employing Markov chain Monte Carlo, in particular the&nbsp;existence of local energy minima in transition graphs. This talk will&nbsp;give background, share preliminary results, and discuss future avenues&nbsp;of investigation.
Wednesday, February 20, 2019 - 00:05 , Location: Skiles 006 , Jennifer Kloke , Ayasdi , Organizer: Kirsten Wickelgren
The Mapper algorithm constructs compressed representations of the underlying structure of data but involves a large number of parameters.&nbsp; To make the Mapper algorithm accessible to domain experts, automation of the parameter selection becomes critical. This talk will be accessible to graduate students.
Tuesday, February 19, 2019 - 16:30 , Location: Skiles 006 , Michael Wigal , Georgia Tech , Organizer: Xingxing Yu
Let $g(n) = \max_{|T| = n}|\text{Aut}(T)|$ where $T$ is a tournament. Goldberg and Moon conjectured that $g(n) \le \sqrt{3}^{n-1}$ for all $n \ge 1$ with equality holding if and only if $n$ is a power of 3. Dixon proved the conjecture using the Feit-Thompson theorem. Alspach later gave a purely combinatorial proof. We discuss Alspach's proof and and some of its applications.