Seminars and Colloquia by Series

Thursday, April 23, 2009 - 12:05 , Location: Skiles 255 , Jie Ma , School of Mathematics, Georgia Tech , Organizer: Robin Thomas
A well know theorem of Kuratowski states that a graph is planar graph iff it contains no TK_5 or TK_{3,3}. In 1970s Seymour conjectured that every 5-connected nonplanar graph contains a TK_5. In the talk we will discuss several special cases of the conjecture, for example the graphs containing K_4^- (K_4 withour an edge). A related independent paths theorem also will be covered.
Wednesday, April 22, 2009 - 14:00 , Location: Skiles 255 , Peter D. Miller , University of Michigan , Organizer: Jeff Geronimo
We will discuss a new method of asymptotic analysis of matrix-valued Riemann-Hilbert problems that involves dispensing with analyticity in favor of measured deviation therefrom. This method allows the large-degree analysis of orthogonal polynomials on the real line with respect to varying nonanalytic weights with external fields having two Lipschitz-continuous derivatives, as long as the corresponding equilibrium measure has typical support properties. Universality of local eigenvalue statistics of unitary-invariant ensembles in random matrix theory follows under the same conditions. This is joint work with Ken McLaughlin.
Wednesday, April 22, 2009 - 13:30 , Location: ISyE Executive Classroom , David Cash , Computer Science, Georgia Tech , Organizer: Annette Rohrs
We construct efficient and natural encryption schemes that remain secure (in the standard model) even when used to encrypt messages that may depend upon their secret keys. Our schemes are based on well-studied "noisy learning" problems. In particular, we design 1) A symmetric-key cryptosystem based on the "learning parity with noise" (LPN) problem, and 2) A public-key cryptosystem based on the "learning with errors" (LWE) problem, a generalization of LPN that is at least as hard as certain worst-case lattice problems (Regev, STOC 2005; Peikert, STOC 2009). Remarkably, our constructions are close (but non-trivial) relatives of prior schemes based on the same assumptions --- which were proved secure only in the usual key-independent sense --- and are nearly as efficient. For example, our most efficient public-key scheme encrypts and decrypts in amortized O-tilde(n) time per message bit, and has only a constant ciphertext expansion factor. This stands in contrast to the only other known standard-model schemes with provable security for key-dependent messages (Boneh et al., CRYPTO 2008), which incur a significant extra cost over other semantically secure schemes based on the same assumption. Our constructions and security proofs are simple and quite natural, and use new techniques that may be of independent interest. This is joint work with Chris Peikert and Amit Sahai.
Wednesday, April 22, 2009 - 12:00 , Location: Skiles 255 , Evans Harrell , School of Mathematics, Georgia Tech , Organizer:
The eigenvalues of the Laplacian are the squares of the frequencies of the normal modes of vibration, according to the wave equation. For this reason, Bers and Kac referred to the problem of determining the shape of a domain from the eigenvalue spectrum of the Laplacian as the question of whether one can "hear" the shape. It turns out that in general the answer is "no." Sometimes, however, one can, for instance in extremal cases where a domain, or a manifold, is round. There are many "isoperimetric" theorems that allow us to conclude that a domain, curve, or a manifold, is round, when enough information about the spectrum of the Laplacian or a similar operator is known. I'll describe a few of these theorems and show how to prove them by linking geometry with functional analysis.
Wednesday, April 22, 2009 - 11:05 , Location: Skiles 269 , Matt Baker , School of Mathematics, Georgia Tech , Organizer: Robin Thomas
I will discuss some new results, as well as new interpretations of some old results, concerning reduced divisors (a.k.a. G-parking functions) on graphs, metric graphs, and tropical curves.
Tuesday, April 21, 2009 - 16:30 , Location: Skiles 255 , Anna Gilbert , University of Michigan, Ann Arbor , Organizer: Prasad Tetali
The past 10 years have seen a confluence of research in sparse approximation amongst computer science, mathematics, and electrical engineering. Sparse approximation encompasses a large number of mathematical, algorithmic, and signal processing problems which all attempt to balance the size of a (linear) representation of data and the fidelity of that representation. I will discuss several of the basic algorithmic problems and their solutions, focusing on special classes of matrices. I will conclude with an application in biological testing.
Monday, April 20, 2009 - 16:30 , Location: Skiles 255 , Jianshe Yu , Guangzhou University , Organizer: Haomin Zhou
In the talk I will discuss the periodicity of solutions to the classical forced pendulum equation y" + A sin y = f(t) where A= g/l is the ratio of the gravity constant and the pendulum length, and f(t) is an external periodic force with a minimal period T. The major concern is to characterize conditions on A and f under which the equation admits periodic solutions with a prescribed minimal period pT, where p>1 is an integer. I will show how the new approach, based on the critical point theory and an original decomposition technique, leads to the existence of such solutions without requiring p to be a prime as imposed in most previous approaches. In addition, I will present the first non-existence result of such solutions which indicates that long pendulum has a natural resistance to oscillate periodically.
Monday, April 20, 2009 - 15:00 , Location: Skiles 255 , Svitlana Mayboroda , Purdue University , Organizer: Michael Lacey

Note special time

In 1908 Hadamard conjectured that the biharmonic Green function must be positive. Later on, several counterexamples to Hadamard's conjecture have been found and a variety of upper estimates were obtained in sufficiently smooth domains. However, the behavior of the Green function in general domains was not well-understood until recently. In a joint work with V. Maz'ya we derive sharp pointwise estimates for the biharmonic and, more generally, polyharmonic Green function in arbitrary domains. Furthermore, we introduce the higher order capacity and establish an analogue of the Wiener criterion describing the precise correlation between the geometry of the domain and the regularity of the solutions to the polyharmonic equation.
Monday, April 20, 2009 - 13:00 , Location: Skiles 255 , Tiancheng Ouyang , Brigham Young , Organizer: Chongchun Zeng
In this talk, I will show many interesting orbits in 2D and 3D of the N-body problem. Some of them do not have symmetrical property nor with equal masses. Some of them with collision singularity. The methods of our numerical optimization lead to search the initial conditions and properties of preassigned orbits. The variational methods will be used for the prove of the existence.
Monday, April 20, 2009 - 13:00 , Location: Skiles 269 , Scott Baldridge , LSU , Organizer: John Etnyre
In this talk we will introduce the notion of a cube diagram---a surprisingly subtle, extremely powerful new way to represent a knot or link. One of the motivations for creating cube diagrams was to develop a 3-dimensional "Reidemeister's theorem''. Recall that many knot invariants can be easily be proven by showing that they are invariant under the three Reidemeister moves. On the other hand, simple, easy-to-check 3-dimensional moves (like triangle moves) are generally ineffective for defining and proving knot invariants: such moves are simply too flexible and/or uncontrollable to check whether a quantity is a knot invariant or not. Cube diagrams are our attempt to "split the difference" between the flexibility of ambient isotopy of R^3 and specific, controllable moves in a knot projection. The main goal in defining cube diagrams was to develop a data structure that describes an embedding of a knot in R^3 such that (1) every link is represented by a cube diagram, (2) the data structure is rigid enough to easily define invariants, yet (3) a limited number of 5 moves are all that are necessary to transform one cube diagram of a link into any other cube diagram of the same link. As an example of the usefulness of cube diagrams we present a homology theory constructed from cube diagrams and show that it is equivalent to knot Floer homology, one of the most powerful known knot invariants.