\indent this talk is a survey on the joint results with s.ovsienko, v. serganova and i. shestakov. it is devoted to the problem of classification of indecomposable jordan bimodules over finite dimensional jordan algebras when squared radical is zero.

\indent recall, that for a jordan algebra $j$ the category $j$-bimod of $k$-finite dimensional $j$-bimodules is equivalent to the category $u$-mod of (left) finitely dimensional modules over an associative algebra $u = u(j)$, which is called the universal multiplication envelope of $j$. if $j$ has finite dimension the algebra $u$ is finite dimensional as well. in particular, in accordance with the representation type of the algebra $u$ one can define jordan algebras of the finite, tame and wild representation types.

\indent from the other side to each jordan algebra corresponds a lie algera $tkk(j)$. moreover there is a correspondence between the finite dimensional jordan modules over $j$ and finite dimensional lie modules over $tkk(j)$.

\indent this allows us to apply to the category $j$-bimod all the machinery developed in the representation theory of finite dimensional algebras as well as the representation theory of lie algebras.

by utilizing machine learning techniques for privacy-preserving
classification, we consider linear programs with partitioned
constraint matrices with each partition belonging to an entity
that is unwilling to share its partition or make it public. for
vertically partitioned matrices we employ a random matrix
transformation that generates a linear program based on all the
privately held data but without revealing the data or making it
public. the component groups of the solution of the transformed
problem can be decoded and made public only by the original group
that owns the corresponding constraint matrix columns.

for a horizontally partitioned constraint matrix, we multiply
each partition by an appropriately generated and privately held
constraint matrix. this results in an equivalent linear program
that does not reveal any of the original data or make it public.
the solution vector of the transformed linear program is publicly
generated and is available to all entities.

\indent from every countable group g or measure preserving
action of g on a probability space x, one can construct a von neumann algebra. a central theme in the theory of von neumann algebras is understading how much of the group or group action is ``remembered'' by its von neumann algebra. in this talk, i will survey recent results which provide the first classes of groups and group actions that can be completely recovered from their von neumann algebras.

recent work of haglund, armstrong, rhoades
and sagan has led to the discovery a variety of
combinatorial properties of tesler matrices. in this talk
we focus on the connection between tesler matrices
and parking functions and its consequences
in the theory of diagonal harmonics.

\indent probabilistic graphical models or markov random fields provide a graph-based framework for capturing conditional independence relationships between random variables of a high-dimensional multivariate distribution. this interdisciplinary topic has found widespread application in a variety of areas including image processing, bioinformatics, combinatorial optimization and machine learning. estimating the graph structure of the model from samples drawn from it forms an important task, since the structure reveals important relationships between the variables. however, structure estimation has several challenges: in general graphical models, it is np-hard; the models are also typically in the high-dimensional regime where the number of variables is much larger than the number of samples obtained. i will address these challenges in the talk.

\indent i will talk about our recent results on learning lsing models on sparse erdos-renyi random graphs. we establish achievability of consistent structure learning when the model is in the so-called uniqueness regime, where there is a decay of long-range correlations. the algorithm is based on a set of conditional mutual information tests and is shown to be consistent for structure estimation with almost order-optimal sample complexity. a simpler algorithm based on correlation thresholding is also consistent, but under more stringent conditions. thus, we establish that correlation decay is a sufficient condition for consistent structure learning in random graphs. we also prove a converse result on the number of samples required by any algorithm to consistently recover the random graph structure. i will also provide an overview on our recent results on structure learning in tree models, and more generally, in latent tree models with hidden variables.

fusion categories are quantum analogues of finite groups. they describe certain topologically invariant 2-dimensional quantum systems, and may be relevant for building a quantum computer. families of fusion categories can be constructed from quantum groups, subfactors or conformal field theory. attempting to classify small examples requires techniques from analysis, combinatorics, representation theory and number theory. the classification results available so far reveal intriguing exotic examples and leave many questions.

skew young tableaux are simple combinatorial objects
arising in the theory of symmetric functions and the representation
theory
of the symmetric group. the number $f^\sigma$ of (standard) skew young
tableaux of skew shape $\sigma$ has a simple determinantal formula due
to
aitken. we will discuss some situations for which there exist other
formulas or generating functions for $f^\sigma$. for instance, for certain
skew shapes $\sigma$ the number $f^\sigma$ can be described in terms of
euler numbers (the number of alternating permutations of $1,2,\dots,n$)
using an analytic technique introduced by elkies and further developed
by
baryshnikov and romik. certain other sequences $\sigma_n$ of skew shapes
have simple generating functions for the numbers $f^{\sigma_n}$, based
on
a well-known connection between determinants and generating functions.

by dynamical coupling of data with known models, we determine underlying parameters and unmeasured state variables for a variety of systems, including lorenz, colpitts, and hodgkin-huxley neurons. the dynamic coupling is mediated by use of a cost function, which is minimized by optimization software (snopt, ipopt) to achieve the desired synchronization. considering measurement and model noise, we discuss the same problem where we introduced an 'action' in order to estimate states and parameters. this action is used along with markov chain monte carlo methods in order to sample from a probability distribution.

\indent the jones polynomial can be understood in terms of the representation theory of the quantum group associated to $sl2$. this description facilitated a vast generalization of the jones polynomial to other quantum link and tangle invariants called reshetikhin-turaev invariants. these invariants, which arise from representations of quantum groups associated to simple lie algebras, subsequently led to the definition of quantum 3-manifold invariants. in this talk we categorify quantum groups using a simple diagrammatic calculus that requires no previous knowledge of quantum groups. these diagrammatically categorified quantum groups not only lead to a representation theoretic explanation of khovanov homology but also inspired webster's recent work categorifying all reshetikhin-turaev invariants of tangles.

a dual equivalence for an arbitrary collection of
combinatorial objects endowed with a descent set is a relation for which
equivalence classes group together terms according to the schur
expansion of the corresponding generating function. after outlining the
definition of dual equivalence, we'll present three main applications:
the schur expansion of macdonald polynomials, schur positivity of
k-schur functions (joint with s. billey), and a combinatorial rule for
the littlewood-richardson coefficients of the grassmannian in the
special case of a schubert polynomial times a schur function (joint with
n. bergeron and f. sottile).

\indent i will discuss the problem of efficiently constructing
curves of genus 1 and 2 over finite fields with a
prescribed number n of points. in both cases, there are algorithms that, at least heuristically and in practice, run in time polynomial in log n. they are of complex analytic nature, using cm-techniques. time permitting, i will also explain why these techniques are provably insufficient to efficiently construct genus-2 jacobians with a presecribed number of points.

let $a/k$ be an abelian variety over a global field $k$.
for each place $v$ of $k$, one associates an integer $c(v)$ called the tamagawa
number of the place, using the reduction of the abelian variety at $v$.
let $c$ denote the product of the $c(v)'s$. let $t$ denote the order of the
torsion subgroup of mordell-weil group $a(k)$. the ratio $c/t$ is a factor in
the leading term of the l-function of $a/k$ at $s=1$ predicted by the
conjecture of birch and swinnerton-dyer.
we investigate in this talk possible cancellations in the ratio $c/t$.
for elliptic curves over $q$. the smallest ratio $c/t$ is $1/5$, obtained only
by the modular curve $x_1(11)$.

\indent ion channels are irresistible objects for biological study because they are ‘nanovalves of life’ controlling most biological functions, much as transistors control computers. direct simulation of channel behavior in atomic detail is difficult if not impossible. gaps in scales of time, volume, and concentration between atoms and biological systems are each ~1012. all the gaps must be dealt with at once, because biology occurs on all the scales at once.
simple models are surprisingly successful in dealing with ion binding in three very different (and important) channels: the sodium channel that produces the signals of nerve and muscle and two cardiac calcium channels that control contraction. amazingly, one model with the same three parameters accounts quantitatively for qualitatively different binding in a wide range conditions for two very different calcium and sodium channels. binding free energy is an output of the calculation, produced by crowding charged spheres into a very small space. the model does not involve any traditional chemical ‘quantum’ binding energies at all.
how can such a simple model give selectivity when crystallographic wisdom and chemical intuition says that selectivity depends on the precise structural relation of ions and side chains? the answer is that structure is a computed consequence of forces in these correlated crowded systems. binding sites are self-organized and at their free energy minimum. different structures form in different conditions. binding is a consequence of the ‘induced fit’ of side chains to ions and ions to side chains.
equilibrium is death to biology. a variational approach is obviously needed to replace our equilibrium analysis and is well under way, applying the energy variational methods of chun liu, used to deal with highly correlated systems like liquid crystals.

in 1913, major percy macmahon showed that the major index
and inversion number statistics are equidistributed over permutations.
a bijective proof of this fact was first given in 1968 by dominique
foata who constructed a recursive bijection on permutations such that
the major index of the source is the inversion number of image. in
2004, jim haglund made a major breakthrough in the theory of macdonald
polynomials by conjecturing a formula for macdonald polynomials,
proved shortly thereafter with haiman and loehr, that involved
relatively simple generalizations of the major index and the inversion
number. in this talk, we will show how a filtration of foata's
bijection can be used to give a simple proof of macdonald positivity
for certain cases and outline how this approach might be generalized.
time permitting, we will outline how similar techniques might be
useful in giving a bijective proof of the so-called q,t symmetry of
macdonald polynomials. this talk will be accessible to first year
graduate 2022年亚洲世界杯预选赛 and contains several open problems.

\indent i will talk about the fundamental theorem of affine sieve (joint with sarnak). the main black box in the proof of this result will be also explained. it is a theorem on a necessary and sufficient condition for a finitely generated subgroup of sl(n,q) under which the cayley graphs of such a group modulo square free integers form a family of expanders (joint with varju).

\indent we consider group-invariant cr mappings from spheres to hyperquadrics. given a finite subgroup $\gamma \subset u(n)$, a construction of d'angelo and lichtblau yields a target hyperquadric $q(\gamma)$ and a canonical map $h_{\gamma} : s^{2n-1}/\gamma \to q(\gamma)$. for every $\gamma \subset su(2)$, we determine this hyperquadric $q(\gamma)$, that is, the numbers of positive and negative eigenvalues in its defining equation. for families of cyclic and dihedral subgroups of $u(2)$, we study these numbers asymptotically as the order of group tends to infinity. finally, we explore connections with invariant theory and representation theory.

\indent whereas many physical systems can be identified as hamiltonian dynamical systems, mechanical systems under rolling and sliding constraints, even simple ones such as a rolling penny, skateboard, and sleigh, are non-hamiltonian. this is due to the fact that those constraints are nonholonomic (non-integrable). nonholonomic constraints destroy some nice features of hamiltonian dynamical systems, most importantly symplecticity, while retaining some hamiltonian properties, such as energy conservation. many concepts and ideas in hamiltonian dynamics have been generalized from the differential-geometric point of view to incorporate nonholonomic constraints and also to explain the "almost hamiltonian" behavior of nonholonomic systems. in this talk, i will show how to generalize hamilton--jacobi theory to nonholonomic systems and its application to exactly integrating the equations of motion, touching on the basic geometric concepts of nonholonomic and hamiltonian systems and also the tools and techniques used to reconcile the differences between them.

\indent let $m_0$ be a closed subset of $r^n+1$ that is a smooth hypersurface except for a finite number of isolated singular points. suppose that $m_0$ is asymptotic to a regular cone near each singular point.

can we flow $m_0$ by mean curvature?

theorem $(n<7)$: there exists a smooth mean curvature evolution starting at $m_0$ and defined for a short time $0<t<eps$.

such an initial $m_0$ might arise as the limit of a smooth mean curvature evolution defined earlier than $t=0$. thus, the result allows us to flow through singularities in some cases.

we use a monotonicity formula that complements the monotonicity formula of huisken. the method applies to other geometric heat flows as well.

\indent have you ever wanted to access a database in such a way that even the database can't tell what you're looking for? better yet, don't answer that. regardless, we will investigate how an accommodating database can allow such a query. we'll also discuss possible connections to circumventing the patriot act (don't tell the fbi!) and furthering space research.

\indent we report on recent work joint with jason bell. makar-limanov showed that the quotient division ring of the first weyl algebra contains a copy of a free algebra on 2 generators. we prove the natural analog of this result for arbitrary iterated skew polynomial rings of fields.

\indent we study the singular set of a singular levi-flat real-analytic
hypersurface. we prove that the singular set of such a hypersurface is levi-flat in the appropriate sense. we also show that if the singular set is small enough, then the levi-foliation extends to a singular codimension one holomorphic foliation of a neighborhood of the hypersurface.

we examine the problem of data assimilation in two different ways:

(1) as a special case of optimization where one attempts to minimize the parameters and state variables of a model set of equations to a time series of observations. to put this problem in context, we look at an example from neuroscience where we optimize spiking neuron models to noisy experimental data.

2) in a path integral formulation using an example from partial differential equations (the barotropic vorticity equations used as a model) as a method for obtaining means and distributions from high level integrals. this approach does not rely on optimization,but on the evaluation of a high dimensional integral.

both approaches lend themselves to parallel implementation on gpus using nvidia's cuda c language. these algorithms vary in complexity, with some taking advantage of phenomena from nonlinear dynamics to improve their behavior. we discuss some practical limitations to parallelization due to the hardware architecture and concerns surrounding memory management.

\indent in recent years, kinetic transport models have received a lot of attention in various fields, including semiconductor device modeling, plasma physics, etc. this talk will focus on the boltzmann equation, which is one of the most important equations in statistical physics. the boltzmann equations describe the time evolution of the probability density functions, and are generally composed of a transport part and a collision part. those equations have a lot of interesting structures that comes from applications and are computationally challenging to solve. in this talk, we will look into two classes of boltzmann equations: one being the boltzmann-poisson systems in semiconductor device simulations, and the other being the linear vlasov-boltzmann transport equations. the goal is to design computationally efficient schemes that can preserve the important structures of the physical systems. i will motivate the choice of the discontinuous galerkin (dg) finite element methods for treating those equations. the dg schemes enjoy the advantage of conservative formulation, flexibility for arbitrarily unstructured meshes, with a compact stencil, and with the ability to easily accommodate arbitrary h-p adaptivity. numerical issues such as implementation, algorithm design and analysis for suitable applications will be addressed. benchmark numerical tests will be provided to demonstrate the performance of the scheme compared to existing solvers such as monte-carlo and finite difference solvers.

\indent spectral collocation methods are a powerful set of methods used to solve partial differential equations and ordinary differential equations numerically. this talk will present some of the basic theory behind spectral collocation methods, and provide several examples of how they can be utilized. along the way, we will encounter approximation theory, orders of convergence, wave and soliton equations, and even some nice pictures. no prior knowledge of numerical analysis is assumed; if you are curious about numerical methods but don't have much background, this talk should provide a gentle introduction.

\indent covariance matrix is of fundamental importance in many aspects of statistics. recently, there is a surge of interest on regularized covariance matrix estimation using banding, tapering and thresholding methods, in high dimensional statistical inference, where multiple iid copies of the random vector from the underlying multivariate distribution are required.

\indent in the context of time series analysis, however, it is typical that only one realization is available, so the current results are not applicable. in this talk, we shall exploit the connection between covariance matrices and spectral density functions using the idea in toeplitz~(1911) and grenander and szeg\"o~(1958)

\indent in this talk we will prove the following obstruction result to
functors extending the zariski spectrum: every contravariant functor from rings to sets whose restriction to the full subcategory of commutative rings is isomorphic to spec must assign the empty set to complex matrix algebras of order at least 3. the proof relies crucially on the kochen-specker "no-hidden-variables" theorem of quantum mechanics. we will also discuss a (very) recent generalization of the result due to van den berg and heunen.

the talk will give an introduction
to this new branch of compressed sensing.
one has an affine subspace intersect the positive semideinite (psd)
matrices and wishes to find a smallest rank
matrix therein. this is a highly nonconvex
problem. minimizing the trace is a convex problem
which often gives the correct answer. there is an
elegant probablistic analysis which applies in some
situations. the talk gives an exposition of this.

\indent improvements of the obvious lower bounds on the independence number of (hyper)graphs have had impact on problems in discrete geometry, coding theory, number theory and combinatorics. one of the most famous examples is the result of komlos-pintz-szemeredi (1982) on the independence number of 3-uniform hypergraphs which made important progress on the decades old heilbronn problem. we give a sharp upper bound on the chromatic number of simple k-uniform hypergraphs that implies the above result as well as more general theorems due to ajtai-komlos-pintz-spencer-szemeredi, and duke-lefmann-rodl. our proof technique is inspired by work of johansson on graph coloring and uses the semi-random or nibble method. this is joint work with alan frieze.

\indent we usually only justify time series estimators using asymptotic theory, but the sample size for time series, say those yearly macro series, is usually limited, not more than 100. additionally, high dimensionality and serial dependence makes the asymptotics harder to be a good approximation for a finite sample. my works in high dimensional time series modeling tries to solve these problems, i.e. to quantify the interplay and strike a balance between degree of time dependence, high dimensionality and moderate sample size (relative to dimensionality). in this talk, i will talk about generalized dynamic factor models (briefly), large vector autoregressions for modeling expectation (in detail), and also dynamic volatility matrix estimation (briefly) if time permits.

\indent a multivariate real polynomial $p$ is nonnegative if $p(x) \geq 0$ for all $x \in r^n$. i will review the history and motivation behind the problem of representing nonnegative polynomials as sums of squares. such representations are of interest for both theoretical and practical computational reasons and i will discuss several applications. i will then discuss some theoretical aspects of sums of squares representations of nonnegative polynomials, in particular, some underlying fundamental reasons that there exist nonnegative polynomials that are not sums of squares.

tutte founded the enumeration theory of planar maps in a
series of papers in the 1960s. we are interested in rooted planar maps
which can be thought as connected planar graphs embedded in the sphere
with a directed edge distinguished as the root. a planar map is
non-separable if it has no loops and no cut-vertices. non-separable
planar maps are also called 2-connected maps. another class of maps of
our interest is bicubic maps, which after removing the root orientation
are connected regular bipartite graphs with vertex degree 3.
cori, jacquard and schaeffer introduced description trees in 1997, to
give a general framework for the recursive decompositions of several
families of planar maps studied by tutte. these trees are not only
interesting in their own right, but also they proved to be a useful tool
in obtaining non-trivial equidistribution results on planar maps,
certain pattern avoiding permutations, and objects counted by catalan
numbers.

in this talk, i will provide an overview of several recent results and
research trends related to planar maps and description trees. most of
the results are ``work in progress'' of several research teams.

the famous carleson corona theorem asserts that the open
unit disk is dense in the maximal ideal space of the algebra of
bounded holomorphic functions on it (denoted $h^\infty$). similar
statements for the algebra of bounded holomorphic functions on a
polydisk and for slice algebras for $h^\infty$ remain the major open
problems of multivariate complex analysis. for instance, the answer to
the last problem would be obtained if one were able to show that
$h^\infty$ has the grothendieck approximation property. this problem
posed by lindenstrauss in the early 1970th is also unsolved. the
strongest result in this direction was proved by bourgain and reinov
in 1983 and asserts that $h^\infty$ has the approximation property up to
logarithm. in the talk i will present a proof of the corona theorem
for slice algebras for $h^\infty$, describe topological structure of the
maximal ideal space of $h^\infty$ and as a corollary present some
results on $sz$. nagy operator-valued corona problem for $h^\infty$.

\indent function theory of several complex variables is much less well understood than function theory of functions of one variable. one approach to attempting to bridge this divide is to study an analytic function $f$ on $d^n$ as follows. fix a 1-dimensional algebraic variety $v\subset c^n$ and let $f$ denote the restriction of $f$ to $v$. since $v$ is 1-dimensional, $f$ behaves somewhat like a function of one complex variable and we could potentially apply the theory of functions of one variable to understanding $f$. if we can use this approach to prove facts about $f$, then we could potentially extend some of these results to $f$. in particular, we take this approach to generalize to $d^n$ the classic schwarz lemma on the disc $d$. familiarity with the definition of an analytic function of one variable is the only thing that will be assumed.

function theory of several complex variables is much less well understood than function theory of functions of one variable. one approach to attempting to bridge this divide is to study an analytic function f on the polydisc as follows. fix a $1$-dimensional algebraic variety $v$ in $c^n$ and let $f$ denote the restriction of $f$ to $v$. since $v$ is $1$-dimensional, $f$ behaves somewhat like a function of one complex variable and we apply the theory of functions of one variable to $f$. we use this approach to prove facts about $f$ and then we extend certain results about $f$ to results about $f$. in particular, we take this approach to generalize to $d^n$ the classic schwarz lemma on the disc $d$ and give sufficient conditions for a bounded analytic function on $d^n$ to be uniquely determined by its values on a finite set of points. in terms of the pick problem on $d^n$, we give sufficient conditions for a pick problem to have a unique solution.

\indent the problem of the densest packing of space by congruent regular tetrahedra has a long history, starting with aristotle's assertion that regular tetrahedra fill space, and continuing through its appearance in hilbert's 18th problem. this talk describes its history and many recent results obtained on this problem, including contributions from physicists, chemists and materials scientists. the current record for packing density is held by my former graduate student elizabeth chen, jointly with michael engel and sharon glotzer.

if a is an abelian variety over a p-adic field k then a has good
reduction if and only if the p-adic tate module of a is a crystalline
representation of the absolute galois group of k. as there are examples of
curves over k with bad reduction whose jacobian has good reduction, the
galois action on the p-adic etale cohomology of the curve does not
determine its reduction. we will discuss these issues and point
to a p-adic criterion of good reduction for curves.

\indent the talk will review semidefinite programming (sdp) relaxations for polynomial optimization and show how to solve them. we propose regularization type methods to solve such large scale sdp problems. significantly bigger problems would be solved, which is not possible by using prior existing methods like interior-point algorithms. numerical examples will also be shown.

we consider the following dynamic boolean model introduced by
van den berg, meester and white (1997). at time $0$, let the nodes of the
graph be a poisson point process in $r^d$ with constant intensity and let
each node move independently according to brownian motion. at any time $t$,
we put an edge between every pair of nodes if their distance is at most $r$.
we study two features in this model: detection (the time until a target
point--fixed or moving--is within distance $r$ from some node of the graph),
coverage (the time until all points inside a finite box are detected by
the graph) and percolation (the time until a given node belongs to the
infinite connected component of the graph). we obtain asymptotics for
these features by combining ideas from stochastic geometry, coupling and
multi-scale analysis. this is joint work with yuval peres, alistair
sinclair and alexandre stauffer.

given a riemannian manifold $m$, when can it be isometrically
embedded in euclidean space? when can a local isometry be found, and
when can a global isometry be found? what is the minimum dimension of
the target euclidean space if $m$ has dimension $n$? these questions have
been extensively studied during the last century, with perhaps the
best known result being the famous nash embedding theorem from the
1950's. the aim of this talk is to introduce the problem and some of
the well known results. the talk is intended to be more of a history
lesson rather than technical, so there will be minimal discussion of
proofs, and no background required.

\indent this talk will introduce a new class of models which can lead to efficient estimation in multivariate analysis. some members in the class include the basic envelope model, partial envelope model, inner envelope model, scaled envelope model, and heteroscedastic envelope model. they have the common word ``envelope'' in their names because they are all constructed by enveloping: use reducing subspaces to connect the mean function and the covariance function, so that the number of parameters can be reduced. the application of enveloping is very broad and can be used in many contexts to control parameterization. theoretical results, simulations and a large number of data examples show that the efficiency gains obtained by enveloping can be substantial.

\indent the eigenvalues of the laplacian (or laplacian with potential) on a smoothly bounded domain domain are very natural quantities, arising as the fundamental tones of a drum, the rates of decay of diffusions, and the energy levels of quantum systems. i will discuss some of the history relating to inequalities for low eigenvalues, leading up to the proof of a conjecture of yau and van den berg for the `fundamental gap' or excitation energy of a convex domain.

\indent in this talk, we will discuss about li-yau-hamilton type
differential harnack inequalities, heat kernel estimates and their
applications to study type i ancient solutions of the ricci flow.

\indent we explore the question of whether there are nontrivial
solutions to the two-valued minimal surface (2mse) equation defined over the punctured plane. the 2mse is a non-uniformly elliptic pde, degenerate at the origin, originally introduced by n.wickramasekera and l.simon to produce examples of stable branched minimal immersions.

the groups $f \leq t \leq v$ were defined by richard thompson in 1965 and used to construct finitely presented groups with unsolvable word problems. $t$ and $v$ were also the first examples of infinite, finitely presented simple groups. since then, these groups have been studied extensively using a rich interplay of algebraic, topological, and dynamical approaches. i will discuss recent work regarding the higher dimensional analogues of thompson groups, $nv$, including the fact that $mv$ is not isomorphic to $nv$ for $n \neq m$, and that for every $n$ the group $nv$ is finitely presented and simple. the only background required for this talk is basic group theory.

\indent since 2005 a class of algebras, the leavitt path algebras $l_k(e)$ (for $k$ any field and $e$ any directed graph), has been a focus of investigation by both algebraists and $c*-$analysts. in this talk i'll define these algebras, and give some insight regarding the ideas which prompted the initial description of these structures.

\indent i'll briefly describe some results of the expected form, namely, results of the form: $e$ has property $p$ if and only if $l_k(e)$ has property $p'$.

\indent however, the main goal of the talk will be to show how leavitt path algebras have been used to answer various questions outside the subject per se. for example, results about von neumann regular rings; about prime or primitive algebras; about $c*-$algebras; and about lie algebras have been gleaned from these structures.

\indent a discretization scheme for space-time domains and two second order solvers for convection diffusion reaction partial differential equations.

\indent categorical quantum mechanics seeks to distill quantum mechanics to minimal assumptions, based on categories with tensor products. we address the question of how to usefully represent observables in this setting. orthonormal bases in the category of finite-dimensional hilbert spaces turn out to correspond to frobenius algebras. we show that for arbitrary dimensions one needs h*-algebras instead, which can be defined in any monoidal category. finally we compare the notion of h*-algebra to that of nonunital frobenius algebra in various categories

non-uniform circuit lower bounds are among the strongest
impossibility results attainable in complexity theory, but they are
also among the most difficult to prove. the circuit class acc consists
of circuit families with constant depth over unbounded fan-in and, or,
not, and modm gates, where $m > 1$ is an arbitrary constant. despite the
apparent simplicity of such circuits, the power of modm has been very
hard to reason about. for instance, it was not known whether a
complexity class as large as $exp^{np}$ (the class of languages
recognized in $2^{o(n^k)}$ time with an np oracle) could be simulated
with depth-$3$ polynomial size circuits made out of only mod6 gates.

we prove:
- there are functions computable in nondeterministic exponential time
that cannot be simulated with non-uniform acc circuits of polynomial
size. the size lower bound can be slightly strengthened to
quasi-polynomials and other less natural functions.
- there are functions in $exp^{np}$ that cannot be simulated with
non-uniform acc circuits of $2^{n^{o(1)}}$ size. the lower bound gives
an exponential size-depth tradeoff: for every $d$ and $m$ there is a $b > 0$
such that the relevant function doesn't have depth-$d$ acc circuits of
size $2^{n^b}$ with modm gates.

the proofs are more interesting than the results. the high-level
strategy is to design faster algorithms for the circuit satisfiability
problem over acc circuits, then show how such algorithms can be
applied to yield lower bound proofs against acc circuits, via a more
general "algorithm-lower bound" connection. this connection provides a
new direction for further progress in circuit complexity.

given any complex power series in n-variables one can always
ask what is the largest negative power which is integrable. this
number is the log canonical threshold (its reciprocal is called the
arnold multiplicity) of the underlying hypersurface. it is a measure
of the complexity of the singularity at the origin, which carries more
information than the multiplicity.

i describe some recent work with hacon and xu, where we prove some
conjectures of kollár and shokurov, which state that the set of log
canonical thresholds satisfies the ascending chain condition and which
identifies the accumulation points.

given a curve (riemann surface), one can construct an abelian variety: its jacobian. abelian varieties are quotients of vector spaces by lattices. the classical torelli theorem states that the jacobian determines the curve. we discuss some generalizations of this and their history.

\indent given a fixed graph $g$ on $n$ vertices, we can create a random coloring of $g$ in the following way: randomly pick an edge, then randomly pick a color, and then color both endpoints of that edge that color. we can continue this process on a graph that is already colored by simply overwriting any vertices that have already been assigned a color. this gives rise to a random walk on the $2^n$ colorings of $g$, and it is this random walk that we will investigate. the eigenvalues of the transition matrix are known and have a simple form. we discuss these and other quantities as well as several related problems.

\indent we give a survey of what is known about how many symmetries an algebraic variety can possess. we start with some classical results, including those of hurwitz, noether and riemann, to do with the automorphism group of the plane and the automorphism group of curves (or equivalently riemann surfaces), and we end with some more recent results to do with the automorphism group of threefolds of low degree and varieties with finite automorphism group.

perhaps the most studied varieties in algebraic geometry are
the moduli spaces of smooth and stable curves. a stable curve is a
nodal curve whose canonical divisor is ample. adding stable curves
gives a geometrically meaning compactification to the space of smooth
curves.

a motivating problem in higher dimensional geometry is to construct
the moduli space of varieties of general type, in any dimension. just
as with curves, we need to consider non-normal varieties, possibly
with more than one component. unlike the case of curves, if we fix
the degree, it is not at all clear how to bound the number of
components.

motivated by recent work of mok and others on local holomorphic
isometric embeddings, we consider local conformal maps from an irreducible
hermitian symmetric space of compact type into the products of such
manifolds. we allow the conformal factors to be arbitrary real numbers and
derive a necessary and sufficient condition for the global rigidity to
hold. this is a joint work with yuan yuan.

we show that there is a countable structure m such that for any set x, x computes a copy o m if and only if x is not hyperarithmetic. this gives a strong generalisation of the slaman-wehner theorem to the hyperdegrees. on the other hand, the generalization of the slaman-wehner theorem to the degrees of constructibility is false.
this is related to work of kalimullin and his co-authors on structures whose degree spectrum has full measure. we show, for example, that there are only countably many such structures.
we also touch on the possible form of structures m as above. for example, they can be linear orderings, but not have uncountably categorical theories. many open questions remain. among them: can we similarly capture the nonarithmetic degrees?
joint work with antonio montalban and ted slaman.

hermitian symmetric spaces have played a distinguished role in the
history of representation theory and they continue to be a source of
beautiful and often surprising results. in this talk, i will use a natural
generalization of young diagrams for hermitian symmetric spaces to give a
concrete and uniform approach to a wide variety of interconnected topics
including non-compact roots and canonical reduced expressions, abelian
ideals in a borel subalgebra, rational smoothness of schubert varieties in
co-minuscule flag varieties, equivalences of categories of highest weight
modules, bgg resolutions, and syzygies of determinantal ideals.

a $(v,k,\lambda,\mu)$-strongly regular graph (srg for short) is a finite undirected graph without loops or multiple edges such that (i) it has $v$ vertices, (ii) it is regular of degree $k$, (iii) each edge is in $\lambda$ triangles, (iv) any two nonadjacent points are joined by $\mu$ paths of length 2. the connectivity of a graph is the minimum number of vertices one has to remove in order to make it disconnected (or empty).
in 1985, brouwer and mesner used seidel's characterization of strongly regular graphs with eigenvalues at least $-2$ to prove that the vertex-connectivity of any $(v,k,\lambda,\mu)$-srg equals its degree $k$. also, they proved that the only disconnecting sets of size $k$ are the neighborhoods $n(x)$ of a vertex $x$ of the graph.
a natural question is what the minimum number of vertices whose removal will disconnect a $(v,k,\lambda,\mu)$-srg into non-singleton components. in 1996, brouwer conjectured that this number is $2k-\lambda-2$. in this talk, i will report some progress on this problem.
this is joint work with kijung kim and jack koolen (postech, south korea).

the origins of multilinear measure theory (also known as multidimensional measure theory) can be traced back to the work of fr$\mathrm{\acute{e}}$chet in 1915. fr$\mathrm{\acute{e}}$chet characterized
the bounded bilinear functionals on $c[0, 1]$, generalizing the characterization
of bounded linear functionals given by riesz. it was not until much later that
these bounded bilinear functionals came to be identified with set functions called
bimeasures. since that time, multilinear measure theory has developed, and contains
many interesting and deep results. despite the progress, however, several key
measure-theoretic results have eluded satisfactory generalization. in this talk, we
will use results in operator theory to provide a generalization of the radon-nikod$\mathrm{\acute{y}}$m
theorem, and then use it to prove a bounded convergence theorem for bimeasures.

this talk will focus on the beautiful interplay between probability theory and harmonic functions. this connection is provided through the notion of random walks. a gentle introduction to this concept will be given, along with a realization of solutions to a discrete laplace's equation in terms of random walks. time permitting, we will also discuss the continuous analog of these results, along with some related areas of study at the intersection of probability and classical analysis. no knowledge beyond linear algebra will be assumed, and all results will be discussed on a heuristic level, so even the most stochastic-phobic among us is encouraged to attend.

sincerely,
mr. thought \\

please note different location and time than usual.

abstract: the central axis of the famous dna double helix is often
constrained or even circular. the topology of this axis can influence
which proteins interact with the underlying dna. subsequently, in all
cells there are proteins whose primary function is to change the dna
axis topology -- for example converting a torus link into an unknot.
additionally, there are several protein families that change the axis
topology as a by-product of their interaction with dna. this talk will
describe some typical dna conformations, and the families of proteins
that change these conformations. i'll present a few examples
illustrating how 3-manifold topology has been useful in understanding
certain dna-protein interactions, and discuss the most common
techniques used to attack these problems.

the blob complex is a chain complex which can be associated to any pair ($n$-dimensional manifold, $n$-category). it has very nice properties under cutting and pasting manifolds along lower-dimensional pieces (with ``corners" of arbitrary dimension) and so amounts to an $n$-dimensional topological quantum field theory which makes sense ``all the way down to the point".

it is a generalisation and unification of several ideas. well-known tqfts such as turaev-viro theory and chern-simons theory can be recovered from the cases $n=2$ and $n=3$, with appropriate kinds of $2$-category (spherical tensor category) and $3$-category (modular category) respectively.

what is novel is that the construction is a homotopy-invariant or``derived" construction, which allows for much more general input categories, and hence new kinds of tqft. in the simplest case - when $n=1, m$ is the circle, and $c$ is any associative algebra (viewed as a $1$-category with just one object) - it is equivalent to the hochschild chain complex of $c$, which can be thought of as the ``derived cocentre" of $c$ (this example is very closely related to costello's work on topological conformal field theories.) it seems very likely that the blob complex formulation is general enough to allow $4$-dimensional gauge theories, with their exact triangles and other homological baggage, to fall into place as tqfts which can be encoded using algebra and combinatorics.

a large part of the idea consists of giving a suitable definition of n-category. the approach here is very natural in this geometric context, and seems to be relatively easy to understand in comparison with the other current approach (via multisimplicial sets) by lurie, whose ``topological chiral homology" is presumably just a different way of saying the same thing.

\indent many data-related applications utilize principal component analysis and/or data dimension reduction techniques that require efficiently computing dominant part of singular value decompositions (svd) of very large matrices which are also very dense. in our talk, we introduce a limited memory block krylov subspace optimization method which remarkablely accelerate the traditional simultaneous iteration scheme. we present extensive numerical results comparing the algorithm with some state-of-the-art svd solvers. our tests indicate that the proposed method can provide better performance over a range of dense problem classes under the matlab environment. we also present some convergence properties of our algorithm.

\indent central to many factoring algorithms in use today is the following random process: generate random numbers in the interval [1,n] until some subset has a product which is a square. naive probabilistic models for the distribution of prime factors suggest that this stopping time has a sharp threshold. based on more sophisticated probabilistic models, we find a rigorous upper bound that is within a factor of 4/pi of a proven lower bound, and conjecture that our upper bound is in fact asymptotically sharp. this is joint work with andrew granville, ernie croot and prasad tetali.

\indent this is an expository talk. i will discuss the recent paper
of tian and zhu on the convergence of the kahler-ricci flow on fano manifolds.

\indent many questions in extremal graph theory can be phrased like
this: what is the maximum of a certain linear combination of densities
of given graphs in an arbitrary graph? using the theory of graph limit
objects (called graphons), it is now possible to pose and in some
cases answer some rather general questions about extremal graphs.

- which linear inequalities between subgraph densities are valid?
hatami and norine very recently proved that this question is
undecidable. on the other hand, it follows from results of lovasz and
szegedy that if we allow an arbitrarily small ``slack'', then it
becomes decidable.

- can all valid inequalities between subgraph densities be proved
using just cauchy-schwarz? using the notions of graphons and graph
algebras one can give an exact formulation of this question, which
turns out to be analogous to hilbert's 17th problem about
representing nonnegative polynomials as sums of squares. hatami and
norine showed that the answer is negative, but lovasz and szegedy
proved that it becomes positive if we allow an arbitrarily small
error.

- is there always an extremal graph? one can prove that there is
always an extremal graphon, which then gives a ``template'' for
asymptotically extremal graphs.

- which graphs are extremal? in other words, what are the possible
"templates" of extremal graphs? there are nontrivial conditions and
quite
interesting families, but a complete charaterization remains an
exciting but difficult open problem.

classical statistical approaches for multiclass probability estimation are typically based on regression techniques such as multiple logistic
regression, or density estimation approaches such as linear discriminant analysis (lda) and quadratic discriminant analysis (qda). these
methods often make certain assumptions on the form of probability functions or on the underlying distributions of subclasses. in this article, we develop a model-free procedure to estimate multiclass probabilities based on large-margin classifiers. in particular, the new estimation
scheme is employed by solving a series of weighted large-margin classifiers and then systematically extracting the probability information
from these multiple classification rules. a main advantage of the proposed probability estimation technique is that it does not impose any
strong parametric assumption on the underlying distribution and can be applied for a wide range of large-margin classification methods.
a general computational algorithm is developed for class probability estimation. furthermore, we establish asymptotic consistency of the
probability estimates. both simulated and real data examples are presented to illustrate competitive performance of the new approach and
compare it with several other existing methods.

this is a joint work with hao helen zhang and yufeng liu.

we survey several commonly-used quasi-newton methods
and line-search algorithms for unconstrained and box-constrained optimization and consider
their underlying strategies. by taking advantage of an implicit similarity in two existing algorithms, we develop a method for box-constrained optimization that includes a new way to compute a search direction and a new line-search
algorithm. on a collection of standardized problems, this method is over $35\%$ faster than the leading comparable alternative.

i will discuss a "non-contraction" result for the holonomy
group of a solution to ricci flow, namely, that if the reduced
holonomy of a complete solution of uniformly bounded curvature is
restricted to a subgroup of so(n) at some non-initial time, it must be
restricted to the same subgroup at all previous times; it follows then
from existing results that the holonomy group is exactly preserved by
the equation. in particular, a solution may be kahler or locally
reducible (as a product) on some time slice only if it is identically
so on its entire interval of existence. in contrast to the question of
"non-expansion" of holonomy, the problem of non-contraction cannot be
reduced completely to an application of the classification and
splitting theorems of berger and de rham and a series of appeals to a
relevant uniqueness theorem (here, backwards-uniqueness). however,
with an infinitesimal reformulation, we show that the problem can
nevertheless be reduced to one of unique continuation, and
specifically to one for a coupled system of partial- and
ordinary-differential inequalities of a form amenable to an approach
by carleman inequalities. this reformulation also leads to an
alternative and essentially self-contained proof of the non-expansion
of holonomy via the analysis of a similar (albeit simpler and strictly
parabolic) system by means of the maximum principle.

\indent we will consider two systems of interacting diffusion processes, which go by the names rank-based and volatility-stabilized models in the mathematical finance literature. we will show that, if one lets the number of diffusion processes tend to infinity, the limiting dynamics of the system is described by the porous medium equation with convection in the rank-based case and by a degenerate linear parabolic equation in the volatility-stabilized case. in the first case we also provide the corresponding large deviations principle. the results can be applied in stochastic portfolio theory and for the numerical solution of partial differential equations. a part of the talk is joint work with amir dembo and ofer zeitouni.

gradient ricci solitons are those riemannian manifolds whose
ricci tensor is equal to a constant multiple of the metric plus the
hessian of a function. i will discuss some aspects of the literature
on complete gradient ricci solitons assuming that the hessian of the function is not identically zero.

\indent the central curve of a linear program is an algebraic curve specified by linear and quadratic constraints arising from complementary slackness. it is the union of the various central paths for minimizing or maximizing the cost function over any region in the associated hyperplane arrangement. in this lecture we present joint work with daniel plaumann and cynthia vinzant on the geometry of central curves. we determine the degree, arithmetic genus and defining prime ideal of the central curve, thereby answering a question of bayer and lagarias. these invariants, along with the degree of the gauss image of the curve, are expressed in terms of the matroid of the input matrix. extending work of dedieu, malajovich and shub, this yields an instance-specific bound on the total curvature of the central path, a quantity relevant for interior point methods.

\indent we study acts and modules of maximal growth over finitely generated free monoids and free associative algebras as well as free groups and free group algebras. the maximality of the growth implies some other specific properties of these acts and modules that makes them close to the free ones; at the same time, we show that being a strong infiniteness condition, the maximality of the growth can still be combined with various finiteness conditions, which would normally make finitely generated acts finite and finitely generated modules finite-dimensional.

the numerical solution of nonlinear elliptic equations is important in many applications; however, it is a challenging task to develop efficient software to solve general problems. this talk will describe the basic finite element method and develop an adaptive framework based on the solve-estimate-mark-refine iteration. a theory of convergence for this iteration, which allows the solver to be inexact, will be given as well as a new error estimator. numerical results will be shown for a model problem arising in computational biochemistry.

\indent this is part two of an expository talk on the recent paper
of tian and zhu on the kahler-ricci flow on fano manifolds.

management policies for influenza outbreaks balance the expected
morbidity and mortality costs versus the cost of intervention policies. we
present a methodology for dynamic determination of optimal policies in a
stochastic compartmental model with parameter uncertainty. our formulation
is based on bayesian conjugate updating in conjunction with stochastic
control methods for optimal stopping. facing a high-dimensional control
problem, we construct a new monte-carlo computational approach that
searches the full set of sequential control strategies. as a running
example, we study a stochastic sir-model with isolation and vaccination as
two possible interventions. we also investigate the value of information
and effect of various cost structures. numerical simulations demonstrate
the realized cost savings of choosing interventions based on the computed
dynamic policy over simpler decision rules.

\indent discrete problems have a habit of being beautiful but difficult. in this talk we'll survey a menagerie of discrete analogues of classical operators arising in harmonic analysis, including singular integral operators, maximal functions, fractional integral operators, and radon transforms. in general, discrete radon transforms are the most difficult to treat, and we'll outline some of the methods that are breaking new ground in this direction. key aspects of the methods presented come from number theory, and we will highlight the roles played by theta functions, exponential sums, waring's problem, and the circle method of hardy and littlewood.

\indent we will review permutation sequences and allowable
permutation sequences and the theorem that every allowable permutation sequence can be realized by an arrangement of pseudolines.

\indent we introduce double permutation sequences which provide a combinatorial encoding of arrangements of convex sets in the plane. we shall also review the notion of a topological affine plane and several of its properties. in particular, we show that for every allowable double permutation sequence, there is a corresponding universal topological affine plane p, i.e. any finite arrangement of pseudolines is isomorphic to some arrangement of finitely many lines of p, and that every allowable double permutation sequence can be realized by an arrangement
of simply connected sets and pseudoline double tangenets to every pair of these sets. we conclude with some recent results using these methods.

\indent all of this is joint work with jacob e. goodman and some involves numerous other people including raghavan dhandapani, adreas holsmen, shakhar smorodinsky, raphael wenger, and tudor zamfirescu.

\indent it is an expository talk of the recent work of wu and zheng. their work develop a systematic way to construct complete $u(n)$ invariant kahler metrics of positive curvature on $c^{n}$. studying the geometry of those metrics should be interesting. i will mention a simple application if time permits.

\indent gradient ricci solitons are those riemannian manifolds whose ricci tensor is equal to a constant multiple of the metric plus the hessian of a function. i will discuss some aspects of the literature on complete gradient ricci solitons assuming that the hessian of the function is not identically zero.

\indent the allen-cahn equation is a popular pde model for phase transition and phase separation. the level sets of solutions represent interfaces between two materials. a fine analysis of interfaces relies on solutions of allen-cahn equation in the entire spaces. in this talk, i will give a brief survey on results for local minimizers of the related allen-cahn energy functional, in particular in connection with the de giorgi conjecture which relates the level set of monotone solutions to minimal surfaces. i will further discuss a classification scheme for finite morse index solutions of allen-cahn equation in the whole plane. the level sets of such solutions may represent intersecting interfaces, and the energy of such solutions displays a quantization effect. in particular, i will show that saddle solutions must have even symmetry.

we discuss a natural form of ricci-flow conjugation between
two distinct general relativistic data sets given on a compact
$n$-dimensional manifold. the ricci flow generates a form of $l^2$
parabolic averaging, of one data set with respect to the other, with a
number of desiderable properties: (i) preservation of the dominant
energy condition; (ii) localization by a heat kernel, (associated with
the linearized ricci flow), whose support sets the scale of averaging;
(iii) entropic stability.

the partial fraction algorithm of guoce xin
has recently led to a breakthrough in the theory
of tesler matrices. in particular we now have a beautiful
formula for the polynomials enumerating the families
of tesler matrices with positive hook weights. the xin
algorithm also yields a very illuminating new proof of
the original tesler matrix formula for the
hilbert series of diagonal harmonics due to jim haglund. we will try
to give a glimpse of these developments in a
self contained manner.

this is an expository talk. i will give an introduction to
the weak kahler-ricci flow.

\indent the group of diffeomorphisms of the circle arises naturally
in many places in mathematical physics. in this talk, i will first
discuss various topologies of the group and its lie algebra. then i
will talk about the construction of a brownian motion in this group
using a very strong metric.

\small
recent experimental studies reveal that significant additional improvement in the power conversion efficiency of organic photovoltaic devices is possible through better morphology control of the organic thin film layer during the manufacturing process. a set of computational tools that can (a) predict the evolving three dimensional morphology within the active layer during the fabrication process; and (b) relate the structure with device properties would significantly augment current experimental efforts and strengthen the pursuit of this vision of high power conversion efficiency devices.

in this talk, i will discuss recently developed multiscale computational strategies that link fabrication process, nanostructure and property of thin films. the topics covered in this talk are:

1) a computational framework that effectively acts like a virtual "stereological microscope" to visualize morphology evolution from early stages of phase separation until the formation of the stable morphology. this multiscale framework is based on a continuum description of evaporation-induced phase-separation in ternary systems and is able to resolve nano-morphological features while being able to simulate device scale domains.

2) a suite of morphology descriptors that encode the various physical processes that affect the total power conversion efficiency of a photovoltaic cell.

3) a virtual performance characterization framework that efficiently "interrogates" the morphology to investigate relationships between the morphology at the nano-scale with the device performance.

baskar ganapathysubramanian is the william march assistant professor of mechanical engineering and electrical and computer engineering at iowa state university. his research interests are in stochastic analysis, multiscale modeling, and design of materials and processes using computational techniques. ganapathysubramanian completed his phd and ms from cornell university and holds a bs degree from the indian institute of technology-madras.

high-dimensional numerical simulation problems arise in diverse contexts, including in population balance models, an application that motivates our numerical algorithm design. to enable discretization in tens of dimensions, we focus on particle (meshless) methods with markov jump process dynamics. while numerical methods for such systems have been known since the mid-1970s, efficient techniques that enable large-scale simulation are much more recent.

in this talk we present advances in three key aspects. first, we show how multiscale rate functions can be efficiently simulated by applying importance-sampling ideas to tau-leaping time-discretizations. this is particularly relevant for systems with a continuum of scales from slow to fast, without clear scale separations that would enable homogenization.

the second development we discuss is variable resolution in the sample-space, where non-uniform particle samplings can be used to achieve variance reduction for particular observables of the process. we show how such non-uniform or variable sampling can be driven by local error estimators, allowing adaptive resolution for the system state discretization.

finally, we present a new parallelization technique for markov jump processes, based on particle diffusion across well-chosen network paths between processor nodes. while the markov process naively involves dense communication, we show how sparse communication can give accurate approximations with near-linear scaling.

\indent the goal of this work is to describe principles for optimal encoding of multidimensional stimuli using neural populations. i will describe an analytic framework for finding maximally informative boundaries that separate stimuli according to combinations of neural responses. we find that for gaussian signals optimal decision boundaries are planar, regardless of neural noise level. for non-gaussian (or sparse) signals that are typical of our sensory environment, optimal decision boundaries are curved, and their shape depends both on the number of neurons in the network and on noise in individual neurons. finally, i will describe geometric properties of these decision boundaries that can be used as indicators of whether the network will be well described using pair-wise ising model, and if so, what are the values of the pairwise interactions.

\indent the space of positive definite symmetric matrices has been studied extensively as a means of understanding dependence in multivariate data along with the accompanying problems in statistical inference. many books and papers have been written on this subject, and more recently there has been considerable interest in high- dimensional random matrices with particular emphasis on the distribution of certain eigenvalues. our present paper is motivated by modern data acquisition technology, particularly, by the availability of diffusion tensor-magnetic resonance data. with the availability of such data acquisition capabilities, smoothing or nonparametric techniques are required that go beyond those applicable only to data arising in euclidean spaces. accordingly, we present a fourier method of minimax wishart mixture density estimation on the space of positive definite symmetric matrices.

\indent in the last 25 years, elliptic curve cryptography has become a mainstream primitive for cryptographic protocols and applications. this talk will give a survey of elliptic curve cryptography and its applications, including applications of pairing-based cryptography which are built with elliptic curves. one of the information-theoretic applications i will cover is a solution to prevent pollution attacks in content distribution networks such as bittorrent which use network coding to achieve optimal throughput. another application i will cover is to privacy of electronic medical records and billings systems.

\indent a generalized complex structure (as introduced by hitchin) consists of a complex structure on the direct sum of the tangent and cotangent bundles of a manifold, satisfying a certain integrability condition. a complex manifold can be regarded as a generalized complex manifold in a canonical way. this leads to an enlarged space of deformations: in addition to deformations as a complex manifold, there are also non-commutative and gerby deformations.

\indent symplectic manifolds can also be regarded as generalized complex manifolds. for k3 surfaces, a complex structure can be deformed via generalized complex structures to a symplectic structure. it appears that these deformations connect pairs of fourier-mukai equivalent k3s to pairs of mirror k3s.

\indent this talk will be an introduction to generalized complex geometry, leading to a description of the above phenomena.

\indent models and estimators for covariance matrices are very well studied. for non-gaussian distributions, simply studying covariance gives an incomplete picture. extending the edgeworth series gives the pxpxp skewness tensor, the pxpxpxp kurtosis tensor, and so on. we describe a strategy for building multilinear factor models of cumulant tensors using subspace varieties. this leads to a difficult optimization problem and a fully implicit, gradient-based numerical optimization method using parallel transport on the grassmannian to perform estimation. we also discuss some of the associated statistical challenges and applications.

\indent pfaffian circuits are a new, geometrically motivated, and simplified construction of valiant's holographic algorithms. these algorithms exploit dual spinor varieties to simulate certain quantum computations (fermionic linear optics) classically, and provide a means to probe the conjectured classical-quantum boundary. combinatorial problems addressed include planar nae-sat, lattice path problems and evaluation of certain tutte polynomials. basis change is one route to superposition-like effects, and some of the geometric considerations in analyzing pfaffian circuits under arbitrary basis change will be discussed. connections are made to the sum-product algorithm, slocc
equivalent entangled states, and monoidal categories.

consider a population of fixed size that
evolves over time. at each time, the genealogical
structure of the population can be described by a
coalescent tree whose branches are traced back to
the most recent common ancestor of the population.
this gives rise to a tree-valued stochastic process.
we will study this process in the case of populations
whose genealogy is given by the bolthausen-sznitman
coalescent. we will focus on the evolution of the
time back to the most recent common ancestor and the
total length of branches in the tree.

let f be a holomorphic selfmap of a complex manifold x. a point z in x
is said to lie in the fatou set if the family of iterates is a normal
family in a neighborhood of z. a connected component of the fatou set
is called a fatou component. as all the orbits of a fatou component
behave similarly, understanding fatou components is an important step
in understanding complex dynamical systems. for rational functions in
the riemann sphere fatou components are quite well understood: every
fatou component is preperiodic and periodic fatou components have been
completely classified. neither is true in higher dimensions, although
there has been some progress towards the description of periodic fatou
components.

i will review what is known in the literature and present some recent
results. the talk will be geared towards complex analysts, not
dynamicists. this is joint work with mikhael lyubich.

\indent variational integrators form a general class of structure preserving numerical algorithms for simulating dynamics. in this talk, we will present a new variational integrator, which combines techniques from spectral methods with the galerkin variational integrator framework. it will be shown that, under certain conditions, variational integrators constructed in this way inherit both the excellent convergence properties of classical spectral methods as well as structure preservation.

\indent in this talk, i will present two deblurring methods, one exploits the spatial interactions in images, i.e. the self-similarity; and the other explicitly takes into account the sparse characteristics of natural images and does not entail solving a numerically ill-conditioned backward-diffusion.

\indent in particular, the self-similarity is defined by a weight function, which induces two types of regularization in a nonlocal fashion. furthermore, we get superior results using preprocessed data as input for the weighted functionals.

\indent the second part of the talk is based on the observation that the sparse coefficients that encode a given image with respect to an over-complete basis are the same that encode a blurred version of the image with respect to a modified basis. following an ``analysis-by-synthesis'' approach, an explicit generative model is used to compute a sparse representation of the blurred image, and the coefficients of which are used to combine elements of the original basis to yield a restored image.

data obtained describing terrorist events are particularly difficult to analyze, due to the many problems
associated with the both the data collection process, the inherent variability in the data itself, and the
usually poor level of measurement coming from observing political actors that seek not to provide
reliable data on their activities. thus, there is a need for sophisticated modeling to obtain reasonable
inferences from these data. here we develop a logistic random effects specification using a dirichlet process to
model the random effects. we first look at how such a model can best be implemented, and then we use the
model to analyze terrorism data. we see that the richer dirichlet process random effects model, as compared
to a normal random effects model, is able to remove more of the underlying variability from the data,
uncovering latent information that would not otherwise have been revealed.

\indent in this talk i will be discussing an extension of the analytic tools so that they work for problems on subdomains that might not even be lipschitz and characterize the rates of convergence of domain decomposition methods.

\indent the lattice of non-crossing partitions of $[n]$, $nc(n)$, is a highly-studied, highly-symmetric playground for both algebraic and enumerative combinatorics. first seriously studied by kreweras (1972), it has more recently come to light in two very different contexts: as the combinatorial underpinnings of the new, fruitful field of free probability, and having new unexpected connections to coxeter groups and hyperplane arrangements (both discoveries made in the last 15 years).

\indent in this lecture, we will discuss non-crossing pair partitions of $[2n]$, $nc_2(2n)$. this set is in natural bijection with $nc(n)$. consider the subset of those pair partitions that only pair $1$s to $0$s in some random bit-string of length $2n$. the enumerative properties of such classes of pairings are extremely important to some hard problems in free probability theory and random matrix theory. we will discuss what is known about this enumeration (including a "tight" theorem on symmetry and maximization), as well as some surprising and suggestive algebraic properties of posets associated to these pairings.

\indent this is joint work with mahrlburg, rattan, and smyth, as well as chou, fricano, poh, shore, whieldon, wong, and zhang.

\indent gradient ricci solitons are those riemannian manifolds whose ricci tensor is equal to a constant multiple of the metric plus the hessian of a function. i will discuss some aspects of the literature on complete gradient ricci solitons assuming that the hessian of the function is not identically zero.

\indent we discuss a portion of the paper by song and yuan titled
"metric flips with calabi ansatz." in particular, they give an example of where the kahler-ricci flow performs a flip as an analytic analogue to mori's minimal model program.

\indent one of the greatest accomplishments of the theory of general
relativity in the past century is the proof
of the positive mass/energy theorem for asymptotically flat spacetime.
this provides the theoretical
foundation for the stability of an isolated gravitating system.
however, the concept of mass/energy remains a challenging
problem because of the lack of a quasilocal description. most
observable physical models are finitely extended spatial
regions and measurement of mass/energy on such a region is essential
in many fundamental issues. in fact, among penrose's
list of major unsolved problems in classical general relativity, the
first one is ``find a suitable quasi-local
definition of energy-momentum in general relativity". in this talk,
i shall describe a
new proposal of quasi-local mass/energy by shing-tung yau of harvard
university and myself.

\indent recent advances in mixed-integer nonlinear optimization and the solution of optimization problems with differential equation constraints have heightened interest in methods that may be warm started from a good estimate of a solution. in this context, we present a regularized sequential quadratic programming (sqp) method based on a primal-dual augmented lagrangian function. trial steps are computed from carefully chosen subproblems that utilize relationships between traditional sqp, stabilized sqp, and the augmented lagrangian. each subproblem is well defined regardless of the rank of the jacobian, and (to some extent) we challenge the belief that large penalty parameters should be avoided.

this is an expository talk on the behavior of the
kahler-ricci flow on a smooth minimal model of general type. i will
show that the flow converges to a singular kahler-einstein metric.

recent years have seen the initial success of the variational implicit-solvent modeling of biomolecules. the dielectric boundary or the solute-solvent interface is the key quantity in such modeling. this work concerns the effective dielectric boundary force that contributes significantly to the conformation and dynamics of an underlying biomolecular system. such a force is the "normal velocity" in the level-set numerical computation of equilibrium biomolecular structures. precisely, the dielectric boundary force is defined as the shape derivative of the electrostatic free energy. both the poisson-boltzmann free energy, and its coulomb-field and yukawa-field approximations are considered. analytical formulas of the corresponding dielectric boundary force are derived. this is joint work with hsiao-bing cheng, li-tien cheng, and xiaoliang cheng, and zhengfang zhang.

talk begins at 11:15 am.

for many reasons, there exists an ongoing, healthy tension and competition (usually friendly!) between research communities that develop partial-differential equation (pde) and boundary-integral equation (bie) models and implementations. in this talk, i will describe two of my recent research efforts employing bie to model the electrostatic component of biomolecule solvation, emphasizing the connections between pde and bie approaches in the hopes of encouraging deeper and more substantive communication and collaboration towards our shared goals: understanding experiments and the underlying mathematics. the first project addresses an electrostatic model i call bibee (boundary-integral based electrostatics estimation), which relies on a rigorous operator approximation of the boundary-integral formulation for the common mixed-dielectric poisson pde. bibee represents the bie formulation of an earlier approximation by the borgis group, and here bie offers novel insights such as the fact that the approximation gives a provable upper bound to the true answer. in the second project, we explore the implications of nonlocal dielectric response by the solvent. this more sophisticated solvation model and its bie formulation are relatively recent, and a combination of pde and bie approaches will undoubtedly offer a much more efficient route to identify and understand the limitations and strengths of this class of solvation models, as well as its connections to other theories of solvation.

it is very well known that every graph on $n$ vertices
and $m$ edges admits a bipartition of size at least $m/2$.
this bound can be improved to
$m/2 + (n-1)/4$ for connected graphs, and $m/2 + n/6$
for graphs without isolated vertices,
as proved by edwards, and erd\h{o}s, gy\'arf\'as, and
kohayakawa, respectively. a bisection
of a graph is a bipartition in which the size of the two parts
differ by at most 1. we prove
that graphs with maximum degree $o(n)$ in fact contain
a bisection which asymptotically achieves the above bounds.
these results follow from a more general theorem,
which can also be used to answer several questions
and conjectures of bollob\'as and scott on
judicious bisections of graphs.

joint work with po-shen loh and benny sudakov

internet-scale quantum repeater networks will be heterogeneous
in physical technology, node functionality, and management. the
classical control necessary to use the network will therefore face
similar issues as internet data transmission. in this talk, i will
describe the basic ideas behind quantum repeater networks, some of
their uses, the open problems that must be addressed, and our current
research on the quantum recursive network architecture, or qrna.
as an example of the collision of quantum and classical engineering, i
will present our analysis of multiplexing schemes for repeater
networks, and show that internet-style statistical multiplexing
improves aggregate throughput of the network, is robust and fair, and
can be easily implemented.

bio: rodney van meter received a b.s. in engineering and applied
science from the california institute of technology in 1986, an m.s. in
computer engineering from the university of southern california in
1991, and a ph.d. in computer science from keio university in 2006.
his main research is architectures for distributed quantum
computation. additional interests include storage systems,
networking, and post-moore's law computer architecture. he has held
positions in both industry and academia in the u.s. and japan. he is
now an associate professor of environment and information studies at
keio university's shonan fujisawa campus. dr. van meter is a member
of aaas, acm and ieee.

when segre proved his celebrated characterization of conics (``every set of $q+1$ points in $pg(2,q)$, $q$ odd, no three
of which are collinear, is a conic''), he did more than proving a beautiful and interesting theorem; he in fact provided the starting point of a new direction in combinatorial geometry. in this branch of combinatorics the idea is to provide purely combinatorial characterizations of objects classically defined in an algebraic way.\\

in this talk we consider the following question:

\begin{quote}
is it possible to characterize finite classical polar spaces by their intersection numbers with
respect to hyperplanes and subspaces of codimension $2$?
\end{quote}

{\bf remark: i do not assume knowledge of finite geometry.}

\emph{cops and robbers} is a vertex pursuit game played on graphs which has
gained considerable recent attention. an intruder (or \emph{robber})\ is
loose on a network and some number of agents (or \emph{cops}) are trying to
capture him. the players are restricted to vertices, and move to
neighboring vertices along edges at alternate ticks of the clock. the
minimum number of cops needed to capture the robber is called the \emph{cop
number}. the most famous open problem on the cop number is \emph{meyniel's
conjecture}, which claims that for a connected graph $g$ of order $n,$ $
c(g)=o(\sqrt{n}).$ we consider this and other conjectures and problems related to graphs with large cop number, algorithms for computing the
cop number, and the cop number of planar graphs.

we use a branching markov process on the space of finite configurations
to solve a dirichlet problem associated with the operator $\delta u + u^2$.
we follow the pioneering works of m. nagasawa, n. ikeda, s. watanabe,
m.l. silverstein, and the approach of e.b. dynkin.

in this talk, we will discuss a family of graphs related to
the high girth graphs d(k,q). the graphs d(k,q) were originally
constructed by utilizing a bilinear product based on the root system of an affine lie algebra.? we give a modification of this
construction which applies to generalized kac-moody algebras of rank 2. using these constructions we obtain a new lower bound on the maximum number of edges in graphs without 14-cycles.? this is joint work with art terlep.

\indent the continuum self-consistent field theory is applied to the study of the adsorption of flexible polyelectrolyte (pe) onto the surfaces of two two-dimensional charged square objects with a constant electric field strength immersed in a weakly charged polyelectrolyte solution. the dependences of the different chain conformations, i.e., bridging, loop, tail and train, and in particular, the bridging chain conformation, on various system parameters (the charge fraction of the pe chains, the surface charge density, the object size, the salt concentration, etc.) are investigated. the efficient multigrid method is adopted to numerically solve the modified diffusion equation and the poisson equation. it is found that, the thickness l{\scriptsize b} of the boundary layer of the adsorbed pe chains is independent of the chain length, and scales with the surface charge density $\sigma$ and the fraction of charges on pe chains $\alpha_{p}$ as l{\scriptsize b}$\sim\sigma ^{0.36}$ and l{\scriptsize b}$\sim\alpha _{p}^{0.36}$, respectively. simulation results reveal that, the total amount of bridging chain conformation in the system scales linearly with respect the size of the charge objects, and scales linearly with the chain length in the long polymer chain regime. simulation results reveal that, the total amount of the bridging chain conformation in the system scales with the charge fraction of pe chains as a power law, and the scaling exponent is dependent on all the other system parameters. simulation results show that, the total amount of charges on the adsorbed chains in the system can over-compensate the surface charges for relatively long chains with high charge fractions.

\indent i will talk about a proof of lubotzky's conjecture on the quantitative version of wang's theorem. roughly the conjecture says that the asymptotic growth of the number of lattices in g a simple lie group with covolume at most x, up to an automorphism of g, is the same as the subgroup growth of any lattice in g.

\indent i will discuss the behavior of the kahler-ricci flow on
projective bundles. we show that if the initial metric is in a
suitable kahler class, the fibers collapse in finite time and the
metrics converge subsequentially in the gromov-hausdorff sense to a metric on the base. this is a joint work with j. song and g.
szekelyhidi.

\indent multicomponent vesicle adhesion and fusion play important roles in many biological processes such as exocytosis, endocytosis. many experimental and theoretical studies have focus on this subject. in this talk, we will first briefly review the biological background of the lipid bilayer vesicle membranes and the existing works on modeling the vesicle membranes, mainly the sharp interface model and the diffuse interface model. we will then consider the adhesion of multicomponent vesicle membranes. by using geometric description (sharp interface model) to represent the vesicle surface, and a phase field labeling function to distinguish the different components on the vesicle, the total energy, governing the equilibrium shapes of the vesicle, is set up. by solving the euler-lagrange equations, we present a number of typical adhered axisymmetric two-component vesicle profiles. a numerical experiment is conducted to show that adhesion may promote phase separation for a multicomponent vesicle. thirdly, vesicle-vesicle adhesion and fusion process are discussed. by incorporating the adhesion effect, we mainly focus on the prefusion and postfusion states in the fusion process. numerical experiments reveal that there can be many interesting equilibrium configurations of the prefusion and postfusion states. by carrying our simulations based on the gradient flow of the associated energy functional, we are also able to elucidate the dynamic transitions between the prefusion and postfusion states.

\indent more than 40 years ago, erdos asked to determine the maximum possible number of edges in a $k$-uniform hypergraph on $n$ vertices with no matching of size $t$ (i.e., with no $t$ disjoint edges). although this is one of the most basic problem on hypergraphs, progress on erdos' question remained elusive. in addition to being important in its own right, this problem has several interesting applications. in this talk we present a solution of erdos' question for $t < \dfrac{n}{(3k^2)}$. this improves upon the best previously known range $t = o \dfrac{n}{k^3}$, which dates back to the 1970's.

joint work with p. loh and b. sudakov.

\indent i will explain how $p$-adic methods (the so-called $p$-adic local langlands correspondence) can be used to prove the existence of an analytic continuation for complex $l$-functions.

\indent in $p$-adic hodge theory, comparison morphisms relate $p$-adic etale cohomology of varieties over local fields of mixed characteristic $(0,p)$ with their de rham cohomology. i will present a construction of such a morphism that uses chern classes from motivic cohomology into etale and de rham cohomology.

\indent let $k$ be of a field of characteristic $0$. the first weyl algebra $a_1(k) = k/(yx-xy-1)$ is $z$-graded with deg$(x) = 1$, deg$(y) = -1$, and is a simple ring of $gk$-dimension $2$. sierra has studied its category of graded modules and shown how to find all $z$-graded algebras with an equivalent graded module category. smith has also shown how the geometry of this example is related to a certain stack. our goal is to study more general classes of $z$-graded simple rings to find more examples which may have interesting algebraic and geometric properties. specifically, we study the structure of $z$-graded simple rings $a$ with graded quotient ring $q$ such that $q_0$ is a field with trdeg $q_0 = gk a - 1$. as a special case, we can classify all $z$-graded simple rings of $gk$-dimension $2$. this is joint work with jason bell.

\indent generalized barycentric coordinate functions allow for novel, flexible finite element methods accommodating polygonal element geometries. the sobolev-norm error estimates associated to such methods, however, require varying levels of geometric criteria on the polygons, depending on the definition of the coordinate functions. in this talk, i will discuss these criteria for a variety of coordinate definitions and discuss the practical tradeoffs between enforcing geometric constraints and computing finite element basis functions over polygons.

\indent in a recent paper, rains and vazirani used hecke algebra techniques to develop $(q,t)$-generalizations of a number of well-known vanishing identities for schur functions. however, their approach does not work directly at $q=0$ (the hall-littlewood level). we discuss a technique that is more combinatorial in nature, and allows us to obtain generalizations of some of their results at $q=0$ as well as a finite-dimensional analog of a recent summation formula of warnaar. we will also briefly explain how
these results are related to $p$-adic representation theory. finally, we will explain how this method can be extended to give an explicit construction of hall-littlewood polynomials of type $bc$.

\indent i will discuss results in analysis on a compact lie group that can be obtained using brownian motion. these include a ``hermite expansion" and an analog of the segal-bargmann transform. both results can be understood by lifting brownian motion in the group to brownian motion in the lie algebra. i will also briefly discuss an open problem concerning the infinite-dimensional limit of these results.

\indent we present the context and theorems for noncommutative maps, or dimension free maps evaluated on tuples of matrices. this turns out to be much more rigid than functions from the classical commutative case of several complex variables or several real variables. we present some theorems of helton et al on free analytic maps in the context of change of variables.

\indent ionic size effects are significant in many biological systems. mean-field descriptions of such effects can be efficient but also challenging. when ionic sizes are different, explicit formulas in such descriptions are not available for the dependence of the ionic concentrations on the electrostatic potential, i.e., there are no explicit, boltzmann type distributions. this work begins with variational formulations of the continuum electrostatics of an ionic solution with such non-uniform ionic sizes as well as multiple ionic valences. an augmented lagrange multiplier method is then developed and implemented to numerically solve the underlying constrained optimization problem. extensive numerical tests demonstrate that the mean-field model and numerical method capture qualitatively some significant ionic size effects, particularly those for multivalent ionic solutions, such as the stratification of multivalent counterions near a charged surface. the ionic valence-to-volume ratio is found to be the key physical parameter in the stratification of concentrations. all these are not well described by the classical poisson--boltzmann theory, or the generalized poisson--boltzmann theory that treats uniform ionic sizes. finally, various issues such as the close packing, limitation of the continuum model, and generalization to molecular solvation are discussed. this is joint work with zhongming wang and bo li.

\indent a rigorous convergence theory for galerkin methods for a model helmholtz problem in $r^{d}, d=1,2,3,$ is presented.
general conditions on the approximation properties of the approximation space are stated that ensure quasi-optimality of the method. as an application of the general theory, a full error analysis of the classical hp-version of the finite element method (hp-fem) is presented where the dependence on the mesh width $h$, the approximation order $p$, and the wave number $k$ is given explicitly. in particular, it is shown that quasi-optimality is obtained under the conditions that $kh/p$ is sufficiently small and the polynomial degree $p$ is at least $o(log k)$. this result improves existing stability conditions substantially.

\indent we will consider two recent open problems stating that
certain statistics on various sets of combinatorial objects are
equidistributed. the first, posed by anders claesson and svante
linusson, relates nestings in matchings of $2n$ points on a line to
occurrences of a certain pattern in permutations in $s_n$. the second, posed by miles jones and jeffrey remmel, relates occurrences of a large class of consecutive permutation patterns to occurrences of the same pattern in the cycles of permutations. we will prove an extension of the garsia-milne involution principle and use it to solve both problems.

\indent if a variety $x$ is a quotient of a smooth variety by a finite group, it has quotient singularities---that is, it is \emph{locally} a quotient by a finite group. in this talk, we will see that the converse is true if $x$ is quasi-projective and is known to be a quotient by a torus. in particular, all quasi-projective simplicial toric varieties are global quotients by finite groups! though the proof is stack-theoretic, the construction of a smooth variety $u$ and finite group $g$ so that $x=u/g$ can usually be made explicit purely scheme-theoretically.

\indent to illustrate the construction, i'll produce a smooth variety $u$ with an action of $g=\mathbb{z}/2$ so that $u/g$ is the blow-up of $\mathbb{p}(1,1,2)$ at a smooth point. this example is interesting because even though $u/g$ is toric, $u$ cannot be taken to be toric. this is joint work with matthew satriano.

\indent an $r$-graph is like a graph except that every edge contains $r$ vertices instead of two. we'll talk about how to find a large independent set in an $r$-graph, which means a set of vertices not containing any edge. conversely, we'll also discuss how to generate a hypergraph where large independent sets do not exist. some of research is joint with jacques verstraete.

\indent i will begin by giving a broad overview of the geometric langlands progam, with emphasis on the local to global results of beilinson, drinfeld, frenkel, and gaitsgory. their methods are particularly compelling because they do not have analogues in the original langlands program. using geometric langlands as motivation, i will introduce the hitchin fibration and describe recent results regarding the geometry of the global nilpotent cone (i.e., hitchin fiber over zero). these results may be viewed in the
context of a global analogue of springer theory, which suggests many future directions. if there is time, i will also explain relations to classical and higher rank brill-noether theory.

\indent it is widely known the classical poisson-boltzmann theory fails to describe electrostatic interactions in the cases of multivalent counterions, highly charged surfaces, and low temperatures, as the theory ignores many-body ion-ion correlations. surprising phenomena due to correlation effects include the charge inversion and the attraction between two likely charged colloids, both of which are recent focuses of theoretical and experimental study. in this talk, we will present some theoretical and simulation results on these problems by studying the role of image charges on spherical colloids, and discuss the method to include the correlation effects in the mean-field pb theory.

\indent a``geometric'' construction of $su(2) (2+1)-$dimensional tqfts associates to a surface the vector space spanned my multi-curves modulo local relations. the relevant local relations are defined by the jones-wenzl projectors. this talk will outline an approach to categorification of this picture construction of tqfts, in particular categorification of the jones-wenzl projectors, and it will explain how the evaluation at a root of unity may be viewed as a localization of a category. (joint work with ben cooper).

\indent we will discuss the notion of arithmetic matroid, whose main example is provided by a list of elements of a finitely generated abelian group. guided by the geometry of toric arrangements, we will present a combinatorial interpretation of the associated arithmetic tutte polynomial, which generalizes crapo's formula for the classical tutte polynomial.

\indent the aim is to show a convergence theorem of the kahler-ricci flow: if the initial metric is sufficiently close to a shrinking
kahler-ricci soliton with respect to a holomorphic vector field, then
the modified kahler-ricci flow by this holomorphic vector field will
converge to a shrinking kahler-ricci soliton.

\indent in chemical systems, one studies the concentrations of chemical species over time. of particular interest are steady-state concentrations, and more specifically, when systems admits multiple equilibria. recent results of helton partially characterize this possibility in terms of the sign pattern of the stoichiometric matrix, where the stoichiometric matrix describes the chemical species' interactions.

\indent many biological and physiological processes involve
self-regulating mechanisms that prevent too much growth while ensuring against extinction: the rate of growth is somewhat random (``noisy"), but the distribution depends on the current state of the system. cancer growth and neurological control mechanisms are just a few examples. in finance, as well, markets self-regulate since people want to "buy low" and "sell high".

\indent some questions that we'd like to answer are: does the system have a well-defined average? in more technical terms, we want to know if the system is ergodic. how does this long-term average compare to the long-term behavior of the deterministic (not random) system? what can we say about the distribution of ``survival times", i.e. the distribution of times until the system reaches a particular value?

\indent in this talk we will look at (and listen to) a simple example of a noisy, discrete dynamical system with parametric noise and explore ways to answer these questions analytically. we prove ergodicity for a class of growth models, and show that the randomness is harmful to the population in the sense that the long-term average is decreased by the presence of noise. when systems obeying noisy growth laws are connected together as a coupled lattice, the long-term effects of the
noise can have damaging effects on the organism as a whole, even though local interactions might favor growth in a particular area. we will present simulations that highlight the effect of both the noise and the local coupling on the survival of the organism.

\indent we use toric symmetry and degeneration to study the gw theory of $x = {\bf p^1} \times {\bf p^1} \times {\bf p^1}$ . there exists a toric blowup $y$ of $x$ whose polytope is the permutohedron. the permutohedron admits a symmetry which is manifest in the gw theory of $y$. we use degeneration to show this symmetry descends to $x$ itself. this also shows a subtle relationship between the gw theories of ${\bf p^1} \times {\bf p^1} \times {\bf p^1}$ and ${\bf p^3}$. all this is joint work with dhruv
ranganathan.

\indent starting with $n$ particles at the origin in $z^d$, let each particle in turn perform simple random walk until reaching an unoccupied site. lawler, bramson and griffeath proved that with high probability the resulting random set of n occupied sites is close to a ball. we show that its fluctuations from circularity are, with high probability, at most logarithmic in the radius of the ball, answering a question posed by lawler in 1995 and confirming a prediction made by chemical physicists in the 1980's. joint work with david jerison and scott sheffield.

\indent i will first review the notion of galois averages of rankin-selberg $l$-functions, in particular those of rankin-selberg $l$-functions of weight-two cusp forms times theta series associated to hecke characters of imaginary quadratic fields. i will then present a conjecture about the behaviour of these averages with the conductor of the character, of which the nonvanishing theorems of rohrlich, vatsal and cornut-vatsal are special cases. finally, i will explain a strategy of proof, at least in the setting where the class number is equal to one.

\indent this talk discusses the derivation and analysis of mathematical models motivated by the experimental induction of contour phosphenes in the retina. first, a spatially discrete chain of periodically forced coupled oscillators is considered via reduction to a chain of scalar phase equations. each isolated oscillator locks in a 1-2 manner with the forcing, so there is intrinsic bistability, with activity peaking on either the odd or even cycles of the forcing. if half the chain is started on the odd cycle and half on the even cycle ("split state"), then with sufficiently strong coupling a wave can be produced which can travel in either direction due to symmetry. numerical and analytic methods are employed to determine the size of coupling necessary for the split state solution to destabilize such that waves appear. next we take a continuum limit, reducing the chain to a partial differential equation. we use a melnikov function to compute, to leading order, the speed of the traveling wave solution to the partial differential equation as a function of the form of coupling and the forcing parameters and compare our result to numerically computed discrete and continuum wave speeds. this is joint work with bard ermentrout and jonathan rubin, published in physica d volume 240, issue 7 as a paper under the same name.

\indent a tropical curve is a vertex-weighted metric graph. it is hyperelliptic if it admits an involution whose quotient is a tree. assuming no prior knowledge of tropical geometry, i will develop the theory of tropical hyperelliptic curves and discuss the relationship with classical algebraic curves and their berkovich skeletons. along the way, we will see some nice combinatorics, including an analogue for graphs of holomorphic maps of riemann surfaces.

\indent we discuss the challenge of understanding the wild representation theory of lie algebras over fields of positive characteristic. even very explicit examples lead to difficult, if not impossible, problems. one can make some computations, but how does one give structure to these computations? recent joint work with julia pevtsova introduces algebro-geometric invariants for such representations, an approach which leads to algebraic vector bundles on familiar (and not so familiar) algebraic varieties.

\footnotesize

the talk is devoted to the problem of characterization of integrals as linear functionals. the main idea goes back to hadamard. the first well known results in this field are the f.riesz theorem (1909) on integral presentation of bounded linear functionals by riemann-stiltjes integrals on the segment and the radon theorem (1913) on integral presentation of bounded linear functionals by lebesque integrals on a compact in rn. after papers of i.radon, m.fréchet and f.hausdorff the problem of characterization of integrals as linear functionals is used to be formulated as the problem of extension of radon theorem from rn on more general topological spaces with radon measures. this problem turned out to be rather complicated. the history of its solution is long and rich. it is quite natural to call it the riesz-radon-fréchet problem of characterization of integrals. the important stages of its solution are connected with names of s.banach (1937-38), sacks (1937-38), kakutani (1941), p.halmos (1950), hewitt (1952), edwards (1953), n.bourbaki (1969), and others. some essential technical tools were developed by a.d.alexandrov (1940--43), m.stone (1948--49), d.fremlin (1974), and others.
in 1997 a.v.mikhalev and v.k.zakharov had found a solution of riesz-radon-fréchet problem of characterization for integrals on an arbitrary hausdorff topological space for nonbounded positive radom measures.
the next modern period of this problem for arbitrary radon measures is connected mostly with results by a.v.mikhalev, t.v.rodionov, and v.k.zakharov. a special attention is paid to algebraic aspects used in the proof.

\indent we consider a model of asexually reproducing individuals. the birth and death rates of the individuals are affected by a fitness parameter. the rate of mutations that cause the fitnesses to change is proportional to the population size, $n$. the mutations may be either beneficial or deleterious. in a paper by yu, etheridge and cuthbertson (2009) it was shown that the average rate at which the mean fitness increases in this model is bounded below by $\text{log}^{1-\delta}n$ for any $\delta > 0$. we achieve an upper bound on the average rate at which the mean fitness increases of $o(\text{log}\hspace{1pt}n/\text{log log} \hspace{1pt}n)$.

\indent ask a physicist. you will be told that it's a manifold with some anticommuting coordinates. i will explain this cryptic answer by addressing the following natural questions.

(1) what does this mean? that is, in what mathematical context is it meaningful?

(2) why would anyone want to do this? that is, what applications does it have?

\indent if we have a smooth compact manifold, then its cotangent bundle has a natural symplectic form. a smooth affine variety also has a natural symplectic form. one can ask the following question: which cotangent bundles are symplectomorphic to smooth affine varieties? we construct many cotangent bundles that are not symplectomorphic to smooth affine varieties.

\indent the main tool used to distinguish these objects is called wrapped floer cohomology.

\small
a variety of linear algebras over a field is said to be schreier if any subalgebra of a free algebra of this variety is free. the variety of all algebras, the variety of all commutative algebras, the variety of all anti-commutative algebras, the variety of all lie algebras, the variety of all lie superalgebras, varieties of all lie p-algebras and lie p-superalgebras are the main types of schreier varieties of algebras.
let a(x) be the free algebra of a schreier variety of algebras with the set x of free generators. a system of elements $u_1,…, u_n$ of a(x) is primitive if there is a set y of free generators of the free algebra a(x) such that $u_1,…, u_n$ belong to y.
an element u of a(x) is said to be almost primitive if u is not a primitive element of a(x), but u is a primitive element of any subalgebra of a(x) which contains it.
algorithms to recognize primitive systems of elements of free algebras of the main types of schreier varieties of algebras are constructed. we obtain also algorithms to construct complements of primitive systems of elements with respect to free generating sets. series of almost primitive elements are constructed.
this talk is based on joint works with c.champagnier, a.a.chepovskii, a.v.klimakov, a.v.mikhalev, i.p.shestakov, u.u.umirbaev, j.-t.yu, and a.a.zolotykh.

\indent given a pfaffian system on a smooth manifold, we shall discuss the notion of reduced submanifold and how to find them. this was motivated from the problem of deciding the minimality of generic cr manifolds. as best known by the noether's theorem conservation laws arise from the symmetry of differential equations. we approach the conservation laws from the viewpoint of the reduction of pfaffian systems and discuss some possible applications.

\indent counting curves on threefolds has been defined in several conjecturally equivalent instances, by integrating with respect to a virtual class on a moduli space (of stable maps for gromov-witten theory, ideal sheaves for donaldson-thomas theory, and stable pairs for pandharipande-thomas theory). the analogous picture for k3 surfaces is incomplete. the gromov-witten theory has been calculated by maulik, pandharipande, and thomas, and was shown to give rise to modular forms. in joint work with benjamin bakker we define and compute an analog of dt/pt theory on k3 surfaces via stable pairs and show that it similarly gives rise to modular forms on $\gamma(4)$.

\indent i will first describe a generalization of a result by haagerup and thorbjornsen on the asymptotic norm of non-commutative polynomials of random matrices, in the case of unitary matrices. then i will show how such results help us refine our understanding of the outputs of random quantum channels. in particular one obtains optimal estimates for the minimum output entropy of a large class of typical quantum channels. the first part of this talk is based on joint work with camille male, and the second part is based on joint work with serban belinschi and ion nechita.

it is well-known from weil that the isomorphism classes of rank n vector bundles on an algebraic curve can be written as the set of certain double cosets of gl(n,a), where a is the adeles of the curve. i will introduce such presentation in the realm of algebraic geometry and discuss two of its applications: the first is the tamagawa number formula (proved by gaitsgory-lurie), and the second is the verlinde formula in positive characteristic

\indent one-parameter convolution semigroups of probability measures on euclidean space are related to limits of partial products of infinitesimal triangular systems of measures, in the sense that such limits are embeddable into one-parameter convolution semigroups. it is a long-standing problem related to the central limit theorem that on an arbitrary locally compact group such a result cannot be tackled unless the infinitesimal system is commutative and additional conditions on the underlying group and/or the limiting measure are satisfied. we shall develop the main steps towards the solution of the problem of embeddable limits and connect the problem with the embedding of infinitely divisible probability measures on the group. the problem, in full generality, is still open.

\indent we consider the question of global in time existence and uniqueness of solutions of the infinite depth full water wave problem. we show that the nature of the nonlinearity of the water wave equation is essentially of cubic and higher orders. for any initial data that is small in its kinetic energy and height, we show that the 2-d full water wave equation is uniquely solvable almost globally in time. and for any initial interface that is small in its steepness and velocity, we show that the 3-d full water wave equation is uniquely solvable globally in time.

we investigate the transversality of holomorphic mappings between cr submanifolds of complex spaces. in equidimension case, we show that a holomorphic mapping sending one generic submanifold into another of the same dimension is cr transversal to the target, provided that the source manifold is of finite type and the map is of generic full rank. in different dimensions, the situation is more delicate. we will show that under certain restrictions on the dimensions and the rank of levi forms, the mappings for which the set points where the map has degenerate rank is of codimension at least 2, is transversal to the target. in addition, we show that under more restrictive conditions on the manifolds, finite holomorphic mappings are transversal.

we show that any $k$-uniform hypergraph with $n$ edges contains two
edge
disjoint subgraphs of size $\tilde{\omega}(n^{2/(k+1)})$ for $k=4,5$
and
$6$. this result is best possible up to a logarithmic factor due to a
upper bound construction of erd\h{o}s, pach, and pyber who show there
exist $k$-uniform hypergraphs with $n$ edges and with no two edge
disjoint isomorphic subgraphs with size larger than
$\tilde{o}(n^{2/(k+1)})$. furthermore, this result extends results
erd\h{o}s, pach and pyber who also established the lower bound for $k=2$
(eg. for graphs), and of gould and r\"odl who established the result for

i will introduce a new geometric flow on complex, non-kahler
manifolds. i will exhibit perelman-type functionals for this flow, and some regularity results. finally i will present an optimal regularity conjecture and discuss its relationship to the long open problem of the classification of class vii surfaces. this is joint work with g.tian.

given any closed hyperbolic surface of a fixed genus, we
establish an identity involving dilogarithm of lengths of simple
closed geodesics in all embedded pairs of pants and one-holed tori in
the surface. one may consider this as a counterpart of mcshane's
identity for closed hyperbolic surfaces. this is a joint work with ser
peow tan.