Seminars and Colloquia by Series

Judicious partitions of 3-uniform hypergraphs

Series
Combinatorics Seminar
Time
Friday, January 21, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jie MaSchool of Math. Georgia Tech.
Judicious partitioning problems on graphs and hypergraphs ask for partitions that optimize several quantities simultaneously. In this talk we first review the history of such problems. We will then focus on a conjecture of Bollobas and Thomason that the vertices of any r-uniform hypergraphs with m edges can be partitioned into r sets so that each set meets at least rm/(2r-1) edges. We will show that for r=3 and m large we can get an even better bound than what the conjecture suggests.

Blind Source Separation in Audio

Series
Applied and Computational Mathematics Seminar
Time
Friday, January 21, 2011 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Yang WangMichigan State University, Department of Mathematics
The blind source separation (BSS) problem, also better known as the "cocktail party problem", is a well-known and challenging problem in mathematics and engineering. In this talk we discuss a novel time-frequency technique for the BSS problem. We also discuss a related problem in which foreground audio signal is mixed with strong background noise, and present techniques for suppress the background noise.

Regularization for Cox's Proportional Hazards Model With NP-Dimensionality

Series
Job Candidate Talk
Time
Thursday, January 20, 2011 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Jelena BradicPrinceton University
High throughput genetic sequencing arrays with thousands of measurements per sample and a great amount of related censored clinical data have increased demanding need for better measurement specific model selection. In this paper we establish strong oracle properties of non-concave penalized methods for non-polynomial (NP) dimensional data with censoring in the framework of Cox's proportional hazards model. A class of folded-concave penalties are employed and both LASSO and SCAD are discussed specifically. We unveil the question under which dimensionality and correlation restrictions can an oracle estimator be constructed and grasped. It is demonstrated that non-concave penalties lead to significant reduction of the "irrepresentable condition" needed for LASSO model selection consistency. The large deviation result for martingales, bearing interests of its own, is developed for characterizing the strong oracle property. Moreover, the non-concave regularized estimator, is shown to achieve asymptotically the information bound of the oracle estimator. A coordinate-wise algorithm is developed for finding the grid of solution paths for penalized hazard regression problems, and its performance is evaluated on simulated and gene association study examples.

An inverse problem arising in decoding of bar codes

Series
School of Mathematics Colloquium
Time
Thursday, January 20, 2011 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Fadil SantosaUniversity of Minnesota (Minneapolis)
Information encoded in a bar code can be read using a laser scanner or a camera-based scanner. For one-dimensional bar codes, which are in most prevalent use, the information that needs to be extracted are the widths of the black and white bars. The collection of black and white bars may be viewed as a binary one-dimensional image. The signal measured at the scanner amounts to the convolution of the binary image with a smoothing kernel. The challenge is that the smoothing kernel, in addition to the binary image, is also unknown. This presentation will review the technology behind bar code scanning and present several approaches to the decoding problem.

About symmetry and symmetry breaking for extremal functions in interpolation functional inequalities

Series
Math Physics Seminar
Time
Wednesday, January 19, 2011 - 16:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Maria J. EstebanCEREMADE, University of Paris, Dauphine
In this talk I will present recent work, in collaboration with J.Dolbeault, G. Tarantello and A. Tertikas,about the symmetry properties of extremal functions for (interpolation)functional inequalities playing an important rolein the study of long time behavior of evolution diffusion equations.Optimal constants are rarely known,in fact one can write them explicitely only when the extremals enjoymaximal symmetry. This is why the knowledge of the parameters' regionswhere symmetry is achieved is of big importance. In the case of symmetrybreaking, the underlying phenomena permitting it are analyzed.

Quantum Curves in Chern-Simons Theory

Series
Geometry Topology Seminar
Time
Wednesday, January 19, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Tudor TimofteIAS, Princeton
I will discuss a new general framework for cutting and gluing manifolds in topological quantum field theory (TQFT). Applying this method to Chern-Simons theory with gauge group SL(2,C) on a knot complement M leads to a systematic quantization of the SL(2,C) character variety of M. In particular, the classical A-polynomial of M becomes an operator "A-hat", the same operator that appears in the recursion relations of Garoufalidis et al. for colored Jones polynomials.

The Seiberg-Witten equations with Lagrangian boundary conditions

Series
Analysis Seminar
Time
Wednesday, January 19, 2011 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Tim NguyenMIT
The Seiberg-Witten equations, introduced by Edward Witten in 1994, are a first-order semilinear geometric PDE that have led to manyimportant developments in low-dimensional topology. In this talk,we study these equations on cylindrical 4-manifolds with boundary, which we supplement with (Lagrangian) boundary conditions that have a natural Morse-Floer theoretic interpretation. These boundary conditions, however, are nonlinear and nonlocal, and so the resulting PDE is highlyunusual and nontrivial. After motivating and describing the underlying geometry for the Seiberg-Witten equations with Lagrangian boundary conditions, we discuss some of the intricate analysis involved in establishing elliptic regularity for these equations, including tools from the pseudodifferential analysis ofelliptic boundary value problems and nonlinear functional analysis.

Gauge theory, particle physics, and low-dimensional topology

Series
Research Horizons Seminar
Time
Wednesday, January 19, 2011 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Timothy NguyenMIT - Mathematics

Please Note: Hosts: Amey Kaloti and Ricardo Restrepo

Gauge theory is a beautiful subject that studies the space of connections on a vector bundle. It is also the natural language in which theories of particle physics are formulated. In fact, the word "gauge" has its origins in electromagnetism, and in this talk, we explore the basic geometric objects of gauge theory and show how one explicitly recovers the classical Maxwell's equations as a special case of the equations of gauge theory . Next, generalizing Maxwell's equations to a ``nonabelian" setting, we obtain the Yang-Mills equations, which describe the electroweak force in nature. Surprisingly, these equations were used by Simon Donaldson in the 1980s to prove spectacular results for the topology of smooth four-manifolds. We conclude this talk by describing some of the beautiful geometry and analysis behind gauge theory that goes into the work of Donaldson (for which we awarded a Fields Medal), and time permitting, we hope to say a bit about other gauge-theoretic applications to low-dimensional topology, for instance, instanton Floer homology.

Exponentially many perfect matchings in cubic graphs

Series
ACO Seminar
Time
Thursday, January 13, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 154
Speaker
Sergey NorinPrinceton University
A well-known conjecture of Lovasz and Plummer asserts that the number of perfect matchings in 2-edge-connected cubic graph is exponential in the number of vertices. Voorhoeve has shown in 1979 that the conjecture holds for bipartite graphs, and Chudnovsky and Seymour have recently shown that it holds for planar graphs. In general case, however, the best known lower bound has been until now barely super-linear. In this talk we sketch a proof of the conjecture. The main non-elementary ingredient of the proof is Edmonds' perfect matching polytope theorem. This is joint work with Louis Esperet, Frantisek Kardos, Andrew King and Daniel Kral.

[Special Time] A mathematical model for bunching and meandering instabilities during epitaxial growth of a thin film

Series
Applied and Computational Mathematics Seminar
Time
Thursday, January 13, 2011 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Michel JabbourUniversity of Kentucky
Recent experiments indicate that one- and two-dimensionalinstabilities, bunching and meandering, respectively, coexist duringepitaxial growth of a thin film in the step-flow regime. This is in contrastto the predictions of existing Burton–Cabrera–Frank (BCF) models. Indeed, inthe BCF framework, meandering is predicated on an Ehrlich–Schwoebel (ES)barrier whereas bunching requires an inverse ES effect. Hence, the twoinstabilities appear to be a priori mutually exclusive. In this talk, analternative theory is presented that resolves this apparent paradox. Itsmain ingredient is a generalized Gibbs–Thomson relation for the stepchemical potential resulting in jump conditions along the steps that coupleadatom diffusions on adjacent terraces. Specialization to periodic steptrains reveals a competition between the stabilizing ES kinetics and adestabilizing energetic correction that can lead to step collisions. Theaforementioned instabilities can therefore be understood in terms of thetendency of the crystal to lower, away from equilibrium and in the presenceof dissipation, its total free energy. The presentation will be self-contained and no a priori knowledge of theunderlying physics is needed.

Pages