|
SEMINARS
Updated: 8-31-2010 |
| |
|
| SEPTEMBER 2010 |
| |
|
| Analysis Seminar *** Please note special time |
| Topic: |
Narcissistic Skyrmions |
| Presenter: |
Claude Warnick, University of Cambridge |
| Date: |
Monday, September 13, 2010, Time: 2:00 p.m., Location: Fine Hall 314 |
| Abstract: |
The Skyrme model is a nonlinear sigma-model whose topologically non-trivial target space allows the existence of so-called topological solitons. Such solitons were proposed by Skyrme to model nuclear matter. In this talk I will review the history of the model and present recent work with Gary Gibbons and Willie Wong ruling out the existence of solitons with a planar reflection symmetry. In particular, I will show that a Skyrme soliton is attracted to its mirror image, preventing a static equilibrium. |
| |
|
| Joint Analysis/PACM Colloquium |
| Topic: |
Optimal Error Estimates in Stochastic Homogenization |
| Presenter: |
Felix Otto, Institute for Applied Mathematics, University of Bonn, Germany |
| Date: |
Monday, September 20, 2010, Time: 4:00 p.m., Location: Fine Hall 214 |
| Abstract: |
http://www.math.princeton.edu/~seminar/2010-11-sem/OttoAbstract9-20-2010.pdf |
| |
|
| PACM Colloquium |
| Topic: |
Still running! Recent work on the neuromechanics of insect locomotion |
| Presenter: |
Philip Holmes, Princeton University |
| Date: |
Monday, September 27, 2010, Time: 4:00 p.m., Location: Fine Hall 214 |
| Abstract: |
I will describe several models for running insects, from an energy-conserving biped with passively-sprung legs to a muscle-actuated hexapod driven by a neural central pattern generator(CPG). Phase reduction and averaging theory collapses some 300 differential equations that describe this neuromechanical model to 24 one-dimensional oscillators that track motoneuron phases. The reduced model accurately captures the dynamics of unperturbed gaits and the effects of impulsive perturbations, and phase response and coupling functions provide improved understanding of reflexive feedback mechanisms. Specifically, piecewise-holonomic constraints due to intermittent foot contacts confers asymptotic stability on the CPG-driven feedforward system, the natural dynamics features a slow subspace that permits maneuverability, and leg force sensors modulate firing patterns to mitigate large perturbations. More generally, I will argue that both simple models and large simulations are necessary to understand such complex systems. The talk will draw on joint work with Einat Fuchs, Robert Full, Raffaele Ghigliazza, Raghu Kukillaya, Josh Proctor, John Schmitt, Justin Seipel and Manoj Srinivasan. Research supported by NSF and the J. Insley Blair Pyne Fund of Princeton University. |
| |
|
| Algebraic Geometry Seminar |
| Topic: |
TBA |
| Presenter: |
Christian Schnell, UIC |
| Date: |
Tuesday, September 28, 2010, Time: 4:30 p.m., Location: Fine Hall 322 |
| |
|
| OCTOBER 2010 |
| |
|
| PACM Colloquium |
| Topic: |
Vertex-disjoint paths in tournaments |
| Presenter: |
Maria Chudnovsky, Columbia University |
| Date: |
Monday, October 4, 2010, Time: 4:00 p.m., Location: Fine Hall 214 |
| Abstract: |
The question of linking pairs of terminals by disjoint paths is a standard and well-studied question in graph theory. The setup is: given vertices s1,..,sk and t1,..,tk, is there a set of disjoint path P1,..,Pk such that Pi is a path from si to ti? This question makes sense in both directed and undirected graphs, and the paths may be required to be edge- or vertex-disjoint. For undirected graphs, a polynomial-time algorithm for solving both the edge-disjoint and the vertex-disjoint version of the problem (where the number k of terminals is fixed) was first found by Robertson and Seymour, and is a part of their well-known Graph Minors project. For directed graphs, both problems are NP-complete, even when k=2 (by a result of Fortune, Hopcroft and Wyllie). However, if we restrict our attention to tournaments (these are directed graphs with exactly one arc between every two vertices), the situation improves. Polynomial time algorithms for solving the edge-disjoint and the vertex-disjoint paths problems when k=2 have been known for a while(these are results of Bang-Jensen, and Bang-Jensen and Thomassen, respectively). Last year, Fradkin and Seymour were able to design a polynomial-time algorithm to solve the edge-disjoint paths problem in tournaments for general(fixed) k, using a new parameter for tournaments, developed by Seymour and the speaker, called "cut-width". However, the vertex-disjoint paths problem seemed to be resistant to similar methods. This talk will focus on the polynomial-time algorithm to solve the vertex-disjoint paths problem in tournaments for general (fixed) k, that we have recently obtained in joint work with Scott and Seymour. |
| |
|
| Algebraic Geometry Seminar |
| Topic: |
Gradient ideals |
| Presenter: |
Yu-Han Liu, Princeton University |
| Date: |
Tuesday, October 5, 2010, Time: 4:30 p.m., Location: Fine Hall 322 |
| Abstract: |
Zero schemes of exact 1-forms have received more attention recently as moduli spaces associated to Calabi-Yau threefolds; they are called gradient schemes or critical schemes. In this talk I will introduce the notion of "multi-gradient schemes" as an obvious generalization and explain their classification in the codimension one and monomial cases, as well as how they naturally arise as certain moduli spaces associated to varieties with globally generated canonical bundles. |
| |
|
| PACM Colloquium |
| Topic: |
Extrapolation Models |
| Presenter: |
David Levin, Tel Aviv University |
| Date: |
Monday, October 11, 2010, Time: 4:00 p.m., Location: Fine Hall 214 |
| Abstract: |
http://www.math.princeton.edu/~seminar/2010-11-sem/LevinAbstract10-11-2010.pdf |
| |
|
| Algebraic Geometry Seminar |
| Topic: |
TBA |
| Presenter: |
Dan Edidin, University of Missouri |
| Date: |
Tuesday, October 12, 2010, Time: 4:30 p.m., Location: Fine Hall 322 |
| |
|
| PACM Colloquium |
| Topic: |
TBA |
| Presenter: |
Ali Jadbabaie, University of Pennsylvania |
| Date: |
Monday, October 18, 2010, Time: 4:00 p.m., Location: Fine Hall 214 |
| |
|
| |
|
|
|