16:00
Brownian Motions and Martingales under Probability Model Uncertainty
Abstract
The models of Brownian motion, Poisson processes, Levy processes and martingales are frequently used as basic formulations of prices in financial market. But probability and/or distribution uncertainties cause serious problems of robustness. Nonlinear expectations (G-Expectations) and the corresponding martingales are useful tools to solve them.
Computing the local Cassels-Tate pairing.
Abstract
Let K be a number field and E/K be an elliptic curve. Multiplication by n induces a map from the n^2-Selmer group of E/K to the n-Selmer group. The image of this map contains the image of E(K) in the n-Selmer group and is often smaller. Thus, computing the image of the n^2-Selmer group under multiplication by n can give a tighter bound on the rank of E/K. The Cassels-Tate pairing is a pairing on the n-Selmer group whose kernel is equal to the image of the n^2-Selmer group under multiplication by n. For n=2, Cassels gave an explicit description of the Cassels-Tate pairing as a sum of local pairings and computed the local pairing in terms of the Hilbert symbol. In this talk, I will give a formula for the local Cassels-Tate pairing for n=3 and describe an algorithm to compute it for n an odd prime. This is joint work with Tom Fisher.
Compressed sensing and matrix completion: exploiting simplicity in data
Abstract
The essential information contained in most large data sets is
small when compared to the size of the data set. That is, the
data can be well approximated using relatively few terms in a
suitable transformation. Compressed sensing and matrix completion
show that this simplicity in the data can be exploited to reduce the
number of measurements. For instance, if a vector of length $N$
can be represented exactly using $k$ terms of a known basis
then $2k\log(N/k)$ measurements is typically sufficient to recover
the vector exactly. This can result in dramatic time savings when
k
Useful geometry and modular forms
Abstract
Algebraic geometry has become the standard language for many number theorists in recent decades. In this talk, we will define modular forms and related objects in the language of modern geometers, thereby giving a geometric motivation for their study. We will ask some naive questions from a purely geometric point of view about these objects, and try to answer them using standard geometric techniques. If time permits, we will discuss some rather deep consequences in number theory of our geometric excursion, and mention open problems in geometry whose solution would have profound consequences in number theory.
Multi-task Learning and Structured Sparsity
Abstract
We discuss the problem of estimating a structured matrix with a large number of elements. A key motivation for this problem occurs in multi-task learning. In this case, the columns of the matrix correspond to the parameters of different regression or classification tasks, and there is structure due to relations between the tasks. We present a general method to learn the tasks' parameters as well as their structure. Our approach is based on solving a convex optimization problem, involving a data term and a penalty term. We highlight different types of penalty terms which are of practical and theoretical importance. They implement structural relations between the tasks and achieve a sparse representations of parameters. We address computational issues as well as the predictive performance of the method. Finally we discuss how these ideas can be extended to learn non-linear task functions by means of reproducing kernels.
Auslander-Reiten-quivers in functorially finite resolving subcategories
Abstract
It has been shown that the Auslander-Reiten-quiver of an indecomposable algebra contains a finite component if and only if A is representation finite. Moreover, selfinjective algebras are representation finite if and only if the tree types of the stable components are given by Dynkin Diagrams. I will present similar results for the Auslander-Reiten-quiver of a functorially finite resolving subcategory Ω. We will see that Brauer-Thrall 1 and Brauer-Thrall 1.5 can be proved for these categories with only little extra effort. Furthermore, a connection between sectional paths in A-mod and irreducible morphisms in Ω will be given. Finally, I will show how all finite Auslander-Reiten-quivers of A-mod or Ω are related to Dynkin Diagrams with a notion similar to the tree type that coincides in a finite stable component.
12:00
Relaxation in BV via polyhedral approximation
Abstract
We first provide a brief overview of some of the key properties of the space $\textrm{BV}(\Omega;\mathbb{R}^{N})$ of functions of Bounded Variation, and the motivation for its use in the Calculus of Variations. Now consider the variational integral
\[
F(u;\Omega):=\int_{\Omega}f(Du(x))\,\textrm{d} x\,\textrm{,}
\]
where $\Omega\subset\mathbb{R}^{n}$ is open and bounded, and $f\colon\mathbb{R}^{N\times n}\rightarrow\mathbb{R}$ is a continuous function satisfying the growth condition $0\leq f(\xi)\leq L(1+|\xi|^{r})$ for some exponent $r$. When $u\in\textrm{BV}(\Omega;\mathbb{R}^{N})$, we extend the definition of $F(u;\Omega)$ by introducing the functional
\[
\mathscr{F}(u,\Omega):= \inf_{(u_{j})}\bigg\{ \liminf_{j\rightarrow\infty}\int_{\Omega}f(Du_{j})\,\textrm{d} x\, \left|
\!\!\begin{array}{r}
(u_{j})\subset W_{\textrm{loc}}^{1,r}(\Omega, \mathbb{R}^{N}) \\
u_{j} \stackrel{\ast}{\rightharpoonup} u\,\,\textrm{in }\textrm{BV}(\Omega, \mathbb{R}^{N})
\end{array} \right. \bigg\} \,\textrm{.}
\]
\noindent For $r\in [1,\frac{n}{n-1})$, we prove that $\mathscr{F}$ satisfies the lower bound
\[
\mathscr{F}(u,\Omega) \geq \int_{\Omega} f(\nabla u (x))\,\textrm{d} x + \int_{\Omega}f_{\infty} \bigg(\frac{D^{s}u}{|D^{s}u|}\bigg)\,|D^{s}u|\,\textrm{,}
\]
provided $f$ is quasiconvex, and the recession function $f_{\infty}$ ($:= \overline{\lim}_{t\rightarrow\infty}f(t\xi )/t$) is assumed to be finite in certain rank-one directions. This result is a natural extension of work by Ambrosio and Dal Maso, which deals with the case $r=1$; it involves combining work of Kristensen, Braides and Coscia with some new techniques, including a polyhedral approximation result and a blow-up argument that exploits fine properties of BV functions.
Relations between some topological and group theoretic conjectures
Abstract
I will be looking at some conjectures and theorems closely related to the h-cobordism theorem and will try to show some connections between them and some group theoretic conjectures.
10:30
17:00
Homological dimension of soluble groups and some new complement and supplement theorems.
Abstract
The homological dimension of a group can be computed over any coefficient ring $K$.
It has long been known that if a soluble group has finite homological dimension over $K$
then it has finite Hirsch length and the Hirsch length is an upper bound for the homological
dimension. We conjecture that equality holds: i.e. the homological dimension over $K$ is
equal to the Hirsch length whenever the former is finite. At first glance this conjecture looks
innocent enough. The conjecture is known when $K$ is taken to be the integers or the field
of rational numbers. But there is a gap in the literature regarding finite field coefficients.
We'll take a look at some of the history of this problem and then show how some new near complement
and near supplement theorems for minimax groups can be used to establish the conjecture
in special cases. I will conclude by speculating what may be required to solve the conjecture outright.
14:15
Supersymmetric loop space
Abstract
We will first review the construction of N =1
supersymmetric Yang-Mills theory in three dimensions. Then we will
construct a superloop space formulation for this super-Yang-Mills
theory in three dimensions.Thus, we will obtain expressions for loop
connection and loop curvature in this superloop space. We will also
show that curvature will vanish, unless there is a monopole in the
spacetime. We will also construct a quantity which will give the
monopole charge in this formalism. Finally, we will show how these
results hold even in case of deformed superspace.
N-covering stationary points and constrained variational problems
Abstract
In this talk we show how degree N maps of the form $u_{N}(z) = \frac{z^{N}}{|z|^{N-1}}$ arise naturally as stationary points of functionals like the Dirichlet energy. We go on to show that the $u_{N}$ are minimizers of related variational problems, including one whose associated Euler-Lagrange equation bears a striking resemblance to a system studied by N. Meyers in the 60s, and another where the constraint $\det \nabla u = 1$ a.e. plays a prominent role.
Automorphisms of relatively hyperbolic groups and McCool groups
Abstract
We define a McCool group of G as the group of outer automorphisms of G acting as a conjugation on a given family of subgroups. We will explain that these groups appear naturally in the description of many natural groups of automorphisms. On the other hand, McCool groups of a toral relatively hyperbolic group have strong finiteness properties: they have a finite index subgroup with a finite classifying space. Moreover, they satisfy a chain condition that has several other applications.
This is a joint work with Gilbert Levitt.
Non-commuting closed strings on non-geometric backgrounds
Abstract
OCCAM Group Meeting
Abstract
- Kiran Singh - Multi-body dynamics in elastocapillary systems
- Graham Morris - Investigating a catalytic mechanism using voltammetry
- Thomas Woolley - Cellular blebs: pressure-driven axisymmetric, membrane protrusions
Packing Ellipsoids with Overlap
Abstract
Problems of packing shapes with maximal density, sometimes into a
container of restricted size, are classical in discrete
mathematics. We describe here the problem of packing a given set of
ellipsoids of different sizes into a finite container, in a way that
allows overlap but that minimizes the maximum overlap between adjacent
ellipsoids. We describe a bilevel optimization algorithm for finding
local solutions of this problem, both the general case and the simpler
special case in which the ellipsoids are spheres. Tools from conic
optimization, especially semidefinite programming, are key to the
algorithm. Finally, we describe the motivating application -
chromosome arrangement in cell nuclei - and compare the computational
results obtained with this approach to experimental observations.
\\
\\
This talk represents joint work with Caroline Uhler (IST Austria).