November
2018  M  T  W  T  F  S  S     1  2  3  4  5  6  7  8  9  10  11  12  13  14  15  16  17  18  19  20  21  22  23  24  25  26  27  28  29  30          

Events in March 2018 
A Hecke module structure on the KKtheory of arithmetic groups 13:10 Fri 2 Mar, 2018 :: Barr Smith South Polygon Lecture theatre :: Bram Mesland :: University of Bonn
Media...Let $G$ be a locally compact group, $\Gamma$ a discrete subgroup and $C_{G}(\Gamma)$ the commensurator of $\Gamma$ in $G$. The cohomology of $\Gamma$ is a module over the Shimura Hecke ring of the pair $(\Gamma,C_G(\Gamma))$. This construction recovers the action of the Hecke operators on modular forms for $SL(2,\mathbb{Z})$ as a particular case. In this talk I will discuss how the Shimura Hecke ring of a pair $(\Gamma, C_{G}(\Gamma))$ maps into the $KK$ring associated to an arbitrary $\Gamma$C*algebra. From this we obtain a variety of $K$theoretic Hecke modules. In the case of manifolds the Chern character provides a Hecke equivariant transformation into cohomology, which is an isomorphism in low dimensions. We discuss Hecke equivariant exact sequences arising from possibly noncommutative compactifications of $\Gamma$spaces. Examples include the BorelSerre and geodesic compactifications of the universal cover of an arithmetic manifold, and the totally disconnected boundary of the BruhatTits tree of $SL(2,\mathbb{Z})$. This is joint work with M.H. Sengun (Sheffield). 

Calculating optimal limits for transacting credit card customers 15:10 Fri 2 Mar, 2018 :: Horace Lamb 1022 :: Prof Peter Taylor :: University of Melbourne
Credit card users can roughly be divided into `transactors', who pay off their balance each month, and `revolvers', who maintain an outstanding balance, on which they pay substantial interest.
In this talk, we focus on modelling the behaviour of an individual transactor customer. Our motivation is to calculate an optimal credit limit from the bank's point of view. This requires an expression for the expected outstanding balance at the end of a payment period.
We establish a connection with the classical newsvendor model. Furthermore, we derive the Laplace transform of the outstanding balance, assuming that purchases are made according to a marked point process and that there is a simplified balance control policy which prevents all purchases in the rest of the payment period when the credit limit is exceeded. We then use the newsvendor model and our modified model to calculate bounds on the optimal credit limit for the more realistic balance control policy that accepts all purchases that do not exceed the limit.
We illustrate our analysis using a compound Poisson process example and show that the optimal limit scales with the distribution of the purchasing process, while the probability of exceeding the optimal limit remains constant.
Finally, we apply our model to some real credit card purchase data. 

Radial Toeplitz operators on bounded symmetric domains 11:10 Fri 9 Mar, 2018 :: Lower Napier LG11 :: Raul QuirogaBarranco :: CIMAT, Guanajuato, Mexico
Media...The Bergman spaces on a complex domain are defined as the space of holomorphic squareintegrable functions on the domain. These carry interesting structures both for analysis and representation theory in the case of bounded symmetric domains. On the other hand, these spaces have some bounded operators obtained as the composition of a multiplier operator and a projection. These operators are highly noncommuting between each other. However, there exist large commutative C*algebras generated by some of these Toeplitz operators very much related to Lie groups. I will construct an example of such C*algebras and provide a fairly explicit simultaneous diagonalization of the generating Toeplitz operators. 

Quantum Airy structures and topological recursion 13:10 Wed 14 Mar, 2018 :: Ingkarni Wardli B17 :: Gaetan Borot :: MPI Bonn
Media...Quantum Airy structures are Lie algebras of quadratic differential operators  their classical limit describes Lagrangian subvarieties in symplectic vector spaces which are tangent to the zero section and cut out by quadratic equations. Their partition function  which is the function annihilated by the collection of differential operators  can be computed by the topological recursion. I will explain how to obtain quantum Airy structures from spectral curves, and explain how we can retrieve from them correlation functions of semisimple cohomological field theories, by exploiting the symmetries. This is based on joint work with Andersen, Chekhov and Orantin. 

Family gauge theory and characteristic classes of bundles of 4manifolds 13:10 Fri 16 Mar, 2018 :: Barr Smith South Polygon Lecture theatre :: Hokuto Konno :: University of Tokyo
Media...I will define a nontrivial characteristic class of bundles of
4manifolds using families of SeibergWitten equations. The basic idea
of the construction is to consider an infinite dimensional
analogue of the Euler class used in the usual theory of characteristic
classes. I will also explain how to prove the nontriviality of this
characteristic class. If time permits, I will mention a relation between
our characteristic class and positive scalar curvature metrics. 

Models, machine learning, and robotics: understanding biological networks 15:10 Fri 16 Mar, 2018 :: Horace Lamb 1022 :: Prof Steve Oliver :: University of Cambridge
The availability of complete genome sequences has enabled the construction of computer models of metabolic networks that may be used to predict the impact of genetic mutations on growth and survival. Both logical and constraintbased models of the metabolic network of the model eukaryote, the ale yeast Saccharomyces cerevisiae, have been available for some time and are continually being improved by the research community. While such models are very successful at predicting the impact of deleting single genes, the prediction of the impact of higher order genetic interactions is a greater challenge. Initial studies of limited gene sets provided encouraging results. However, the availability of comprehensive experimental data for the interactions between genes involved in metabolism demonstrated that, while the models were able to predict the general properties of the genetic interaction network, their ability to predict interactions between specific pairs of metabolic genes was poor. I will examine the reasons for this poor performance and demonstrate ways of improving the accuracy of the models by exploiting the techniques of machine learning and robotics.
The utility of these metabolic models rests on the firm foundations of genome sequencing data. However, there are two major problems with these kinds of network models  there is no dynamics, and they do not deal with the uncertain and incomplete nature of much biological data. To deal with these problems, we have developed the Flexible Nets (FNs) modelling formalism. FNs were inspired by Petri Nets and can deal with missing or uncertain data, incorporate both dynamics and regulation, and also have the potential for model predictive control of biotechnological processes.


Computing trisections of 4manifolds 13:10 Fri 23 Mar, 2018 :: Barr Smith South Polygon Lecture theatre :: Stephen Tillmann :: University of Sydney
Media...Gay and Kirby recently generalised Heegaard splittings of 3manifolds to
trisections of 4manifolds. A trisection describes a 4Ã¢ÂÂdimensional manifold
as a union of three 4Ã¢ÂÂdimensional handlebodies. The complexity of the
4Ã¢ÂÂmanifold is captured in a collection of curves on a surface, which guide
the gluing of the handelbodies. The minimal genus of such a surface is the
trisection genus of the 4manifold.
After defining trisections and giving key examples and applications, I will
describe an algorithm to compute trisections of 4Ã¢ÂÂmanifolds using arbitrary
triangulations as input. This results in the first explicit complexity
bounds for the trisection genus of a 4Ã¢ÂÂmanifold in terms of the number of
pentachora (4Ã¢ÂÂsimplices) in a triangulation. This is joint work with Mark
Bell, Joel Hass and Hyam Rubinstein. I will also describe joint work with
Jonathan Spreer that determines the trisection genus for each of the
standard simply connected PL 4manifolds. 

Complexity of 3Manifolds 15:10 Fri 23 Mar, 2018 :: Horace Lamb 1022 :: A/Prof Stephan Tillmann :: University of Sydney
In this talk, I will give a general introduction to complexity of
3manifolds and explain the connections between combinatorics, algebra,
geometry, and topology that arise in its study.
The complexity of a 3manifold is the minimum number of tetrahedra in a
triangulation of the manifold. It was defined and first studied by Matveev
in 1990. The complexity is generally difficult to compute, and various
upper and lower bounds have been derived during the last decades using
fundamental group, homology or hyperbolic volume.
Effective bounds have only been found in joint work with Jaco, Rubinstein
and, more recently, Spreer. Our bounds not only allowed us to determine the
first infinite classes of minimal triangulations of closed 3manifolds, but
they also lead to a structure theory of minimal triangulations of
3manifolds. 

