Let k be a local field, and let K be a separable quadratic field extension of k. It is known that an irreducible complex representation π_1 of the unitary group G_1 = U_n(k) has a multiplicity free restriction to the subgroup G_2 = U{n−1}(k) fixing a non-isotropic line in the corresponding Hermitian space over K. More precisely, if π_2 is an irreducible representation of G_2 , then π = π_1 ⊗ π_2 is an irreducible representation of the product G = G_1 G_2 which we can restrict to the subgroup H = G_2 , diagonally embedded in G. The space of H-invariant linear forms on π has dimension ≤ 1.
In this talk, I will use the local Langlands correspondence and some number theoretic invariants of the Langlands parameter of π to predict when the dimension of H-invariant forms is equal to 1, i.e. when the dual of π_2 occurs in the restriction of π_1 . I will also illustrate this prediction with several examples, including the classical branching formula for representations of compact unitary groups. This is joint work with Wee Teck Gan and Dipendra Prasad.
Courant Institute of Mathematical Sciences New York University
Time:
Monday, January 26, 2009 - 2:00pm
Location:
RH 306
We say a region of space is "cloaked" with respect to electromagnetic measurements if its contents -- and even the existence of the cloak -- are inaccessible to such measurements. One recent proposal for such cloaking takes advantage of the coordinate-invariance of Maxwell's equations. As usually presented, this scheme uses a singular change of variables. That makes the mathematical analysis subtle, and the practical implementation difficult. This talk examines the correctness and robustness of the change-of-variable-based scheme, for scalar waves modelled by Helmholtz's equation, drawing on joint work with Onofrei, Shen, Vogelius, and Weinstein. The central idea is to use a less-singular change of variables. The quality of the resulting "approximate cloak" can be assessed by studying the detectability of a small inclusion in an otherwise uniform medium. We show that a small inclusion can be made nearly undetectable (regardless of its contents) by surrounding it with a suitable lossy layer.
Courant Institute of Mathematical Sciences New York University
Time:
Wednesday, January 28, 2009 - 4:00pm
Location:
RH 306
Energy-driven pattern formation is difficult to define, but easy to recognize. I'll discuss two examples: (a) cross-tie wall patterns in magnetic thin films. (b) surface-energy-driven coarsening of two-phase mixtures. The two problems are rather different -- the first is static, the second dynamic. But they share certain features: in each case nature forms complex patterns as it attempts to minimize a suitable "free energy". The task of modeling and analyzing such patterns is a rich source of challenges -- many still open -- in the multidimensional calculus of variations.
Carl F. Braun Professor of Engineering and Control Jerry Marsden
Institution:
Caltech
Time:
Thursday, October 23, 2008 - 3:00pm
Location:
NS2 1201
Lagrangian coherent structures (LCS) are best described as moving curves in a fluid that separate particles that have qualitatively different trajectories. For instance, particles that circulate in an ocean bay have a separate behavior from particles that go on by the bay and don't get caught up in the circulation. Interestingly, these two classes of particles are separated by a sharp, but moving curve. Similar structures are found in Hurricanes: which particle are going to get swept up in the Hurricane and which don't? Likewise in Jellyfish, some particles enter the underbelly of the jellyfish and bring nutrients, while others are swept downstream to help propel the jellyfish. The way blood flows over a clot, as revealed by LCS can indicate whether or not the clot is dangerous. This lecture will give examples of this sort, explain how the LCS are computed and are connected with other mathematical constructions, such as Smale horseshoes in dynamical systems.
Carl F. Braun Professor of Engineering and Control Jerry Marsden
Institution:
Caltech
Time:
Wednesday, October 22, 2008 - 4:00pm
Location:
RH 306
People and Nature often try to optimize things; find the shortest route to the grocery store, find the most efficient way to throw a discus, cats turning themselves over efficiently, etc. Optimal control is about finding control forces to perform optimal ways of carrying out a task. Many such systems are mechanical and special techniques for computing optimal controls in mechanics will be presented. These techniques are based on recent progress in discrete mechanics. The techniques will be illustrated by systems such as falling cats, reorienting a network of satellites, optimal space mission design, systems with constraints (such as a satellite with momentum wheels), helicopter dynamics, and efficient 2D and 3D robotic walkers.
The most natural formulation for the equations of elasticity is as a first order system, reflecting the very different nature of the equilibrium equation and the constitutive equation. Moreover this system applies more widely than second order formulations, for example to incompressible, plastic, or viscoelastic materials. The first-order system is captured variationally in the Hellinger-Reissner variational principle, which characterizes the symmetric stress tensor field and the displacement vector field as a saddle-point of a suitable functional. However it has proven extremely difficult to develop stable and effective finite element discretizations of this formulation--so called mixed finite elements for elasticity. Efforts to develop such methods go back to the earliest days of the finite element methods. However, stable mixed elasticity elements using polynomial shape functions have only been developed recently using the theory of finite element exterior calculus (FEEC). This talk will review the subject and especially recent progress connected to FEEC, which has led to very simple stable elements in two and three dimensions.
Partial differential equations (PDE) are among the most useful mathematical modeling tools, and numerical discretization of PDE--approximating them by problems which can be solved on computers--is one of the most important and widely used approaches to simulating the physical world. A vastly developed technology is built on such discretizations. Nonetheless, fundamental challenges remain in the design and understanding of effective methods of discretization for certain important classes of PDE problems.
The accuracy of a simulation depends on the consistency and stability of the discretization method used. While consistency is usually elementary to establish, stability of numerical methods can be subtle, and for some key PDE problems the development of stable methods is extremely challenging. After illustrating the situation through simple (but surprising) examples, we will describe a powerful new approach--the finite element exterior calculus--to the design and understanding of discretizations for a variety of elliptic PDE problems. This approach achieves stability by developing discretizations which are compatible with the geometrical and topological structures, such as de Rham cohomology and Hodge decompositions, which underlie well-posedness of the PDE problem being solved.