Seminars and Colloquia by Series

Braid Groups and Hodge Theory

Series
Geometry Topology Student Seminar
Time
Wednesday, November 14, 2012 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Becca WinarskiGeorgia Tech
We look at a paper of McMullen "Braid Groups and Hodge Theory" exploring representations of braid groups and their connections to arithemetic lattices.

From a formula of Haagerup to random matrices and free probability

Series
Analysis Seminar
Time
Wednesday, November 14, 2012 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Ionel PopescuGeorgia Tech
This formula of Haagerup gives an expression of the log|x-y| in terms of Chebyshev polynomials of the first kind. This is very useful for problems involving the logarithmic potentials which plays a prominent role in random matrices, free probability, orthogonal polynomials and other areas. We will show how one can go from this to several things, for example the counting problems of planar diagrams and functional inequalities in free probability in particular an intriguing Poincare inequality and some related other inequalities. If time allows I will also talk about a conjecture related to the Hilbert transform, semicircular and arcsine distribution. Parts of this was with Stavros Garoufalidis and some other parts with Michel Ledoux.

Diophantine equations and p-adic analysis

Series
Research Horizons Seminar
Time
Wednesday, November 14, 2012 - 12:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Matt BakerGeorgia Tech, School of Math
I will discuss how one can solve certain concrete problems in number theory, for example the Diophantine equation 2x^2 + 1 = 3^m, using p-adic analysis. No previous knowledge of p-adic numbers will be assumed. If time permits, I will discuss how similar p-adic analytic methods can be used to prove the famous Skolem-Mahler-Lech theorem: If a_n is a sequence of complex numbers satisfying some finite-order linear recurrence, then for any complex number b there are only finitely many n for which a_n = b.

Regularity of the flow map for the gravity-capillary problem

Series
PDE Seminar
Time
Tuesday, November 13, 2012 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Ming ChenUniversity of Pittsburgh
We prove via explicitly constructed initial data that solutionsto the gravity-capillary wave system in R^3 representing a 2d air-waterinterface immediately fail to be C^3 with respect to the initial data ifthe initial (h_0, \psi_0) \in H^{s + 1/2} \times H^s for s<3, where h isthe free surface and \psi is the velocity potential.

Strong test ideals

Series
Algebra Seminar
Time
Monday, November 12, 2012 - 15:35 for 1 hour (actually 50 minutes)
Location
Note unusual start time for seminar. Skiles 005
Speaker
Florian EnescuGeorgia State University
The talk will discuss the concept of test ideal for rings of positive characteristic. In some cases test ideals enjoy remarkable algebraic properties related to the integral closure of ideals. We will present this connection in some detail.

The Joint Spectral Radius and its approximation

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 12, 2012 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Antonio CiconeGT Math
Given F, finite set of square matrices of dimension n, it is possible to define the Joint Spectral Radius or simply JSR as a generalization of the well known spectral radius of a matrix. The JSR evaluation proves to be useful for instance in the analysis of the asymptotic behavior of solutions of linear difference equations with variable coefficients, in the construction of compactly supported wavelets of and many others contexts. This quantity proves, however, to be hard to compute in general. Gripenberg in 1996 proposed an algorithm for the computation of lower and upper bounds to the JSR based on a four member inequality and a branch and bound technique. In this talk we describe a generalization of Gripenberg's method based on ellipsoidal norms that achieve a tighter upper bound, speeding up the approximation of the JSR. We show the performance of this new algorithm compared with Gripenberg's one. This talk is based on joint work with V.Y.Protasov.

Legendrian torus knots in S1XS2

Series
Geometry Topology Seminar
Time
Monday, November 12, 2012 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Youlin LiShanghai Jiaotong University and Ga Tech
We classify the Legendrian torus knots in S1XS2 with tight contact structure up to isotopy. This is a joint work with Feifei Chen and Fan Ding.

Workshop on Internet Topology and Economics

Series
Other Talks
Time
Monday, November 12, 2012 - 09:00 for 8 hours (full day)
Location
Klaus 1116
Speaker
Workshop on Internet Topology and EconomicsARC, Yandex Corporation, Institute for Data and High Performance Computing
The workshop begins on November 12 with three 1-hour tutorial lectures and continues with morning and afternoon sessions until November 14. The aim of this workshop is to bring together these different communities from research (Internet Topology Measurement, Economics, Theoretical Computer Science, Network Science) and related industry (ISPs, Content Providers, CDNs etc.) to help narrow the gap between research and operational practice. See the complete program, list of speakers and register to attend.

On the densities of cliques and independent sets in graphs

Series
Combinatorics Seminar
Time
Friday, November 9, 2012 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Humberto Silva NavesMath, UCLA
A variety of problems in extremal combinatorics can be stated as: For two given graphs $H_1$ and $H_2$, if the number of induced copies of $H_1$ in a $n$-vertex graph $G$ is known, what is the maximum or minimum number of induced copies of $H_2$ in $G$? Numerous cases of this question were studied by Tur\'an, Erd\H{o}s, Kruskal and Katona, and several others. Tur\'an proved that the maximal edge density in any graph with no cliques of size $r$ is attained by an $r-1$ partite graph. Kruskal and Katona found that cliques, among all graphs, maximize the number of induced copies of $K_s$ when $r

Pages