Seminars and Colloquia Schedule

0-concordance of 2-knots

Series
Geometry Topology Seminar
Time
Monday, February 13, 2017 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Nathan SunukjianCalvin College
A 2-knot is defined to be an embedding of S^2 in S^4. Unlike the theory of concordance for knots in S^3, the theory of concordance of 2-knots is trivial. This talk will be framed around the related concept of 0-concordance of 2-knots. It has been conjectured that this is also a trivial theory, that every 2-knot is 0-concordant to every other 2-knot. We will show that this conjecture is false, and in fact there are infinitely many 0-concordance classes. We'll in particular point out how the concept of 0-concordance is related to understanding smooth structures on S^4. The proof will involve invariants coming from Heegaard-Floer homology, and we will furthermore see how these invariants can be used shed light on other properties of 2-knots such as amphichirality and invertibility.

Conley-Zehnder index of periodic Reeb orbits

Series
Geometry Topology Student Seminar
Time
Wednesday, February 15, 2017 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Surena HozooriGeorgia Tech
In this talk, I will define Conley-Zehnder index of a periodic Reeb orbit and will give several characterizations of this invariant. Conley-Zehnder index plays an important role in computing the dimension of certain families of J-holomorphic curves in the symplectization of a contact manifold.

Sampling Random Spanning Trees Faster than Matrix Multiplication

Series
ACO Student Seminar
Time
Friday, February 17, 2017 - 13:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
David DurfeeCollege of Computing, Georgia Tech
We present an algorithm that, with high probability, generates a random spanning treefrom an edge-weighted undirected graph in O (n^{5/3}m^{1/3}) time. The tree is sampled from adistribution where the probability of each tree is proportional to the product of its edge weights.This improves upon the previous best algorithm due to Colbourn et al. that runs in matrix multiplication time, O(n^\omega). For the special case of unweighted graphs, this improves upon thebest previously known running time of ˜O(min{n^\omega, mn^{1/2}, m^{4/3}}) for m >> n^{7/4} (Colbourn et al. ’96, Kelner-Madry ’09, Madry et al. ’15).The effective resistance metric is essential to our algorithm, as in the work of Madry et al., butwe eschew determinant-based and random walk-based techniques used by previous algorithms.Instead, our algorithm is based on Gaussian elimination, and the fact that effective resistance ispreserved in the graph resulting from eliminating a subset of vertices (called a Schur complement).As part of our algorithm, we show how to compute -approximate effective resistances for a set Sof vertex pairs via approximate Schur complements in O (m + (n + |S|)/\eps^{ −2}) time, without usingthe Johnson-Lindenstrauss lemma which requires eO(min{(m+|S|) \eps{−2},m+n /eps^{−4} +|S|/eps^{ −2}}) time. We combine this approximation procedure with an error correction procedure for handing edges where our estimate isn’t sufficiently accurate.Joint work with Rasmus Kyng, John Peebles, Anup Rao, and Sushant Sachdeva

Building Morse/Floer type homology theories III

Series
Geometry Topology Working Seminar
Time
Friday, February 17, 2017 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
John EtnyreGeorgia Tech

Note todays seminar is just form 2 to 3 to accomodate a seminar at 3.

In this series of talks I will descibe a general proceedure to construct homology theories using analytic/geometric techiques. We will then consider Morse homology in some detail and a simple example of this process. Afterwords we will consider other situations like Floer theory and possibly contact homology.

Dynamics of Next-Generation Smart- and Meta-Structures

Series
GT-MAP Seminar
Time
Friday, February 17, 2017 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Prof. Alper Erturk GT Mechanical Engineering
The first part of this talk will review our recent efforts on the electroelastodynamics of smart structures for various applications ranging from nonlinear energy harvesting, bio-inspired actuation, and acoustic power transfer to elastic wave guiding and vibration attenuation via metamaterials. We will discuss how to exploit nonlinear dynamic phenomena for frequency bandwidth enhancement to outperform narrowband linear-resonant devices in applications such as vibration energy harvesting for wireless electronic components. We will also cover inherent nonlinearities (material and internal/external dissipative), and their interactions with intentionally designed nonlinearities, as well as electrical circuit nonlinearities. Electromechanical modeling efforts will be presented, and approximate analysis results using the method of harmonic balance will be compared with experimental measurements. Our recent efforts on phononic crystal-enhanced elastic wave guiding and harvesting, wideband vibration attenuation via locally resonant metamaterials, contactless acoustic power transfer, bifurcation suppression using nonlinear circuits, and exploiting size effects via strain-gradient induced polarization (flexoelectricity) in centrosymmetric elastic dielectrics will be summarized. The second part of the talk, which will be given by Chris Sugino (Research Assistant and PhD Student), will be centered on low-frequency vibration attenuation in finite structures by means of locally resonant elastic and electroelastic metamaterials. Locally resonant metamaterials are characterized by bandgaps at wavelengths that are much larger than the lattice size, enabling low-frequency vibration/sound attenuation. Typically, bandgap analyses and predictions rely on the assumption of waves traveling in an infinite medium, and do not take advantage of modal representations commonly used for the analysis of the dynamic behavior of finite structures. We will present a novel argument for estimating the locally resonant bandgap in metamaterial-based finite structures (i.e. meta-structures with prescribed boundary conditions) using modal analysis, yielding a simple closed-form expression for the bandgap frequency and size. A method for understanding the importance of the resonator locations and mass distribution will be discussed in the context of a Riemann sum approximation of an integral. Numerical and experimental results will be presented regarding the effects of mass ratio, non-uniform spacing of resonators, and parameter variations among the resonators. Electromechanical counterpart of the problem will also be summarized for piezoelectric structures.

Fine grained complexity of coloring unit disks

Series
Combinatorics Seminar
Time
Friday, February 17, 2017 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Csaba BiróUniversity of Louisville
Many classical hard algorithmic problems on graphs, like coloring, clique number, or the Hamiltonian cycle problem can be sped up for planar graphs resulting in algorithms of time complexity $2^{O(\sqrt{n})}$. We study the coloring problem of unit disk intersection graphs, where the number of colors is part of the input. We conclude that, assuming the Exponential Time Hypothesis, no such speedup is possible. In fact we prove a series of lower bounds depending on further restrictions on the number of colors. Generalizations for other shapes and higher dimensions were also achieved. Joint work with E. Bonnet, D. Marx, T. Miltzow, and P Rzazewski.