Colloquium:
Spring 2005
Time & location:
All talks are in Gibson 414 at 3:30 P.M. unless otherwise noted. Refreshments
in Gibson 426 after the talk.
Read about our talks last
semester...
Sneak Preview of next semester...
Spring
2005
Comments
indicating vacations, special lectures, or change in location or time
are made in red.
January
13
|
Prof. Edward B. Burger, Williams College
"Conjugate Coupling:
The romantic adventure of the quintessential quadratic"
Abstract:
Here we will come to understand the "personality" of real numbers. Along
the way we will encounter some beautiful ideas from number
theory and develop an appreciation for an area known as "diophantine
approximation". Results of both the ancient and recent variety will be
offered. No number theory background is required beyond a desire to
explore the alluring notion of number. |
January
20
|
Prof. David Levin, University of Utah & MSRI
"New random walk models"
I will describe research on recent models involving random walks.
The first topic concerns the statistical problem of
reconstructing the labeling of a graph from data generated
by an unobservable random walker on the graph.
(Joint work with Y. Peres, and Y. Peres and R. Pemantle.)
I will also discuss work on dynamical random walk.
This is a walk-valued stationary stochastic process whose
equilibrium measure is the law (on sequence space) of
an ordinary random walk. Of particular interest are the
"exceptional times" for the dynamical random walk -- times
at which events of zero probability for the ordinary random
walks occur in the dynamical version. (Joint work
with D. Khoshnevisan and P. Mendez.)
|
January
27
|
Prof. Noel J. Walkington, Carnegie Mellon University
"Construction and Analysis of Unstructured Mesh Generation
Algorithms"
Given a collection of points, edges, and faces, in a bounded two or three
dimensional region, the meshing problem is to construct a
triangulation which (i) conforms to the given region, (ii) the
triangles or tetrahedra have bounded aspect ratio, and (iii) is as coarse
as possible. These requirements can lead to very complicated algorithms;
so much so that it can be difficult to verify
correctness. I will give an overview of the ideas and issues that
arise when constructing algorithms to solve the meshing problem, and will
indicate how the mesh generation problem touches on many areas of
mathematics and computer science such as approximation/interpolation
theory, computational geometry, sphere packing, graph theory, and
algorithm design.
|
February 3
|
Professor Laura Ghezzi, Florida International University
"Valuations in Algebraic Geometry"
This is an introduction to valuation theory and the role it plays
in Algebraic Geometry.
After giving the necessary background and definitions we discuss
Zariski's theorem of local uniformization and we give examples of
valuations that arise naturally in Algebraic Geometry.
This is joint work with S.D. Cutkosky.
|
February
10
|
Wei-Ming Ni
, University of Minnesota
"Turing patterns and Concentration Phenomena
in Differential Equations"
"Diffusion-driven instability" was first formulated in the
celebrated work of Turing (1952) in an attempt to model the regeneration
phenomenon of hydra which is one of the earliest example observed in
morphogenesis (Trombley, 1744). In this talk, I will describe recent
mathematical progress on the Gierer-Meinhardt system (1972), which was
derived based on Turing's original idea. The strikingly nontrivial
patterns, namely, spike-layer steady states, exhibited by this system will
be discussed mathematically. Other related concentration phenomena (such
as the CIMA reaction in chemstry) will be mentioned as well.
|
February
17
|
Giovanni Forni , Northwestern University
"Renormalization and quantitative equidistribution
for parabolic flows"
A flow is called parabolic if nearby orbits diverge with at most
polynomial speed with time. Examples of such flows include billiards in
polygons, conservative flows with saddle singularities on surfaces
(related to interval exchange transformations), horocycle flows and
nilflows. For the typical parabolic flow all trajectories tend to
equidistribution and for applications, for instance to number theory, it
is important to know the equidistribution speed (for smooth functions).
In this talk we will describe an approach to this questions based on the
introduction of an appropriate renormalization dynamics and on the study
of the cohomological equation and of invariant distributions of the flow. The
renormalization dynamics is hyperbolic and can be studied with tools of
hyperbolic theory such as Lyapunov exponents. For instance, in the case
of conservative flows on surfaces the renormalization is given by the
Teichmueller flow on the moduli space of holomorphic differentials and
for horocycle flows by the corresponding geodesic flow. The cohomological
equation can be studied by tools of Fourier analysis/representation
theory, although in some cases a dynamical approach is also possible.
Interesting applications to number theory come from the study of
nilflows. |
Wednesday February
23
3:30 PM
Gibson 414 |
Prakash Panangaden, McGill University
"Leader Election with Quantum Resources"
The idea of using the phenomenon of quantum entanglement for more efficient
implementation of algorithms is now 20 years old. In this talk I consider
a relatively new variation on this theme: solving tasks in distributed
systems using quantum resources. The task that we consider is the problem
of a fully connected network of processors selecting a leader. This is an
abstraction of a key step in many tasks involving distributed decision
making. When the network is anonymous (no processor can be named and each
processor runs the same protocol) the task is known to be unsolvable:
essentially because there is no way to break the symmetry. If the system
can use probabilistic resources then it can break the symmetry - with high
probability - and elect a leader. With entangled states however one can
break the symmetry and get a solution that works always and always with a
fixed number of steps. In fact we show that there is one very special
state - called the W state - that must be used, no other entangled state
will work. This state thus embodies very different properties from the
usual ``Bell'' states used in quantum algorithms. The arguments are
essentially based on symmetry breaking. This talk will include an introduction
to the background material needed to understand the results; in particular,
I will not assume familiarity with quantum computing. This is joint work with
Ellie D'Hondt.
|
February
24
|
Ginger
Davis, Rice University
"Examining the Evolutionary Principal Components of a Multivariate Time
Series with Application to Stock Sector Data"
Financial data are heavily analyzed due to the potential payoff of useful
models. Many models exist for the joint analysis of several financial
instruments such as securities due to the fact that they are not
independent. These models often assume some type of constant behavior
between the instruments over the time period of analysis. Instead of
imposing that assumption for our system of securities, we are interested
in modeling the dynamics of the overall system. Specifically, we model
individual stock data that belong to one of three market sectors and
examine the behavior of the market as a whole and the behavior of the
sectors. Our aim is detecting and forecasting unusual changes in the
system, such as market crashes and outliers.
|
March
3
|
Prof. Luc Tartar, Carnegie-Mellon University
"Beyond partial differential equations"
Problems in Mechanics and Physics have played an important role in
the past for inducing mathematicians to create new mathematical
tools. Nowadays, most mathematicians have no serious knowledge in
Mechanics or Physics, which explains why so many fall prey to
fashions, whose leaders play with terms from Mechanics or Physics
but show a poor understanding of these fields. Even for those with
enough critical judgment for avoiding some traps, learning
Mechanics or Physics is difficult, as it is not easy to guess what
one should believe from all that is said about the real world and
about the mathematical models which are used for describing it.
Classical Mechanics is a 18th Century point of view,
studied with Ordinary Differential Equations. Continuum Mechanics
is a 19th Century point of view, studied with Partial
Differential Equations, at least for the linear effects. Because
the mathematical tools which existed in the late 1960s were only
adapted to linear problems, part of my research work looked at the
difficulties posed by nonlinear effects. I first developed
Homogenization and Compensated Compactness (partly with
François Murat), and then H-measures for a few
particular questions (also introduced by Patrick Gérard for another question). I will describe why I consider all
this as a (small) part of a new theory, which lies Beyond
Partial Differential Equations, and should be adapted to 20th Century problems in Continuum Mechanics, like Plasticity or
Turbulence, and 20th Century Physics, i.e. quantum
effects.
Anyone who has understood Continuum Mechanics knows that
Turbulence has nothing to do with letting time tend to infinity, a
game which is one of the deluded fashions alluded to. Turbulence
is a problem of Homogenization in the general framework that I had
introduced in the late 1970s, which has little to do with
-convergence, a game which has transformed in another
deluded fashion (because it is played with entirely wrong
topologies for being useful for Continuum Mechanics); however, the
corresponding Homogenization problems have not been solved yet in
general situations, but the simplified examples which have been
understood explain why physicists have been misled in their use of
probabilities in the laws of Physics.
|
March
10
|
Professor
Alejandro Aceves, University of New Mexico
"Nonlinear optics in photonic structures"
An area of intense research is that of photonics, where light propagation
features are controlled by clever engineering of periodic optical
structures. For example, the fiber bragg grating where an additional
intensity dependent nonlinear index of refraction allows soliton like
propagation with tunable velocities. In this work we consider nonlinear
periodic geometries. We show that the additional transverse dimension
allows for a richer dynamics of light trapping, bending and switching,
provided stable gap soliton-like bullets exist.
|
March
17
|
Dale Cutkosky, University of Missouri
"Polynomial mappings"
A vector of m polynomials in n-variables gives an algebraic mapping of complex spaces Cn to Cm.
This is an example of an algebraic mapping of algebraic varieties. The simplest mappings are the locally monomial
or toroidal mappings. The toroidal mappings from Cn to Cm are given by polynomials which are monomials is the coordinate variables.
We discuss the problem of toroidalization of mappings, and discuss our proof that algebraic mappings of 3 dimensional varieties
can be toroidalized. |
Friday March
18
Special Colloquium
4:00 PM |
Hema
Srinivasan, University of Missouri
"Multiplicity bounds"
If R is a polynomial ring and I is a homogeneous ideal,
then the invariant multiplicity of R/I can be easily computed from any homogenous free resolution
of R/I over R. For this reason, it seems reasonable to bound the multiplicity by the shifts in
a free resolution. The conjectured bounds in terms of the shifts in the minimal resolution of
R/I are still open in general. In this talk we will survey various bounds for the multiplicity
conjectured by Herzog-Huneke-Srinivasan and discuss the current status of these conjectures.
|
March
24
|
SPRING BREAK |
Tuesday
March
29
3:30 PM
Special Lecture
Location: Norman Mayer 106
|
Prof. Philippe Tondeur, University of Illinois and former Director of
Division of Mathematical Sciences at NSF
“Federal Funding of Research in
the Mathematical Sciences”
Abstract: TBA
|
March
31
|
2005 CLIFFORD LECTURES BEGIN
Lecture Topic: "Trends in Experimental Mathematics"
Guest Lecturer: Prof. Jonathan Borwein
|
Monday
April 4
3:30 PM
Special
Colloquium
|
Samson Abramsky, Oxford University
"Information is Physical, but Physics is Logical"
The new fields of quantum information and quantum computation are
causing a re-examination of basic ideas in both Physics and Computer
Science. One of the key ideas which has emerged is that quantum
entanglement --- Einstein's ``spooky action at a distance'' --- can
be seen as a computational resource. Entanglement arises
because the state of a compound (e.g. two-particle) quantum system can
encode correlations between the components, even when they are
spatially separated, so that measuring one component has an
instantaneous effect on the other. This receives a spectacular
application in the teleportation protocol, which uses just two
classical bits to transport an unknown qubit q from one site to
another. Teleportation is simply the most basic of a family of quantum
protocols, including logic-gate teleportation, entanglement swapping,
and quantum key exchange, which form the basis for novel and potentially
very important applications to secure and fault-tolerant communication and
computation.
The current tools available for developing quantum algorithms and
protocols are deficient on two main levels: Firstly, they are too
low-level, because quantum algorithms are currently mainly
described using the `network model' corresponding to circuits in
classical computation. One finds a plethora of ad hoc calculations
with `bras' and `kets', normalizing constants, matrices etc.
At a more fundamental level, the standard mathematical framework for
quantum mechanics (which is essentially due to von Neumann) is
actually insufficiently comprehensive for informatic purposes.
In describing a protocol such as teleportation, or any quantum process
in which the outcome of a measurement is used to determine
subsequent actions, the von Neumann formalism leaves feedback of
information from the classical or macroscopic level back to the
quantum implicit and informal, and hence not subject to
rigorous analysis and proof.
In this talk I'll describe recent work with Bob Coecke, in which we
recast the von Neumann formalism at a more abstract and conceptual
level, and then use the extra structure made available by the
category-theoretic framework to remedy the deficiencies in the
standard approach noted above. This enables a high-level but effective
approach to modelling and reasoning about all the key features of
quantum information processing. The effectiveness of these methods is
demonstrated by a detailed treatment of three of the main quantum
protocols: teleportation, logic-gate teleportation (which is universal
for quantum computation), and entanglement swapping. Because of the
explicit treatment of `classical communication' --- i.e., the use of
measurement outcomes to determine subsequent actions, possibly at
other sites in a compound system than the site at which the
measurement was performed --- it can reasonably be claimed that these
are the first completely formal descriptions and proofs of
correctness of these protocols. From some very practical
considerations we are led to a new fundamental axiomatization of
quantum mechanics which can be cast in an essentially logical
form, where the calculations to derive the information flow inherent
in an entangled quantum system are performed diagrammatically, and
correspond to the logical notion of Cut-elimination. Thus we
find a new kind of ``Categorical Quantum Logic'', radically different
from the Birkhoff-von Neumann quantum logic.
Proessor Abramsky holds the Christopher Strachey Chair of Computer
Science at Oxford University, UK and recently was elected a Fellow of
the Royal Society.
|
Tuesday
April
5
3:30 PM
Norman Mayer 106
Special Lecture
|
Prof. David Eisenbud,
Director, MSRI and UC Berkeley
"The Smallest Projective Varieties"
Any algebraic curve in projective 3-space that is not contained in a plane
has degree at least 3 -- that is, it meets any plane in at least 3 points.
Moreover, any curve of degree 3, can be parametrised (in suitable
coordinates) by
t → (t, t2, t3) .
This was known 150 years ago, and since that time many mathematicians have
used and generalized the result. I will describe some of the
ideas involved, including recent work of mine with Mark Green, Klaus
Hulek, and Sorin Popescu.
|
April
7
|
Prof. Eduardo Cattani, University of Massachusetts
"Binomial Complete Intersections"
A binomial ideal in a polynomial ring
is an ideal generated by binomials. They are
quite ubiquitous in various contexts such as toric
geometry, semigroup algebras, and hyper-geometric
equations. Although binomial ideals are very
amenable to Gröbner and standard bases techniques,
they also provide some of the "worst-case" examples
in computational algebra.
In this talk I will discuss some joint work with
Alicia Dickenstein (U. of Buenos Aires), where we
attempt to obtain properties of a binomial ideal
such as characterization of complete intersections,
number of "solutions" in the zero-dimensional case, etc.
purely in terms of the monomials appearing in a set
of generators of the ideal.
|
April
14
|
Prof. Phillip Maini, Oxford University, UK
"Modelling aspects of
vascular cancer"
The modelling of cancer provides
an enormous mathematical challenge because of its inherent multi-scale nature. For example, in vascular
tumours, nutrient is transported by the vascular system, which operates on
a tissue level. However, it affects processes occurring on a molecular
level. Molecular and intra-cellular events in turn affect the vascular
network and therefore the nutrient dynamics. Our modelling approach is to
model, using partial differential equations, processes on the tissue level
and couple these to the intercellular events (modelled by ordinary
differential equations) via cells modelled as automaton units. Thusfar,
within this framework we have modelled structural adaptation at the vessel
level and we have modelled the cell cycle in order to account for the
effects of p27 during hypoxia. These results will be presented.
|
Monday April
18 Special Colloquium 3:30 PM Gibson 414
|
Prof. Brent D. Strunk, Purdue University
"Hilbert
Functions and Castelnuovo-Mumford Regularity"
"Suppose G is a standard
graded ring over an infinite field. From the minimal graded free resolution
of G, it is possible to derive several invariants, among them the multiplicity,
the Castelnuovo Mumford regularity, the Hilbert series, and the postulation
number. I discuss a sharp lower bound for the regularity of G in terms
of the postulation number, depth, and dimension. I also present a class
of examples in dimension 1 where the postulation number is 0 and the regularity
of G can take on any value between 1 and the embedding codimension of G."
|
April
21
|
Bill Duke, University of California, Los Angeles
"Modular functions and continued fractions"
In this mostly expository talk I will
show the connection between Ramanujan's work on the special values of certain continued fractions and
Klein's theory of the icosahedron. In addition to explaining some of Ramanujan's identities, this
observation opens some avenues for the study of special values of certain modular functions defined by
continued fractions and generalizations.
|
|
*****************************************************************
|
Links
to other archived years...
1999-2000
2000-2001
2001-2002
2002-2003
2003-2004
Fall 2004
Spring 2005
Fall 2005

Mathematics
Department
Tulane University
6823 St. Charles Ave
New Orleans, LA 70118
phone: (504) 865-5727
fax: (504) 865-5063 |
Last
Updated:
April 15, 2005
|
|
|