prior knowledge, in the form of linear inequalities that
need to be satisfied over multiple polyhedral sets, is
incorporated into a function approximation generated by a
linear combination of linear or nonlinear kernels. in
addition, the approximation needs to satisfy conventional
conditions such as having given exact or inexact function
values at certain points. determining such an approximation
leads to a linear programming formulation. by using a
nonlinear kernel and imposing the prior knowledge in the
feature space rather than the input space, the nonlinear
prior knowledge translates into nonlinear inequalities in
the original input space. through a number of computational
examples, it is shown that prior knowledge can significantly
improve function approximation.

given a complex simple lie algebra, joseph has constructed a
completely prime ideal in the universal enveloping algebra whose
associated variety is the minimal non-zero nilpotent orbit. he also
claimed that j is characterized by this property when the lie algebra is
not of type a. unfortunately there is a gap in the proof. we shall
describe a simple proof along different lines. (joint work with g. savin).

joint seminar with uci

let $(x,w)$ be an integral symplectic manifold and let $(l,delta)$ be a quantum line bundle, with connection, over x having w as curvature. with this data, one can define an induced symplectic manifold y with $/dim(y) = dim(x)+2$. this is applied to show that the 5 split exceptional lie groups arise symplectically from the symplectic induction of coadjoint orbits of certain classical groups.

mathematical models of neurons are formulated as nonlinear
stochastic ordinary or partial differential equations.
progress in determining the activity of single neurons for
models of varying degrees of mathematical complexity by analytical
and simulation methods will be described. exact results for the global
activity in a network of such elements will also be
obtained and in particular their approximations by means of
diffusion processes. analogous models for
viral dynamics and epidemic networks may also be considered.

this talk will be a survey of joint work with harold stark on
zeta and l-functions of finite connected graphs, emphasizing parallels
with the zeta and l-functions of number theory.

geometrical optics and its ingredients, eikonals and amplitudes, have
wide applications, such as optimal control, robotic navigation and
computer vision. we propose a local level set method for constructing
the geometrical optics term in the paraxial formulation for the high
frequency asymptotics of 2-d acoustic wave equations. the geometrical
optics term consists of two multivalued functions: a traveltime function
satisfying the eikonal equation locally and an amplitude function
solving a transport equation locally. the multivalued traveltimes are
obtained by solving a level set equation and a traveltime equation with a
forcing term. the multivalued amplitudes are computed by a new
eulerian formula based on the gradients of traveltimes and takeoff
angles. as a byproduct the method is also able to capture the caustic
locations. the proposed eulerian method is second-order accurate and
has complexity of $o(n^2 log n)$. several examples including the well
known marmousi synthetic model illustrate the accuracy and efficiency of
the eulerian method. we will also discuss the extension of the method
to anisotropic elastic wave equations and other possible future
directions.

the adjoint group of a simple complex lie algebra lie(g) has
a unique minimal orbit which we denote by c. we describe for
classical lie algebras, for any natural number k,
the zariski closure of the union kc of all spaces spanned
by k points on c. the image of this set in the projective
space {bbb p}(lie(g)) is usually called the (k-1)-st
secant variety of {bbb p}(c), and its dimension and
defect are easily determined from our explicit description.
we give the smallest k for which the closure of kc is
equal to the lie algebra and compare these results with
the upper bound on secants of general varieties given
in a theorem of f. zak (eg 1993).

this talk describes recent joint work with jan draisma.

i will talk about a stochastic proof of an extension of the strong maximum principle by e. calabi in the framework of local dirichlet forms associated with strong feller diffusions.

gross has refined the birch swinnerton dyer conjecture in the case of
an elliptic curve with complex multiplication by a nonmaximal order.
gross conjecture has been reformulated in the language of derived
categories and determinants of perfect complexes. burns and flach have
realized that this immediately leads to a refinement of gross
conjecture. the conjecture is now expressed as a statement concerning a generator of the image of a map of 1-dimensional modules. this
conjecture is proved by a construction which shows it to follow from
the explicit reciprocity law and rubin`s main conjecture.

let $v$ be a vector field from ${mathbb r}^2$ to the unit circle
${mathbb s}^1$. we study the operator $$ h_vf(x)= p.v. int_{-1}^{1}f(x-tv(x))frac{dt}{t},.$$ we prove that if the vector field $v$ has $1+epsilon$ derivatives, then $h_v$ extends to a bounded map from $l^2$ into itself.

contact geometry is a venerable subject that arose out of the study of geometric optics in the1800s. though the years it has repeatedly cropped up in many areas of mathematics, but only in thepast 30 years or so has it received serious attention. recently there has been great progress inunderstanding contact structures. depending on ones perspective contact structures sometimes seemlike topological objects, sometimes geometric objects and sometimes dynamical objects. in this talki will begin by discussing how contact structures arise out of natural problems and how they have deep connections with topology and dynamics. then after surveying a few topics about contact
structures in low dimensions i will define contact homology in certain situations. contact homologyis a new invariant of contact structures (and/or certain submanifolds of them) that is similar, in
spirit, to gromov-witten invariants of symplectic manifolds or floer homology of lagrangiansubmanifolds in symplectic manifolds. i then will proceed to discuss applications of contact homology, in particular, i will describe how it yields potentially new invariants of submanifolds of
euclidean space.

many graphs arising in various information networks exhibit the power
law behavior the number of vertices of degree $k$ is proportional
to $k^{-eta}$ for some positive $eta$. such graphs are called
power law graphs. in the study of the spectra of power law graphs,
there are basically two competing approaches. one is to prove
analogues of wigner`s semi-circle law while the other predicts that
the eigenvalues follow a power law distributions. we will show that
both approaches are essentially correct if one considers the
appropriate matrices. we will prove that (under certain mild
conditions) the eigenvalues of the (normalized) laplacian of a random
power law graph follow the semi-circle law while the spectrum of the
adjacency matrix of a power law graph obeys the power law. our
results are based on the analysis of random graphs with given expected
degrees and their relations to several key invariants. these results
have implications on the usage of spectral techniques in many areas
related to pattern detection and information retrieval.

this is a joint work with prof. fan chung and prof. van vu.

modern cryptography is very algebraic by nature. in this overview
talk we will explain the major secret and public key
cryptographic protocols. for secret key systems, rijndael has
become the new standard and we will describe this protocol
through a sequence of algebraic operations in a finite ring $r$.

in the area of public key cryptography the major protocols are
the rsa protocol, the traditional diffie-hellman and the elgamal
protocol. the last two protocols are based on the hardness of
the discrete logarithm problem in a finite group.

the discrete logarithm problem can be viewed as a semi-group
action on a set. this leads naturally to a generalized
diffie-hellman key exchange and a generalized elgamal one-way
trapdoor function.

using this point of view we will provide several interesting
semi-group actions on finite sets. our main focus will be
examples of semi-ring actions on a semi-module. these examples
may lead to practical new one-way trapdoor functions.

the presented results constitute joint work with gerard maze and
chris monico.

we introduce covariate adjusted regression (car) for situations where both predictors and response in a regression model are not directly observable, but are contaminated with a multiplicative factor that is
determined by the value of an unknown function of an observable covariate. we demonstrate how the regression coefficients can be
estimated by establishing a connection to varying coefficient regression. the proposed covariate adjustment method is illustrated with an analysis of the regression of plasma fibrinogen concentration as response on serum transferrin level as predictor for 69 hemodialysis patients. in this example, both response and predictor are thought to be influenced in a multiplicative fashion by body mass index. a bootstrap hypothesis test enables us to test the significance of the regression parameters. we establish the asymptotic distribution of the parameter estimates for this new covariate adjusted regression model.

r e c r u i t m e n t

we consider estimation of a density from a sample that contains
measurement errors. this problem, known as a deconvolution problem, has
applications in many different fields such as astronomy, chemistry or
public health, since in real data applications, it happens quite often
that the observations are made with error. the contaminating density, or
error density, is often assumed to be known. in this context, a so-called
deconvolution kernel density estimator has been proposed in the literature
(see for example carroll and hall (1988) or stefanski and carroll (1990)).

the behavior of the deconvolution kernel density estimator depends
strongly on a smoothing parameter called the bandwidth. we discuss several
possible ways of choosing an appropriate bandwidth in practice.

we next consider deconvolution kernel estimation of a density with left
and/or right unknown finite endpoints. from the contaminated sample, we
estimate the boundary of the support by the value which maximizes a
certain diagnostic function. this function can for example be based on the
derivative of a deconvolution kernel estimator of the density. we
establish asymptotic properties of the proposed estimator and study the
practical aspects of the method via a simulation study.

this is joint work with irène gijbels.

langlands conjectured that a continuous complex galois
representation can
be associated to an automorphic ''representation'' such that their $l$-functions
agree. we reduce the problem for representations into $gl(4)$ with solvable
image into several cases. we prove that in certain cases, langlands
modularity conjecture holds. in particular, we obtain a new case of
artin s $l$-function conjecture.

t t o p $quad$ r e c r u i t m e n t

in recent years, vast quantities of
scientific data have been
generated in various disciplines,
thanks to the almost universal use of
computer technology. what are we to do with this data?
can we find simple
ways of understanding complex data?
i discuss two areas of recent research
into this problem: ($1$) nonlinear dimensionality reduction;
($2$) topological estimation.

in monte carlo estimation of expected values of functionals of solutions of sdes, we have to generate approximate sample paths, probably by time stepping. typically, the bias is roughly proportional to a power of the time step, h. the power depends on the time stepper and on the functional. for a functional f(x(t)), so called weak error esimates give first order convergence for the forward euler and milstein methods. to bound the bias for more complicated functionals, we study the joint distribution of the path observed at the time step times: (x(h), x(2h), ... x(nh)), where nh=t. we compute the difference between the joint density for the time stepper and the exact joint density. for forward euler this does not go to zero with h, but for milstein it goes as sqrt(h). our analysis leads to runge kutta method that is simpler than milstein but has similar statistical properties. the talk will include background material including the definition of the milstein method. this is joint work with peter glynn and jose antonio perez.

i will give a general framework to study the topology of
infinite dimensional groups via their actions on contractible spaces known
as buildings. the groups of interest to us will be loop groups, kac-moody
groups, symplectomorphism groups and similar transformation groups. i will
give examples of natural buildings associated to such groups and use them
to derive some consequences.

r e c r u i t m e n t

in this talk i will discuss some recent results on spectral invariants of
torsion type.

spectral invariants of elliptic operators on compact manifolds are
important global geometric quantities. the ray-singer torsion is a
spectral invariant with significant topological implications. we discuss a
new spectral invariant which generalizes ray-singer`s construction. this
new invariant behaves nicely under holonomy restrictions. in particular,
it coincides with the bcov torsion (first constructed in mirror symmetry
theory) when restricted to calabi-yau manifolds.

as an application in algebraic geometry, we prove a shafarevich type
theorem for holomorphic moduli of polarized calabi-yau manifolds. we also
show some links between our new invariant and automorphic forms,
generalizing classical results in the two dimensional case.

parts of the results are joint work with lu and yoshikawa.

order related procedures (such as median, quantiles, and
nonparametric procedures) in one-dimensional data analysis and inference
have played such important roles that their analogues in high dimensions
have been sought for years (but without many satisfactory results). the
task is non-trivial because there is no natural and clear order principle
in high dimensions. on the other hand, data depth turns out to be a quite
promising tool for a center-outward ordering of multi-dimensional
observations. in this talk motivations of data depth are discussed.
examples illustrating notions of data depth including half-space,
simplicial and projection depth are provided. applications of data depth
in location, in regression, and in other settings are discussed. depth
based procedures can outperform their competitors by maintaining a good
balance between efficiency and robustness. computing issues and some
future research directions of data depth are briefly addressed.

i describe the topology of (the classifying space of) the
symplectomorphism groups of a family of symplectic 4-manifolds. in
particular, we calculate the integral cohomology of these classifying
spaces. we also study the space of compatible complex structures on these
symplectic manifolds and outline a proof showing that this space is
contractible.

the sobolev space $w^{1,2}(m,n)$ between two riemannian manifolds
$m$ and $n$ appears naturally in the calculus of variations. we will
discuss necessary and sufficient (topological) conditions for smooth maps
to be strongly or weakly dense in this space. these problems are of
analytical interest and closely related to the theory of harmonic maps.

it is shown that the commutant of the pin-group action on
tensor powers of the spinor representation is already generated by
the elements which appear in the second tensor power, and a complete
set of relations is given. this can be used to completely classify
all tensor categories whose grothendieck semiring is the one of a
classical group.

motivated by a ``mass formula" due to serre for local fields,
this talk will investigate the probability that a uniformly random
monic polynomial with coefficients in the p-adic integers factors
completely into linear factors.

i will discuss some attempts to recover topological information about geometric objects from ``point cloud data" sampled from the object. examples will include data sets obtained from image data, and the problem of recognizing shapes, i.e. subcomplexes of euclidean $3$-space.

the $overlinepartial_b$-neumann problem is the analog for cr manifolds of
the $overlinepartial$-neumann problem. all positive results about this
problem so far have applied to domains with a defining function depending
only on the real and imaginary parts of a single cr function. the key
feature of such domains is that they are foliated (away from a
characteristic curve) by compact, strictly pseudoconvex cr submanifolds of
real codimension 2. i will describe a new approach to finding estimates
based on decomposing the operator into its tangential and transverse parts
with respect to this foliation. estimates for the tangential parts follow
from known results about the tangential cauchy-riemann complex on compact cr
manifolds, while estimates for the transverse part reduce to elliptic
estimates in the plane. for certain domains in the heisenberg group, my
student robert hladky has used this method to obtain sharp boundary
regularity, even near characteristic points.

the j-flow is a parabolic flow on compact kahler manifolds with two kahler metrics. it was discovered by s. donaldson and x. x. chen independently. donaldson defined it in the setting of moment maps and symplectic geometry. chen described the flow as the gradient flow of the j-functional appearing in his formula for the mabuchi energy. the mabuchi energy is an important functional on the space of kahler potentials. its critical points give constant scalar curvature metrics, and its lower boundedness is related to stability in the sense of geometric invariant theory. i will show that under a condition on the initial data, the j-flow converges to a critical metric. i will then explain how this implies the lower boundedness of the mabuchi energy for an open set of kahler classes on manifolds with negative first chern class.

this talk will discuss some conjectures about the relationship between the algebraic k-theory of a field on the one hand and the so-called derived completed complex representation theory of the absolute galois group of the field. i will also discuss the connection of this derived completion with the study of the space of deformations of a given representation.

fix a real reductive group $g$. suppose $mathcal{o}'$ is a
nilpotent orbit in $mathfrak{g}'$, the dual of the complexified lie
algebra of $g$. to each $x' in mathcal{o}'$, one may associate an sl(2)
triple, say $x', y'$, and $h'$. since $(1/2)h'$ lives in a cartan
subalgebra of $mathfrak{g}'$, it defines an infinitesimal character for
$g$. one piece of the arthur conjectures predicts that the smallest
representations of $g$ with infinitesimal character $(1/2)h'$ should
appear as local components of automorphic forms; in particular, they
should be unitary. (two good examples to keep in mind are the trivial
representation and limits of discrete series with zero infinitesimal
character; the former corresponds to the principal orbit $mathcal{o'}$
and the latter to the zero orbit.) in this talk, we explain how to prove
a large part of this conjecture for certain classical groups using the
theta correspondence.

one of the most well known questions of erdos in discrete geometry is
the following: given n points in $r^d$, what is the smallest number of
distinct distances among them ? here d is fixed and n tends to inifnity.
we denote by $f_d(n)$ is smallest number of distince distances.

the problem of determining $f_d(n)$ has been attacked by many
researchers (including erdos, beck, chung,
trotter, szemeredi, beck, ssekely, solymosi-toth, sharir, etc) for
decades. in this talk, i will give a brief overview and also present a new result
(joint with solymosi). this result gives an almost sharp estimate for
$f_d(n)$ for relatively large dimension $d$. the main tool is what we
call "decomposition technique", which appears to be useful in other problems as well.

in attempting to understand the "meat ax" of finite group theory,
diaconis has formulated an urn model. in the simplest case, balls
numbered 0 and 1 are placed in an urn. at times
$n = 1,2,...,$ two balls are drawn with
replacement. those balls are replaced in the
urn, and a new ball that contains the sum mod $2$ of the
numbers on the drawn balls is added to the urn. a conjecture
is that the fraction of balls numbered $1$ converges to $1/2$.
this conjecture and some generalizations are proved
as a two-fold application of the almost supermartingale
convergence theorem of robbins and siegmund $(1972)$.

this is joint research with benny yakir.

principal component analysis (pca) is a tool used across the spectrum of scientific applications. in modern practice, it is often applied to $n imes p$ data matrices with $n$ and $p$ both large. classical theory (anderson
1963) fails to apply in this setting. using random matrix theory, johnstone
(2000) recently shed light on some
theoretical aspects of pca in this setup. specifically, when the entries of the
$n imes p$ matrix
$x$ are iid ${cal n}(0,1)$ and $n/p
ightarrow
ho in (0,infty)$, he showed
that
$lambda_{n,p}$ , the largest eigenvalue of the empirical covariance matrix
$x'x$, converges to the so-called tracy-widom distribution (after proper
recentering and rescaling).
we will show that the result holds when $n,p
ightarrow infty$ and
$n/p
ightarrow 0$ or $
infty$, in effect removing the need to worry about the limiting behavior of
$n/p$.
we will also present preliminary results for rates of convergence. finally, we
will illustrate how these and
related theoretical insights might be used in practice.

it is often useful in cryptography to be able to generate
an elliptic curve over a finite field with a given number of points.
this talk will explain the complex multiplication (cm) method for
constructing suitable elliptic curves and explain a variant which is
joint work with a. agashe and r. venkatesan. i will also explain the cm
method for generating genus 2 curves and some interesting problems which
arise.

*recruitment talk*
we present a new approach to cfd and computational turbulence modeling
using adaptive stabilized galerkin finite element methods with duality
based a posteriori error control for chosen output quantities of interest,
with the output based on the exact solution to the navier-stokes
equations, thus circumventing introducing and modeling reynolds stresses
in averaged navier-stokes equations. we refer to our methodology as
adaptive dns/les, where automatically by adaptivity certain features of
the flow are resolved in a direct numerical simulation dns, while certain
other small scale turbulent features are left unresolved in a large eddy
simulation les. the stabilization of the galerkin method giving a weighted
least square control of the residual acts as the subgrid model in the les.
the a posteriori error estimate takes into account both the error from
discretization and the error from the subgrid model. a crucial observation
from computational examples is that the contribution from subgrid modeling
in the a posteriori error estimation can be small, making it possible to
simulate aspects of turbulent flow without accurate modeling of reynolds
stresses. using the a posteriori error estimates we further consider the
question of uniqueness of weak solutions to the navier-stokes equations,
where we give computational evidence of both uniqueness and non-uniqueness
in outputs of weak solutions.

joint seminar with uci. this seminar is at uci.

joint seminar with uci. this seminar is being held at uci.

*recruitment talk*
epitaxial growth is a modern technology to grow thin solid films by depositing atoms or molecules onto an existing layer of material. microscopic processes in epitaxial growth include the deposition of atoms onto a surface, desorption of adsorbed atoms (adatoms) into the gas phase, surface diffusion of adatoms, attachment and detachment of adatoms to and from atomic steps, adatom island nucleation, and island coalescence. these processes are characterized by fluctuation, non-equilibrium, and multiple spatial and temporal scales. in this talk, i will first present a derivation of an island dynamics model for epitaxial growth that includes step kinetics. this is an improvement of the classical burton-cabrera-frank model that assumes
the adatom equilibrium along steps. an adaptive finite element method for the new model will be described. i will then focus on a class of fourth-order diffusion equations that model the coarsening in the surface dynamics of growing films after the roughening transition. such growth equations are gradient flows of certain free energies. i will
show bounds for coarsening rates and the decay of energy, derive the energy asymptotics in the large-system-limit, and predict the exact scaling laws for the coarsening under the hypothesis of realization.

a descent in a permutation a(1)a(2)...a(n) is an i such that a(i) >
a(i+1). the distribution of the number of descents is given by the well
known eulerian numbers.

we define a new statistic, namely the maximum number of non-overlapping
descents in a permutation. two descents i and j overlap if |i-j| = 1. we
find the distribution of this new statistic using partially ordered
generalized patterns (pogps). the pogps are generalizations of the
babson-steingrimsson patterns, which in turn generalize the classical
permutation patterns.
a segment pattern is a pattern whose occurrence in a permutation is
required to consist of consecutive letters of the permutation. as an
example, the number of descents corresponds to the segment pattern 21.

let p be an arbitrary segment pattern. using pogps, we give the
exponential generating function (e.g.f.) for the entire distribution of
the maximum number of non-overlapping occurrences of p, provided we know
the e.g.f. for the number of permutations that avoid p.

we also discuss pogps in words (with repeated letters), where we get results
similar to those for permutations.

*recruitment talk*
the current renaissance in the study of evolving faceted
crystal surfaces
was prompted by the discovery of nano-scale faceted pyramidal islands
(quantum dots) on si films, as well as the appearance of novel in situ
imaging techniques.
we consider the coarsening dynamics of
faceted crystal surfaces that pertain to two distinct continuum models;
so-called thermal annealing (a) and net-growth (g) regimes.
we present a novel theoretical framework which
unites the two problems by recognizing
their common (leading-order) kinematic framework;
namely, piecewise-affine surfaces evolving on a suitably slow time scale.
dynamic evolution laws, intrinsic to such surfaces, are then found
for each problem through novel matched asymptotic analysis.
our theory resolves the long-standing annealing-to-growth enigma,
whereby the scaling law for the increase in time, t, of the
characteristic facet size, l, is observed to undergo
a transition when switching from (a) to (g).
in addition, the nature of the transition in surface morphology
between (a) and (g) follows readily from the stability
properties of the associated dynamical systems.
large scale simulations, which are rich in both topological and
statistical terms, will also be presented.

in this talk, we will consider the problem of designing multi-focal
optical lenses. this problem has been actively studied over the past
20 years and the results obtained along the way of research have been
used directly in the lens industry.

we study a variational approach for the multi-focal lens design problem
and find out that the euler-lagrange equation associated with the
variational problem is a fourth-order nonlinear elliptic partial
differential equation. we consider two linearizations of the equation
along with three types of boundary conditions, and analyze the existence,
uniqueness as well as regularity of the solutions under these types of
boundary conditions. finally, we propose a numerical method with a special
type of spline functions for solving the linearized partial differential
equations, and the method is shown to be very efficient.

we give a survey of a series of papers by birget, olshanskii, rips and myself about asymptotic invariants of groups and connections between them and other areas of mathematics. in particular we give an algebraic characterization of groups with word problem in np, construct manifolds with arbitrary isoperimetric functions $(say f(x)=x^{pi+e})$, and finitely presented counterexamples to von neumann conjecture (a finitely presented non-amenable group without free subgroups).

i will present a joint work with alicia dickenstein and laura
matusevich. algebraic functions (defined as solutions to algebraic
equations with general symbolic coefficients) are classically known
to satisfy certain systems of linear partial differential equations
with polynomial coefficients. in the talk i will consider a more
general class of systems of differential equations. we prove that
such systems are holonomic and that their complex holomorphic solutions
have moderate growth. we also provide an explicit formula for the
holonomic rank of these systems as well as bases in their spaces of
complex holomorphic and puiseux polynomial solutions.

we study a few classes of hilbert space operators which are complex
symmetric with respect to a preferred orthonormal basis. the existence of
this additional symmetry has notable implications and in particular it
explains from a unifying point of view some classical results.

tracing the use of the term over $150$ years gives insight into the way mathematicians name things, and the things mathematicians name.

put another way: is every polynomial in $2 n^2$ variables that vanishes
on a pair of commuting matrices, in the ideal generated by the obvious
$n^2$ quadratic relations?

alas, we do not know (and i cannot answer the question either).
i will introduce several other related schemes that seem easier to study,
like the space of pairs of matrices whose commutator is diagonal,
which i will prove is a reduced complete intersection, one of whose
components is the commuting variety. conjecturally, it has only one
other component, and i will explain where that one comes from.
along the way we will also see a rather curious invariant of permutations,
and much simple linear algebra.

in this talk we describe our work on proportional hazards model with mixed effects (phmm) for right-censored data. our motivation came from a
multi-center clinical trial in lung cancer, where treatment effects were
found to vary substantially among the centers. we provide a general
framework for handling random effects in proportional hazards
regression, in a way similar to the linear, non-linear and generalized
linear mixed effects models that allow random effects of arbitrary
covariates. this general framework includes the frailty models as a
special case. semi parametric maximum likelihood estimates of the
regression parameters, the variance components and the baseline hazard,
and empirical bayes estimates of the random effects can be obtained via
an mcem algorithm. variances of the parameter estimates are approximated
using louis formula. the model found interesting applications in
recurrent events, twin data and genetic epidemiology. following the
introduction of the model, our recent work has included topics on model
diagnostics and model selection. we will elaborate on one of these
topics during the talk.

lie groups provide a formalization of the concept of symmetry in the classical theory of special functions, combinatorics, and physics. from this viewpoint, daha describes abstract fourier transforms, especially those making the gaussian fourier-invariant. the classical fourier transform, the hankel transform, and the one from the theory of gaussian sums are well known examples. thus daha formalizes an important part of the classical fourier analysis.

the verlinde algebras are the key finite-dimensional examples. there exist three different verlinde algebras of type a 1:
1) the one connected with the hankel transform, and, hopefully,
with the massless conformal field theory,
2) the major verlinde algebra associated with the kac-moody
fusion and the massive cft and,
3) the algebra presumably describing the fusion of the
(1,p)-virasoro model.
they will be discussed in the lectures.

we will read a paper by princeton graduate student jacob rasmussen, on khovanov homology and the slice genus. it is a breakthrough paper, proving the so called milnor conjectures by purely combinatorial means. these conjectures predict the 4-dimensional genus of torus knots, and their only known proof involves gauge theory, or more precisely, seiberg-witten theory.

rasmussen gives a proof using only methods from combinatorial skein theory and a certain spectral sequence. he obtains a concordance invariant for knots, which is absolutely mind blowing. it can show that certain knots with trivial alexander polynomial are not smoothly slice, even though by freedmans theorem they are topologically slice. hence the invariant sees the difference between smooth and topological phenomena in dimension four.

as usual, the talks in this seminar will be given by the participants, with two survey lectures at the beginning given by justin and peter. rasmussens paper, supplemented by some survey articles, will be used as reference for later talks.

introduced 13 years ago, daha play now a solid role in modern representation theory with wide spectrum of applications from harmonic analysis and combinatorics to algebraic geometry and mathematical physics.
i will begin with general motivation in the theory of spherical functions and the definitions in the rank one case. the talk will be mainly about the so-called nonsymmetric verlinde algebras, which are in the focus of the new theory, including applications to the ''non-cyclotomic'' gaussian sums and recent results on the diagonal coinvariants (the combinatorics of two sets of variables).

the space of ordered n-tuples of points on a projective line has a compactification, due to grothendieck and knudsen, with many remarkable properties: it has a natural moduli interpretation, namely it is the moduli space of stable n-pointed rational curves. it has a natural mori theoretic meaning, namely it is the log canonical model of the interior.
for a curve in the interior, there is a description of the limiting stable n-pointed rational curve, due to kapranov, in terms of the tits tree of $pgl_2$. we study these properties for the higher-dimensional versions of the grothendieck-knudsen space, the chow quotients of grassmannians.

lie groups provide a formalization of the concept of symmetry in the classical theory of special functions, combinatorics, and physics. from this viewpoint, daha describes abstract fourier transforms, especially those making the gaussian fourier-invariant. the classical fourier transform, the hankel transform, and the one from the theory of gaussian sums are well known examples. thus daha formalizes an important part of the classical fourier analysis.

the verlinde algebras are the key finite-dimensional examples. there exist three different verlinde algebras of type a 1:
1) the one connected with the hankel transform, and, hopefully,
with the massless conformal field theory,
2) the major verlinde algebra associated with the kac-moody
fusion and the massive cft and,
3) the algebra presumably describing the fusion of the
(1,p)-virasoro model.
they will be discussed in the lectures.

a discussion of results arising from yang-mills gauge theory on compact surfaces and the relationship between ym2 and chern-simons.

positivity is a distinguishing property of the field of real numbers. writing a polynomial as a sum of squares gives a certificate that it is positive. hilbert showed that a positive homogeneous quartic polynomial in three variables (ternary quartic) is a sum of three squares of quadratic polynomials. he also showed that there are positive polynomials of every higher degree or greater number of variables with no such sum of squares representations. this led to his 17th problem - to determine whether a positive polynomial is a sum of squares of rational functions. this was answered in the affirmative by artin in 1926.

recently, positive polynomials have have undergone a revival. in the 1990s lasserre realized that recent theoretical results from real algebraic geometry and semi-definite programming could be combined to give effective algorithms for solving a class of relaxations of hard optimization problems. the relaxation replaces positivity by sum of squares representation.

i will briefly survey the history of positive polynomials and these modern applications, and then discuss a recent strengthening of hilberts theorem on ternary quartics: a positive ternary quartic is a sum of squares in exactly 8 inequivalent ways.

the choice of a proper finite element space is essential to guarantee the
stability of a discretised system of partial differential equations. in
many cases, the differential geometric structure of the system can be
captured by a differential complex, and finding an appropriate discrete
differential complex may lead to a finite element space which yields a
stable discretisation. two problems, one from electromagnetism and
the other from elasticity, will be discussed in this context.

let g be a connected, simply connected, simple group over
the complex numbers. let k be the fixed point group of an involutive
automorphism of g and let p be a parabolic subgroup of g such that kp has
interior in g. then we say that (g,k,p) is a spherical triple if there
is a borel subgroup of k, b, such that b has an open orbit in g/p. this
condition is equivalent with having (degenerate) principal series for the
non-compact real form corresponding to k be multiplicity free. in this
talk we will give a classification of these triples for the exceptional
groups.

we will describe the arithmetic of zeta values in the
function field context. it is a curious mix of many analogies,
some strong theorems where corresponding number field statements
are conjectures, and some questions where the number field situation
is understood, but the function field situation is not even
conjecturally understood

the goal of this presentation is to explore the multiple definitions of design research in education, and particularly in mathematics education. in doing so, i revisit components of brown, a. l. (1992)*, which highlight the issues for warrant. i argue that as yet her concerns have gone relatively unheeded by the education research community. i point to the need for mixed methodologies in support of design based insights and develop a validity framework that is inclusive of design adaptation issues.

* design experiments: theoretical and methodological challenges in creating complex interventions in classroom settings. journal of the learning sciences, 2, 141-178.brown, a. l. (1992)

the subgroup growth of a group is the study of the number of
its index n subgroups as a function of n. we will present some sharp
estimates on this growth for lattices l in higher rank semi-simple lie
groups g. a surprising phenomenom is that this growth depends only on the
root system of g and not on l. in the most general case, the results
depend on the generalized riemann hyphothesis but a number of results can
be also proved unconditionally.

the scattering of solitons off each other and with radiation is studied for nls in three or more dimensions. the general problem of finding the large time behavior of such equations, including the proof of asymptotic completeness, and stability is discussed.

recent solution of this problem for nls with small radiation initial data will be described

in this talk, i will describe a construction of the exceptional
lie algebras of type f and e using the octonions and the principle of triality.

featuring the following speakers:

robert hecht-nielsen - founder, hnc software; professor, electrical and computer engineering ucsd

beth smith - mathematics assistant professor, grossmont
college

saul molina - assistant systems administrator, math dept ucsd

space is limited - reserve your place - email jbitmead@ucsd.edu

ramanujan graphs are k-regular graphs with optimal bounds on their eigenvalues. they play a central role in various questions in combinatorics and computer secience. their construction is based on the work of deligne and drinfeld on the ramanujan conjecture for gl(2). the
recent work of lafforgue which settles the ramanujan conjecture for gl(n) over function fields opens the door to study of ramanujan complexes: these are higher dimensional analogues which are obtained as quotients of the bruhat-tits building of pgl(n) over local fields.

we introduce and study new complete kahler metrics on the moduli and the teichmuller spaces of riemann surfaces, the ricci and the perturbed ricci metric. they are asymptotically equivalent to the poincare metric. the perturbed ricci metric has bounded negative sectional and ricci curvatures. as corollaries we prove the equivalence of these new metrics to several classical metrics such as the kahler-einstein metrics, proving a conjecture of yau in the early 80s. other consequences will also be discussed. this is joint work with k. liu and s.-t. yau.

there has been great interest in two-dimensional representations of galois
groups, from conjectures of artin concerning complex projective
representations of the symmetries of the platonic solids, to conjectures
of shimura and taniyama concerning p-adic representations associated to
elliptic curves. many of these conjectures were recently answered in the
affirmative by wiles and taylor using techniques from arithmetic algebraic
geometry. in this talk, we explain how these results can be extended even
further, and give some applications.

saturday schedule

10:30 - 11:00 am coffee and assorted danish

11:00 - 12:00 pm gunther uhlmann, university of washington

boundary rigidity and the dirichlet-to-neumann map

1:30 - 2:30 pm chuu-lian terng, uci & northeastern university

periodic and homoclinic orbits of the modified 2+1 chiral model

2:45 - 3:45 pm oded schramm, microsoft research

conformally invariant random processes in two dimensions

3:45 - 4:15 pm coffee break

4:15 - 5:15 pm michael lacey, georgia tech

hilbert transforms and smooth families of lines

sunday schedule

9:30 - 10:00 am coffee and assorted danish

10:00 - 11:00 am jean-pierre rosay, university of wisconsin-madison

pseudo-holomorphic discs and rough almost complex structures. (isolated solutions of non-linear pde)

11:15-12:15 pm christoph thiele, ucla

basic questions for the nonlinear fourier transform

alex postnikov recently gave a combinatorially explicit cell
decomposition of the totally nonnegative part of a grassmannian, denoted $gr_{kn}+$, and showed that this set of cells is isomorphic as a graded poset to many other interesting graded posets. the main result of our
work is an explicit generating function which enumerates the cells in $gr_{kn}+$ according to their dimension. as a corollary, we give a new proof that the euler characteristic of $gr_{kn}+$ is 1. additionally, we use our result to produce a new q-analog of the eulerian numbers, which interpolates between the eulerian numbers, the narayana numbers, and the binomial coefficients.

we show that any complex submanifold in hilbert space defined by global equations has a basis of pseudoconvex open neighborhoods, that holomorphic vector bundles are acyclic over smooth complete intersections in hilbert space, and that such complete intersections are holomorphic retracts of some pseudoconvex open neighborhoods.

a tutorial overview of time-domain bootstrap methods for time series will be given with emphasis on block-bootstrap and subsampling. comparisons of the methods
will be discussed, as well as the crucial issue of practical block size choice.

joint seminar with uci held at uc irvine, mstb 254

this seminar is not being held at ucsd but at uc irvine

joint seminar with uc irvine held at uci, mstb 254

this seminar is not being held at ucsd but at uc irvine

let $0 < alpha < beta$ be two irrational numbers satisfying
$1/alpha + 1/beta = 1$. then the sequences $a'_n = lfloor
{nalpha}rfloor$, $b'_n = lfloor{nbeta}rfloor$, $nge 1$, are
complementary over $iz_{ge 1}$. thus $a'_n = {rm mex_1}
{a'_i,b'_i : 1 le i< n}$, $n geq 1$ (${rm mex_1}(s)$, the
smallest positive integer not in the set $s$). suppose that $c =
beta-alpha$ is an integer. then $b'_n = a'_n+cn$ for all $n ge
1$.

we define the following generalization of the sequences $a'_n$,
$b'_n$: let $c,;n_0iniz_{ge 1}$, and let $xsubsetiz_{ge 1}$
be an arbitrary finite set. let $a_n = {rm mex_1}(xcup{a_i,b_i
: 1 leq i< n})$, $b_n = a_n+cn$, $nge n_0$. let $s_n =
a'_n-a_n$. we show that no matter how we pick $c,;n_0$ and $x$,
from some point on the {it shift sequence/} $s_n$ assumes either
one constant value or three successive values; and if the second
case holds, it assumes these values in a very distinct
fractal-like pattern, which we describe.

this work was motivated by a generalization of wythoff's game to
$nge 3$ piles.

this talk covers a variety of conjectures not resolved by mark haiman's
proof of the $n!$-conjecture. we also review what came to be called
"science fiction" which taken literally is blatantly false at the
representation theoretical level, yet it beautifully explains many of the
experimentally observed properties of the macdonald $q,t$-kostka
coefficients.

we give a proof of the universality conjecture
in random matrix theory for orthogonal $(beta=1)$ and
symplectic $(beta=4)$ ensembles in the scaling limit
for a class of weights $w(x)=exp(-v(x))$
where v is a polynomial. for such weights
the associated equilibrium measure is supported on
a single interval.
our starting point is widom's representation
of the correlation kernels for the beta=1,4 cases
in terms of the unitary $(beta=2)$ correlation kernel
plus a correction term which involves orthogonal
polynomials $(op's)$ with respect to the weight w introduced above.
we do not use skew orthogonal polynomials.
in the asymptotic analysis of the correction terms
we use amongst other things
differential equations for the derivatives
of op's due to tracy-widom,
and uniform plancherel-rotach type asymptotics for op's
due to deift-kriecherbauer-mclaughlin-venakides-zhou.
the problem reduces to a small norm problem
for a certain matrix of a fixed size
that is equal to the degree of the polynomial potential.

quantum information theory has generated interesting conjectures concerning products of completely positive maps on matrix algebras. this talk will describe the background to these conjectures and also some recent proofs in special cases. matrix inequalities have played an important role in these results, and the talk will describe applications of the lieb-thirring inequality and an extension of hanner's inequality to this problem.

let a be a square matrix with rational entries. then a can be written as the
sum s + n where s and n also have rational entries, s is semisimple, n is nilpotent, and
s and n commute. this representation is unique, and is called the jordan decomposition
of a. it can be considered as a coordinate-free, and ambient-field-free, version of the
usual jordan canonical form for matrices. this decomposition (in its multiplicative
version) is particularly useful in the study of algebraic groups.

if g is a finite group and a is an element of the rational group ring q[g],
i.e. a is a linear combination of group elements with rational coefficients, then there
is an analogous decomposition: a = s + n where s and n lie in q[g], s is semisimple, n
is nilpotent, and s and n commute (this representation is also unique).

consider the integral versions of these decompositions: if the matrix a has
integer entries, need s and n have integer entries? if the element a in q[g] has integer
coefficients, need s and n have integer coefficients? we give complete answers to these
questions. the multiplicative version of the integral group ring question is much more
subtle, however, and we only have partial results on this problem.

in joint work with j. metcalfe and a. stewart, we prove global and almost
global existence theorems for nonlinear wave equations with quadratic
nonlinearities in infinite homogeneous waveguides. we can handle both the
case of dirichlet boundary conditions and neumann boundary conditions. in
the case of neumann boundary conditions we need to assume a natural
nonlinear neumann condition on the quasilinear terms. the results that we
obtain are sharp in terms of the assumptions on the dimensions for the
global existence results and in terms of the lifespan for the almost global
results. for nonlinear wave equations, in the case where the infinite part
of wave guide has spatial dimension three, the hypotheses in the theorem
concern whether or not the laplacian for the compact base of the wave guide
has a zero mode or not.

ramsey's original theorem states that if one finitely colors the $k$
element subsets of ${\bbb n}$ then there exists an infinite subsequence $m$
of ${\bbb n}$ all of whose $k$ elements subsets have the same color.
this theorem and stronger versions entered into banach space theory in the
1970's.
they were ideal for studying subsequences of a given sequence
$(x_i)\subseteq x$ (infinite dimensional separable banach space).
we survey some of these applications and the following problem.
$x$ is said to satisfy the ultimate ramsey theorem if for every finite
coloring $(c_i)_{i=1}^n$ of its unit sphere $s_x$ and $\varepsilon>0$ there exists
an infinite dimensional subspace $y$ and $i_0$ so that
$s_y\subseteq (c_{i_0})_\varepsilon =\{x:|x-z|<\varepsilon$ for some $z\in c_{i_0}\}$.
what spaces $x$ (if any) have this property?
we survey other results including gowers' block ramsey theorem for banach
spaces.

abstract: on of the most famous problems in number theory is to show that there are arbitrarily long arithmetic progressions, all of whose terms are prime numbers. at the start of the year, this was known to be true only for 3-term progressions. recently, ben green and terrence tao have released a manuscript which purports to prove this conjecture. i will discuss some of the history of this problem, and outline their argument. i intend for this talk to be accessible to a broad audience, and hope that this will lead to a series of talks (not all by me) verifying the green/tao proof.

abstract: an $(h,g)$ sidon set is a set $s$ of integers with the property that the coefficients of
$(\sum_{s \in s} z^s)^h$
are bounded by $g$. these arose naturally is simon sidon's study of fourier series, and have become a standard topic in combinatorial number theory. i will present joint work with greg martin giving constructions of such sets, and discuss numerous open problems.

what is the image of the heat operator? to put it the other way around, what is the domain of the backward heat operator? that is, for which initial conditions is it possible to solve the backward heat equation (say, for some fixed time t)? clearly, the initial conditions must be extremely regular, since the forward heat equation is highly smoothing. in the case of euclidean space $r^{n}$, there is a simple answer: the initial conditions must admit an analytic continuation to $c^n$ with a certain (t-dependent) growth in the imaginary directions. for compact symmetric spaces (e.g. a sphere), there is a very similar answer. for noncompact symmetric spaces (e.g. hyperbolic space), the situation is much more complicated and we are just beginning to understand what is going on. i will describe some old and some new results in this area, which can be expressed in terms of a ‘‘eneralized segal--bargmann transform’’

fifteen years ago, bramble, pasciak and xu developed a framework
for analyzing the multigrid method (the analysis of multigrid
algorithms with nonnested spaces or noninherited quadratic forms,
mathematics of computation, 1991.) it was, known as bpx framework,
widely used in the analysis of mutligrid and domain decomposition
methods. the framework was extended several times, covering less
regularity or non-symmetric, and other cases. however an apparent
limit of the framework is that it could not incorporate the number
of smoothings in the v-cycle analysis. therefore, the framework
is limited in nonnested multigrid methods (as one-smoothing multigrid
methods won\'t converge for almost all nonnested cases), and
it produces variable v-cycle, relaxed coarse-level correction,
or non-uniform convergence rate v-cycle methods, or other non-optimal
results in analysis thus far. therefore, most non-nested finite
element problems were show to converge only for w-cycles based
bpx framework, or an even earlier frame work of bank and dupont.

this paper completes a long time effort in extending the bpx framework
so that the number of smoothings is included in the v-cycle analysis.
we will apply the extended bpx framework to the analysis of many v-cycle
nonnested multigrid methods. some of them were previously proven
for two-level and w-cycle iterations only.

structure preserving numerical integrators aim to preserve as many of the physical invariants of a dynamical system as possible, since this typically results in a more qualitatively accurate simulation. computational geometric mechanics is concerned with a class of structured integrators based on discrete analogues of lagrangian and hamiltonian mechanics.

discrete theories of exterior calculus and connections on principal bundles provide some of the mathematical foundations of computational geometric mechanics, and address the question of how to obtain canonical discretizations that preserve, at a discrete level, the important properties of the continuous system.

some recent progress on the construction of a combinatorial formulation of discrete exterior calculus based on primal simplicial complexes, and circumcentric dual cell complexes will be presented. these techniques have been used to systematically recover discrete vector differential operators such as the laplace--beltrami operator.

for discrete connections, the discrete analogue of the atiyah sequence of a principal bundle is considered, and a splitting of the discrete atiyah sequence is related to discrete horizontal lifts and discrete connection
forms. continuous connections can be obtained by taking the limit of discrete connections in a natural way.

examples spanning the work on exterior calculus and connections include the discrete levi-civita connection for a semidiscrete riemannian manifold, and the curvature of an abstract simplicial complex endowed with a metric on the vertices.

for a given finite separable field extension $l/k$ we would like to find a generator $x \in l$ whose equation is as simple as possible. for example, one would like to have as many vanishing coefficients as possible. more generally, the transcendence degree of the subfield $k$ of $k$ generated by the coefficients of the equation should be as small as possible. it was shown by buhler and reichstein that the minimal transcendence degree one can reach has an interpretation in terms of rational covariants of the symmetric group $s_n$ where $n := [l:k]$. this number is called the essential dimension of $l/k$ or of $s_n$ it can be defined for every finite group. we will describe the relation between covariants and equations for field extensions and will explain the main results in this context.

a classical result from 1861 due to hermite says that every separable equation of degree 5 can be transformed into an equation of the form $x^5 + b x^3 + c x + d = 0$. later, in 1867, this was generalized to equations of degree 6 by joubert. we show that both results can be understood as an explicit analysis of certain covariants of the symmetric groups $s_5$ and $s_6$. in case of degree 5, the classical invariant theory of binary forms of degree 5 comes into play whereas in degree 6 the existence of an outer automorphism of $s_6$ plays an essential r\^ole. although these consequences for equations of degree 5 and 6 have been cited and used many times in the literature, it seems unclear if the methods and ideas of hermite and joubert have really been understood.

the loop space of a complex manifold m, consisting of all maps from the circle $s^1$ to m with some fixed $c^k$ or sobolev regularity, is an infinite dimensional complex manifold. we identify an infinite dimensional subgroup of the picard group of holomorphic line bundles on the loop space of the riemann sphere, and show that the space of holomorphic sections of any such line bundle is finite dimensional. we also compute the (0,1) dolbeault group of the loop space of the riemann sphere (which is infinite dimensional).

we define another invariant for a finite group $g$, the so-called {\it covariant dimension of $g$} which is closely related to the essential dimension of $g$ which we introduced in the previous talk. it is the minimal possible dimension of the image of a faithful (regular) covariant of $g$. it turns out that many results for the essential dimension of a finite group $g$ can be carried over to the covariant dimension of $g$ where they admit surprisingly simple proofs. in this way we have been able to reconstruct the main results of buhler and reichstein for the essential dimension and their applications to field extensions. but still there remain a number of interesting open questions which are quite elementary and easy to understand. some of them will be discussed at the end of the talk.

decompositions of graphs have a number of applications, for example, programming for multiple processor computers. in particular, this makes decompositions of high dimensional cubes into hamiltonian cycles of interest. these decompositions are most easily approached by looking at decompositions of more general cartesian products. for the undirected case, these decompositions are fairly well understood, but i want to present a new way of looking at these constructions. this new outlook allows one to solve the directed case as well.

in this talk we will discuss cy manifolds that are double covers of $cp^3$ ramified over 8 planes. we will show that the moduli space of those cy manifolds is a locally symmetric space. the proof of this fact is based on the proof that the yukawa coupling does not admit quantum corrections. the meaning of this statement will be explain.

lynch's vanishing theorem for generalized whittaker modules
applies to generic homomorphisms of the nilradical of a class of parabolic subalgebras which we have named nice. in this talk we describe the classification of nice parabolic subalgebras of simple lie algebras. our results give rise to a new characterisation of even nilpotents. we will also give a normal form of richardson elements for nice parabolic subalgebras in the classical case.

have you ever seen someone juggle and wonder how he or she does
it? or, are you able to juggle but have wondered how the process might be described mathematically? in this talk, i will introduce the concept of a juggling sequence and explain how juggling sequences can be used to describe simple juggling patterns. i will discuss some of the mathematical questions related to juggling sequences. finally, i will
illustrate some simple juggling patterns by juggling them (when i'm not
picking up the balls off the floor, that is) and exhibit a pattern that
was unknown prior to the discovery of juggling sequences.

refreshments will be provided.

qian, luscombe, and gerstein (2001) introduced a model of gene
duplication that we may formulate as follows. consider a multitype
yule process starting with one individual in which there are no deaths
and each individual gives birth to a new individual at rate one.
when a new individual is born, it has the same type as its parent
with probability $1 - r$ and is a new type, different from all previously
observed types, with probability r. we refer to individuals with
the same type as families and provide an approximation to the joint
distribution of family sizes when the population size reaches $n$.
we also show that if $1 << s << n^{1-r}$, then the number of families
of size at least s is approximately $cns^{-1/(1-r)}$, while if
$n^{1-r} << s$ the distribution decays more rapidly than any power.

over the last 20 years, efficient algorithms have been developed to count the number of points of a given elliptic curve over a finite field. we discuss the inverse problem of constructing elliptic curves with a given number of points over a finite field. the difficulty of the problem depends on its exact wording. we present a solution to the problem that easily handles curves of the size occurring in cryptographic practice, and explain why it should be expected to do so.

let $f$ be an open family of circles in the complex plane and let $p$ be the union of all the circles from $f$. suppose that $f$ is a continuous function on $p$ which extends holomorphically from each circle $c$ belonging to $f$ (that is, its restriction to $c$ extends holomorphically through the disc bounded by $c$). is $f$ holomorphic on $p$? we show that this question is naturally related to a question in $c^2$ and then, for certain families $f$, we show how some standard facts from several complex variables can be used to deal with this question.

the 'small world phenomenon' as observed by the psychologist stanley milgram in the 1960s is that most pairs of people are connected by a short chain of acquaintances. more generally we say a graph exhibits the small world phenomenon if the average distance between vertices is small due to a few random-like edges combined with a highly regular local structure. randomly generated graphs with a power law degree distribution are often used to model large real-world networks. while these graphs have small average distance, they do not have the local structure associated with the small world phenomenon. we define a hybrid model which combines a global graph (a random power law graph) with a local graph (a graph with high local connectivity defined by network flow). we also present an efficient algorithm to extract a highly connected local graph from a given realistic network. we show that the hybrid model is robust in the following sense. given a graph generated by the hybrid model, we can recover a good approximation to the original local graph in polynomial time.

in this talk we will compare the primes (2,3,5,7,11,...) with primes in a
graph which are classes of closed paths in the graph. in the process, we will look at the riemann zeta function from number theory and the ihara zeta function from graph theory and meditate on the riemann hypothesis.

(joint work with denis charles)

the nth modular polynomial parameterizes pairs of elliptic curves with
an isogeny of degree n between them. modular polynomials provide the
defining equations for modular curves, and are useful in many different
aspects of computational number theory and cryptography. for example,
computations with modular polynomials have been used to speed elliptic
curve point-counting algorithms.

the standard method for computing modular polynomials consists of
computing the fourier expansion of the modular j-function and solving a
linear system of equations to obtain the integral coefficients. the
computer algebra package magma incorporates a database of modular
polynomials for n up to 59.

the idea of the talk is to compute the modular polynomial directly
modulo a prime p, without first computing the coefficients as integers.
once the modular polynomial has been computed for enough small primes,
our approach can also be combined with the chinese remainder theorem
(crt) approach to obtain the modular polynomial with integral
coefficients or with coefficients modulo a much larger prime using
explicit crt. our algorithm does not involve computing fourier
coefficients of modular functions.

in many two-phase flows and moving interface problems,
the flux and the solution of the governing pde often
have finite jumps across the interface. such jumps often result from source distributions along the interface. one famous application is peskin's immersed boundary model/method which has been widely used. using a level set function to represent the interface, we have proposed a new method that can transfer an interface with discontinuity in the flux and/or in the solution to an interface problem with a smooth solution if the coefficient pde is continuous. the new formulation is based on extensions of the jumps along the normal line of the interface. if the coefficient of the pde is also discontinuous, then the transformation leads to a new interface problem with homogeneous, also called natural, jump conditions. this will greatly simplify the immersed interface method because no surface derivatives of the jump conditions is needed anymore. theoretical and numerical analysis including implementation details and numerical example will also
be presented.

the talk will begin with a short survey of some of the main enumerative
results in the subject of restricted (or pattern-avoiding) permutations.

next i will discuss some recent work concerning statistics on restricted
permutations, motivated in part by the surprising result of zeilberger et
al. which states that the number of fixed points has the same distribution
in 321-avoiding permutations as in 132-avoiding permutations. i will give two combinatorial proofs of this result, and generalize it to other
statistics. bijections to dyck paths play an important role in the proofs.

finally i will consider permutations avoiding several patterns
simultaneously, as well as generalized patterns (i.e., with the
requirement that some elements occur in adjacent positions). using similar bijections we obtain generating functions enumerating these restricted permutations with respect to several statistics.

i will discuss links between a certain class of pythagorean triples and
certain aspects of modern number theory, such as the theory of elliptic
curves, their l-functions, and the various still unsolved conjectures
predicting their behavior.

during the last decade several stochastic stratified processes were introduced in the probability literature. they include the fiber brownian motion introduced by bass and burdzy as a process that switches between two-dimensional and one-dimensional evolution, a markov process on a `whiskered sphere' described by sowers, processes on trees like the walsh process, the evans process, spider martingales, and brownian snakes. we study the rate of weak convergence to one such process. using a wasserstein-type metric as the distance that metrizes weak convergence, we show that the rate of this convergence can be controlled by the rates of convergence of other related processes.

for a related classical example of a hamiltonian system on a cylinder, the corresponding estimates on the rate of convergence are obtained using two different methods. one of these methods reveals an explicit expression for the wasserstein distance in the classical case.

if $f$ is a nonzero complex-valued function defined on a finite abelian group $a$ and $\hat f$ is its fourier transform, then $|f|| \hat f| \ge |a|$, where $f$ and $\hat f$ are the supports of f and $\hat f$. in this paper we generalize this known result in several directions. in particular, we prove an analogous inequality where the abelian group $a$ is replaced by a transitive right $g$-set, where $g$ is an arbitrary finite group. we obtain stronger inequalities when the $g$-set is primitive and we determine the primitive groups for which equality holds. we also explore connections between inequalities of this type and a result of chebotarev on complex roots of unity, and we thereby obtain a new proof of chebotarev’s theorem.

this talk will discuss the mathematical challenges of the control-oriented
analysis of navier-stokes systems in the following three areas:
\vskip.1in
1. fundamental performance & stabilization limitations,
\vskip.1in
2. gradient-based optimization, and
\vskip.1in
3. model-based linear feedback control.

i will discuss links between a certain class of pythagorean triples and
certain aspects of modern number theory, such as the theory of elliptic
curves, their l-functions, and the various still unsolved conjectures
predicting their behavior.

refreshments will be provided.

we consider the following urn model proposed by diaconis. there is an urn with $n$ balls, each ball has value 0 or 1. pick two random balls and add a new ball with their sum (modulo 2) to the urn. (thus the number of balls increases by one each time). what is the limiting distribution?

in general, let $g$ be a finite additive group. we begin with an $a$ set
$g_1, \dots, g_n$ of (not necessarily different) elements of $g$. (in fact, typically $n$ is much larger than $|g|$). at time $i=0,1,2,\dots,$ we choose two random elements $a$ and $b$ from the set $g_1, \dots, g_{n+i}$ and add the sum $g_{n+i+1} = a+b$ to the set.

siegmund and yakir studied the distribution of the set $g_1,g_2\dots$ and showed that it converges to the uniform distribution. this result leaves open the question: how quickly does this convergence occur? in this talk we address this issue.

in this talk, i will report on a recent joint work with joseph a. shalika and yuri tschinkel on the distribution of rational points of bounded height on certain group compactifications.

in mixed linear models with nonnormal data, the gaussian fisher-information matrix is called quasi information matrix (quim). the quim plays an important role in evaluating the asymptotic covariance matrix of the estimators of the model parameters, including the variance components. traditionally, there are two ways to estimate the information matrix: the estimated information matrix and the observed one. because the analytic form of the quim involves parameters other than the variance components, for example, the third and fourth
moments of the random effects, the estimated quim is not available. on the other hand, because of the dependence and nonnormality of the data, the observed quim is inconsistent. we propose an estimator of the quim consisting partially of an observed form and partially of an estimated one. we show that this estimator is consistent and computationally very easy to operate. the method is used to derive large sample tests of statistical hypotheses that involve the variance
components in a non-gaussian mixed linear model. finite sample
performance of the test is studied by simulations and compared with
the delete-group jackknife method that applies to a special case of non-gaussian mixed linear models.

i extend the definition of concurrence into a family of entanglement
monotones, which i call concurrence monotones. i will discuss their
properties and advantages as computational manageable measures of entanglement. i will then show that the concurrence monotones provide bounds on quantum information tasks. as an example, i will discuss their applications to remote entanglement distributions (red) such as entanglement swapping and remote preparation of bipartite entangled states (rpbes). i will present a powerful theorem which states what kind of (possibly mixed) bipartite states or distributions of bipartite states can not be remotely prepared. the theorem establishes an upper bound on the amount of g-concurrence (one member in the concurrence family) that can be created between two single-qudit nodes of quantum networks by means of tripartite red. for pure bipartite states the bound on the g-concurrence can always be saturated by rpbes.

let $k$ be a field and $gl_n(k)$ the group of invertible n by n matrices over $k$. about a century ago, i. schur described the irreducible polynomial representations of $gl_n(k)$ for the field $k$ of complex numbers. the same problem over a field $k$ of prime characteristic is still widely open. in this context, g. james proved in 1981 a so-called column removal formula. it relates polynomial representations in different homogeneous degrees. combinatorially, it is based on removing the first column of an associated young diagram. we generalize this operation of column removal to considering ``complements" of young diagrams. algebraically this establishes equivalences between categories of polynomial representations in different degrees. as by-product it establishes and explains certain repeating patterns in decomposition numbers of general linear and symmetric groups. this work is related to work by beilinson-lusztig and macpherson. it is joint work with fang and koenig.

the exponential map plays an important role in lie theory; it allows one to linearize a lie group in the neighborhood of the identity element, thus reducing many questions about lie groups to (more tractable) questions about lie algebras. unfortunately (at least for an algebraic geometer),
the exponential map is not algebraic; it is given by an infinite series and thus cannot be defined in the setting of algebraic groups.
\vskip.2in
\noindent the next best thing is to linearize the conjugation action of $g$ on itself in a zariski neighborhood of the identity element. for special orthogonal groups $so_n$ this is done by the classical cayley map, which has been used in place of the exponential map in some applications. in the 1980s d. luna asked which other simple algebraic groups admit a ``cayley map". in this talk, i will discuss the background of this problem and a recent solution, obtained jointly with n. lemire and v. l. popov.

galois theory tells us that that some polynomials \vskip .1in

$f(x) = x^n + a_1 x^{n-1} + ... + a_{n-1} x + a_n$ \vskip .1in

\noindent of degree $n > 4$ cannot be solved in radicals. equivalently, some $s_n$-covers cannot be split by a solvable base extension. j. tits asked whether an analogous assertion remains true if $s_n$ is replaced by a connected group $g$. in this talk i will discuss the background of this problem and recent results (obtained jointly with v. chernousov and $p$. gille) which indicate that solvability in radical may, indeed be possible in this setting. in particular, i will explain a connection we found between tits' question and a variant hilbert's 13th problem.

order parameters such as the surface gradient in thin film growth can be unbounded as the size of an underlying system increases. such unbounded order parameters can be modeled by a variational problem in which the effective free energy consists of a negative logarithmic function of the order parameter and a usual regularizing term. in this talk, we will first describe such a model for unbounded order parameters and compare it with a usual ginzberg-landau type model for domain walls. we will also give heuristic arguments to show why low energy configurations should have large value of the order parameter. rigorous results will then be presented, and proved using the direct method in the calculus of variations. we will conclude the talk by a discussion on the related dynamics.

worldvolumes of $d$-branes on calabi-yau threefolds give rise to
supersymmetric gauge theories. if the $d$-brane is marginally stable
these theories are quiver gauge theories. using the derived category
of coherent sheaves to analyze such $d$-branes, the superpotential of
these gauge theories may be determined systematically.

if $g_1 x g_2$ is a subgroup of a finite group $h$, one can restrict a representation of $h$ to $g_1 x g_2$ and examine how it decomposes. one obtains in this way a function from irreducible representations of $g_1$ to (possibly reducible, possibly zero) representations of $g_2$. in certain cases, this function turns out to be very nice. we examine a particular case of this, when the groups involved are finite groups of lie type. a large portion of the talk will be on recalling the classification of irreducible representations of such groups due to deligne-lusztig and lusztig.

in a recent preprint ``combinatorial hopf algebras and generalized
dehn-sommerville relations"

\noindent(math.co/0310016), aguiar, bergeron, and sottile set up a framework for studying combinatorial invariants encoded by quasisymmetric functions. they show that every character (i.e., multiplicative linear functional) on a graded connected hopf algebra decomposes uniquely as a product of an even character and an odd character, both of which can in theory be computed from the even and odd parts of the ``universal character" on the hopf algebra of quasisymmetric functions. \vskip .1in

\noindent in my talk i will introduce some of these ideas and then go on to give explicit formulas for the even and odd parts of the universal
character. they can be described in terms of legendre's beta function evaluated at half-integers, or in terms of bivariate catalan numbers:
$$c(m,n)=(2m)!(2n)!/(m!(m+n)!n!).$$ i will explain how properties of characters and of quasisymmetric functions can be used to derive several interesting identities among bivariate catalan numbers and in particular among catalan numbers and central binomial coefficients. \vskip .1in

\noindent this work is joint with marcelo aguiar.

i will talk about factorization of integers into primes, public key
cryptography, and more. \vskip .1in

\noindent refreshments will be served!

we define a new spectrum for compact length spaces and riemannian manifolds called the ``covering spectrum" which roughly measures the size of the one dimensional holes in the space. more specifically, the covering spectrum is a set of real numbers $\delta>0$ which identify the distinct $\delta$ covers of the space. we investigate the relationship between this covering spectrum, the length spectrum, the marked length spectrum and the laplace spectrum. we analyze the behavior of the covering spectrum under gromov-hausdorff convergence. this is a joint work with c. sormani.

we consider the problem of best approximating a given function in
$l^2$ of a subset of the unit circle by the trace of an $h^2$ function whose norm on the complementary set is bounded by a prescribed constant. it is known that the solution can be obtained by solving a spectral equation for a certain toeplitz operator. we show how diagonalization of such an operator ‡ la rosenblum-rovnyak allows to estimate the rate of convergence. we also consider the same problem in $l^\infty$ rather than $l^2$ norm, and present its solution that involves some unbounded toeplitz operator.

i'll review how the stability of simulations in numerical relativity is related to having a well-posed continuum problem, and why well-posedness is not a property of the einstein equations as such, but of the way in which they are formulated as an initial-boundary value (time evolution) problem. after reviewing the related concepts of well-posedness, strong hyperbolicity and symmetric hyperbolicity, i discuss applications to the einstein equations, and in particular recent work. i conclude with an outlook on what strategies seem most promising to achieve well-posedness.

building on the work of gromov and schoen, kollar and simpson we
will show that the universal covering of a smooth projective varieties
with a linear fundamental groups is holomorphically convex. at the end we will connect this result with some conjectures of zelmanov's on
burnside type of groups.

projectively simple rings are those positively graded rings which are as close to being simple as possible. we show that under suitable hypotheses, such rings can be described using constructions from algebraic geometry. this naturally leads to an interesting geometric question: which varieties have automorphisms which fix no proper subvarieties? this is joint work with james zhang and zinovy reichstein.

we show that the grothendieck semiring of $o(n)$ is a quotient of the one of $o(\infty)$. using this, we can express restriction multiplicities from $gl(n)$ to $o(n)$ via an alternating sum formula over the elements of a reflection group in terms of classical multiplicites due to littlewood.

joint seminar with uci

joint seminar with uci

suppose one has a polynomial equation in two variables, $f(x,y)=0$. this defines a curve, but if we work over the complex numbers, it in fact
defines a surface in $c^2$, which is difficult to visualize. i will discuss
ways of visualizing these surfaces by introducing the concepts of amoebas, and their relationship to a new notion known as tropical geometry. \vskip .2in

\noindent refreshments will be served!

the existence of recurrent stochastic processes with stationary independent increments in an arbitrary locally compact group has remained a challenging research topic over a period of four decades. on the other hand, there exists an elaborate theory of transient processes in groups leading to interesting problems in potential theory. in the present expository talk, which is designed to be more or less self contained, the speaker will revisit the well-known kesten-spitzer transience criterion for processes in {\it abelian} locally compact groups, and will describe a purely measure theoretic approach to it.

the class numbers of the real cyclotomic fields ${\bf q}(\cos(2\pi/{p^n}))$ are very difficult to compute. indeed, they are not known for a single prime $p>67$. we analyze these class numbers using the cohen-lenstra heuristics on class groups and are led to make the following conjecture: for all but finitely many primes $p$, the class number of ${\bf q}(\cos(2\pi/ {p^n}))$ is equal to the class number of ${\bf q}(\cos(2\pi/ {p}))$ for all positive integers $n$. it is possible that there are no exceptional primes $p$ at all. work in progress to test this conjecture empirically will also be discussed. this is joint work with joe
buhler and carl pomerance.

we will tell the story of the solution of several famous problems of painlev´e, ahlfors and vitushkin. \vskip .1in

\noindent essentially, the theory of nonhomogeneous calder´on-zygmund (cz) operators is the topic of the lecture. the main cornerstone of the theory of cz operators turns out not to be a cornerstone at all. namely, one can completely get rid of
homogeneity of the underlying measure. the striking application of this theory is the solution of the series of problems of painlev´e, ahlfors and vitushkin on the borderline of harmonic analysis and geometric measure theory. \vskip .1in

\noindent we will show how the ideas from nonhomogeneous cz theory interplay with tolsa’s ideas of capacity theory with calder´on-zygmund kernels to give tolsa’s solution of the famous vitushkin conjecture of semiadditivity of analytic capacity. we also show what changes should be maid if we want to grow the dimension and to prove the semiadditivity of lipschitz harmonic capacity in $rn, n > 2$, where the wonderful tool of menger-melnikov’s curvature extensively used in $2d$ is “cruelly missing”.

a combinatorial game is a two-player game with perfect information and no chance elements. the players take turns making moves under clearly defined rules, and the last player able to make a move wins the game. nim is one of the most well-known combinatorial games, and many people know that optimal play in nim involves an addition operation which is just an xor operation in disguise. nim has a richer structure than this, however, as there is also a multiplication operation, and some unexpected and delightful things pop up such as fermat powers (numbers of the form $2^{2^n}$). we'll explore nim fields -- finite fields of objects that aren't numbers, but nimbers, and really bizarre things happen -- even if i could convince you that 4 times 4 is 6, could you ever believe that the cube root of the nimber 2 is infinity? \vskip .1in

\noindent refreshments will be served!

higher composition laws in number theory were discovered by m.
bhargava several years ago. they may be viewed as a generalization of
gauss's law of composition of binary quadratic forms. m. bhargava also
discovered a mysterious connection between higher composition laws and exceptional lie groups. \vskip .1in

\noindent in our talk we will describe an unexpected relation between higher composition laws and the freudenthal construction in the theory of jordan algebras. we will show how this construction can be used to
shed additional light on existing composition laws, as well as provide
new examples of spaces with similar properties.

young tableaux, beloved of combinatorialists, tolerated by representation theorists and geometers, seem at first glance to be an
unruly combinatorial set. i'll define a simplicial complex in which
they index the facets, and slightly more general objects (buch's
``set-valued tableaux'') label the other interior faces. the theorem that says we're on a right track: this simplicial complex is homeomorphic to a ball. i'll explain why this is surprising, useful, and shows why buch didn't discover the exterior faces too. finally, i'll explain how algebraic geometry forced these definitions on us (or, ``how i made my peace with young tableaux''). this work is joint with ezra miller and alex yong.

we first give an introduction to biostatistics, starting with what statistics is all about. we will elaborate on three areas of biostatistics: clinical trials, survival analysis and computational biology (bioinformatics). time permitting, we will also briefly describe the biostatistics graduate programs around the country, and the excellent career opportunities open to those with a biostatistics degree.

in classical potential theory on $r^n (n >= 3)$, the condenser theorem states the following. let $u$ and $v$ be open subsets of $r^n$ with disjoint closures, where $u$ is relatively compact. there exists a newtonian potential $p$ of a signed measure $mu = mu^+ - mu^-$ such that: \vskip .1in

\noindent 1. $0 <= p <= 1$ \vskip .1 in

\noindent 2. $p = 1 on u, p = 0 on v$ \vskip .1in

\noindent 3. $mu^+$ is supported in the closure of $u$, $mu^-$ is supported in the closure of $v$ \vskip .1in

\noindent the fundamental proof of this theorem was given by a. beurling and j. deny in the framework of dirichlet spaces. later k. l. chung and r. k. getoor studied the condenser problem in the probabilistic context of markov processes. they showed that the condenser potential at a point x is simply the probability that brownian motion starting at $x$ hits $u$ before it hits $v$. in this talk we discuss the condenser problem in the potential-theoretic framework of balayage spaces. we introduce the notion of a fine condenser potential, for which existence and uniqueness are proved for arbitrary superharmonic functions on sets $u, v$ which are not necessarily open. the probabilistic interpretation carries over to this setting by replacing the hitting times by the penetration times. these results are joint work with jürgen bliedtner.

motivated by studying the amoeba of a system of polynomial equations, we associate to each matroid $m$ a polyhedral complex $b(m)$, called the ``bergman complex". i will describe the topology and combinatorics of this complex. somewhat surprisingly, the space of phylogenetic trees is (essentially) a bergman complex, and we obtain some new results about it as a consequence. if $m$ is oriented, the bergman complex $b(m)$ has a ``positive part" $b+(m)$, which i will also describe. \vskip .1in

\noindent if time allows, i will show that for a coxeter arrangement $a$, $b(a)$ is closely related to de concini and procesi's compactification of the complement of $a$, and $b+(a)$ is dual to a known coxeter generalization of the associahedron. \vskip .1in

\noindent my talk will assume no previous knowledge of matroids and arrangements. \vskip .1in

\noindent parts of this work are joint with carly klivans, lauren williams, and vic reiner.

the geometric approach to mechanics serves as the theoretical underpinning of innovative control methodologies in geometric control theory. these techniques allow the attitude of satellites to be controlled using changes in its shape, as opposed to chemical propulsion, and are the basis for understanding the ability of a falling cat to always land on its feet, even when released in an inverted orientation. \vskip .1in

\noindent curiously, while the geometric structure of mechanical systems plays a critical role in the construction of geometric control algorithms, these algorithms have typically been implemented using numerical schemes that ignore the underlying geometry. \vskip .1in

\noindent geometric integration is the field of numerical analysis that focuses on developing geometric structure-preserving integrators, and computational geometric mechanics focuses on developing geometric integrators for dynamical systems arising from mechanics. \vskip .1in

\noindent this talk will introduce some of the discrete differential geometric tools necessary to implement control algorithms in a manner that respects and preserves the geometry of the problem. these tools include discrete analogues of lagrangian mechanics, the exterior calculus of differential forms, and connections on principal bundles. \vskip .1in

\noindent this is joint work with mathieu desbrun (cs, caltech), anil hirani (jpl), jerrold marsden (cds, caltech), alan weinstein (math, berkeley).

we say that a sequence of dense graphs $g_n$ is convergent if for every fixed graph $f$ the density of copies of $f in g_n$ tends to a limit $f(f)$. many theorems and conjectures in extremal graph theory can be formulated as inequalities for the possible values of the function $f$. we prove that every such inequality follows from the positive definiteness of the so-called connection matrices. moreover we construct a natural limit
object for the sequence $g_n$ namely a symmetric measurable function on the unit square. along the line we introduce a rather general model of random graphs which seems to be interesting on its own right. \vskip .1in

\noindent joint work with l. lovasz (microsoft research).

a standard approach to reduced-order modeling of higher-order
linear dynamical systems is to rewrite the system as an equivalent first-order system and then employ krylov-subspace techniques for reduced-order modeling of first-order systems. while this approach results in reduced-order models that are optimal in a pade sense, in general, these models do not preserve the form of the original higher-order system. \vskip .1in

\noindent in this talk, we present a new approach to reduced-order modeling of higher-order systems based on projections onto suitably
partitioned krylov basis matrices that are obtained by applying krylov-subspace techniques to an equivalent first-order system. we show that the resulting reduced-order models preserve the form of the original higher-order system. moreover, possible additional properties such as passivity or reciprocity are also preserved. while the resulting reduced-order models are no longer optimal in the pade sense, we show that they still satisfy a pade-type approximation property. we also discuss some implementation details and present some numerical examples.