Past

TBA

In joint work with Gareths Boxall and Jones we prove a poly-logarithmic bound for the number of rational points on the graph of functions on the disc that exhibit a certain decay. I will present an application of this counting theorem to the arithmetic of dynamical systems. It concerns fields generated by the solutions of equations of the form $P^{\circ n}(z) = P^{\circ n}(y)$ for a polynomial $P$ of degree $D \geq 2$ where $y$ is a fixed algebraic number. The general goal is to show that the degree of such fields grows like a power of $D^n$.    

We give a description of the category of ordinary K3 surfaces over a finite field in terms of linear algebra data over Z. This gives an analogue for K3 surfaces of Deligne's description of the category of ordinary abelian varieties over a finite field, and refines earlier work by N.O. Nygaard and J.-D. Yu. Two important ingredients in the proof are integral p-adic Hodge theory, and a description of CM points on Shimura stacks in terms of associated Galois representations. References: arXiv:1711.09225, arXiv:1707.01236.

It is difficult to determine when a graph G can be edge-covered by edge-disjoint copies of a fixed graph F. That is, when it has an F-decomposition. However, if G is large and has a high minimum degree then it has an F-decomposition, as long as some simple divisibility conditions hold. Recent research allows us to prove bounds on the necessary minimum degree by studying a relaxation of this problem, where a fractional decomposition is sought.

I will show how a relatively simple random process can give a good approximation to a fractional decomposition of a dense graph, and how it can then be made exact. This improves the best known bounds for this problem.
 

In this talk, first we  address the convergence issues of a standard finite volume element method (FVEM) applied to simple elliptic problems. Then, we discuss discontinuous finite volume element methods (DFVEM) for elliptic problems  with emphasis on  computational and theoretical  advantages over the standard FVEM. Further, we present a natural extension of DFVEM employed for the elliptic problem to the Stokes problems. We also discuss suitability of these methods for the approximation of incompressible miscible displacement problems.
 

Fake accounts detection and users’ polarization are two very well known topics concerning the social media sphere, that have been extensively discussed and analyzed, both in the academic literature and in everyday life. Social bots are autonomous accounts that are explicitly created to increase the number of followers of a target user, in order to inflate its visibility and consensus in a social media context. For this reason, a great variety of methods for their detection have been proposed and tested. Polarisation, also known as confirmation bias, is instead the common tendency to look for information that confirms one's preexisting beliefs, while ignoring opposite ones. Within this environment, groups of individuals characterized by the same system of beliefs are very likely to form. In the present talk we will first review part of the literature discussing both these topics. Then we will focus on a new dataset collecting tweets from the last Italian parliament elections in 2018 and some preliminary results will be discussed.

After outlining the principles of Algebraic Quantum Field Theory (AQFT) I will describe the generalization of Hochschild cohomology that is relevant to describing deformations in AQFT. An interaction is described by a cohomology class.

Answering a question of Milnor, Grigorchuk constructed in the early eighties the
first examples of groups of intermediate growth, that is, finitely generated
groups with growth strictly between polynomial and exponential.
In  joint work with Laurent Bartholdi, we show that under a mild regularity assumption, any function greater than exp(n^a), where `a' is a solution of the equation
  2^(3-3/x)+ 2^(2-2/x)+2^(1-1/x)=2,
is a growth function of some group. These are the first examples of groups
of intermediate growth where the asymptotic of  the growth function is known.
Among applications of our results is the fact that any group of locally subexponential growth
can be embedded as a subgroup of some group of intermediate growth (some of these latter groups cannot be  subgroups in Grigorchuk groups).

In a recent work with Tianyi Zheng, we  provide  near optimal lower bounds
for Grigorchuk torsion groups, including the first Grigorchuk group. Our argument is by a construction of random walks with non-trivial Poisson boundary, defined by 
a measure with power law decay.

We consider a collisionless kinetic equation describing the probability density of particles moving in a one-dimensional domain subject to partly diffusive reflection at the boundary. It was shown in 2017 by Mokhtar-Kharroubi and Rudnicki that for large times such systems either converge to an invariant density or, if no invariant density exists, exhibit a so-called “sweeping phenomenon” in which the mass concentrates near small velocities. This dichotomy is obtained by means of subtle arguments relying on the theory of positive operator semigroups. In this talk I shall review some of these results before discussing how, under suitable assumptions both on the boundary operators (which in particular ensure that an invariant density exists) and on the initial density, one may even obtain estimates on the rate at which the system converges to its equilibrium. This is joint work with Mustapha Mokhtar-Kharroubi (Besançon).

I will present a mathematical model for the genetic evolution of a population which is divided in discrete colonies along a linear habitat, and for which the population size of each colony is random and constant in time. I will show that, under reasonable assumptions on the distribution of the population sizes, over large spatial and temporal scales, this population can be described by the solution to a stochastic partial differential equation with constant coefficients. These coefficients describe the effective diffusion rate of genes within the population and its effective population density, which are both different from the mean population density and the mean diffusion rate of genes at the microscopic scale. To do this, I will present a duality technique and a new convergence result for coalescing random walks in a random environment.

Recent tools make it possible to partition the space of rational Dehn 
surgery slopes for a knot (or in some cases a link) in a 3-manifold into 
domains over which the Heegaard Floer homology of the surgered manifolds 
behaves continuously as a function of slope. I will describe some 
techniques for determining the walls of discontinuity separating these 
domains, along with efforts to interpret some aspects of this structure 
in terms of the behaviour of co-oriented taut foliations. This talk 
draws on a combination of independent work, previous joint work with 
Jake Rasmussen, and work in progress with Rachel Roberts.

In this paper, we investigate the limit properties of frequency of empirical averages when random variables are described by a set of probability measures and obtain a law of large numbers for upper-lower probabilities. Our result is an extension of the classical Kinchin's law of large numbers, but the proof is totally different.

keywords: Law of large numbers,capacity, non-additive probability, sub-linear expectation, indepence

paper by: Zengjing Chen School of Mathematics, Shandong University and Qingyang Liu Center for Economic Research, Shandong University

3d N=2 Chern-Simons-matter theories have a large variety of boundary conditions that preserve 2d N=(0,2) supersymmetry, and support chiral algebras. I'll discuss some examples of how the chiral algebras transform across dualities. I'll then explain how to construct duality interfaces in 3d N=2 theories, and relate dualities *of* duality interfaces to "Pachner moves" in triangulations of 4-manifolds. Based on recent and upcoming work with K. Costello, D. Gaiotto, and N. Paquette.

ATP-sensitive potassium (KATP) channels are critical for coupling changes in blood glucose to insulin secretion. Gain-of-function mutations in KATP channels cause a rare inherited form of diabetes that manifest soon after birth (neonatal diabetes). This talk shows how understanding KATP channel function has enabled many neonatal diabetes patients to switch from insulin injections to sulphonylurea drugs that block KATP channel activity, with considerable improvement in their clinical condition and quality of life.   Using a mouse model of neonatal diabetes, we also found that as little as 2 weeks of diabetes led to dramatic changes in gene expression, protein levels and metabolite concentrations. This reduced glucose-stimulated ATP production and insulin release. It also caused substantial glycogen storage and β-cell apoptosis. This may help explain why older neonatal diabetes patients with find it more difficult to transfer to drug therapy, and why the drug dose decreases with time in many patients. It also suggests that altered metabolism may underlie both the progressive impairment of insulin secretion and reduced β-cell mass in type 2 diabetes.

Joint work with Abdul-Lateef Haji-Ali

This talk will discuss efficient numerical methods for estimating the probability of a large portfolio loss, and associated risk measures such as VaR and CVaR. These involve nested expectations, and following Bujok, Hambly & Reisinger (2015) we use the number of samples for the inner conditional expectation as the key approximation parameter in the Multilevel Monte Carlo formulation. The main difference in this case is the indicator function in the definition of the probability. Here we build on previous work by Gordy & Juneja (2010) who analyse the use of a fixed number of inner samples, and Broadie, Du & Moallemi (2011) who develop and analyse an adaptive algorithm. I will present the algorithm, outline the main theoretical results and give the numerical results for a representative model problem. I will also discuss the extension to real portfolios with a large number of options based on multiple underlying assets.

We will discuss the algebraicity of two quantities central to the computation of persistent homology. We will also connect persistent homology and algebraic optimization. Namely, we will express the degree corresponding to the distance variable of the offset hypersurface in terms of the Euclidean distance degree of the starting variety, obtaining a new way to compute these degrees. Finally, we will describe the non-properness locus of the offset construction and use this to describe the set of points that are topologically interesting (the medial axis and center points of the bounded components of the complement of the variety) and relevant to the computation of persistent homology.

We will discuss a basic framework to deal with coherent sheaves on schemes over $\mathbb{Z}$, involving infinite-dimensional results on the geometry of numbers. As an application, we will discuss basic results, old and new, on arithmetic ampleness, such as Serre vanishing, Nakai-Moishezon, and Bertini. This is joint work with Jean-Benoît Bost.

There are a huge number of nonlinear partial differential equations that do not have analytic solutions.   Often one can find similarity solutions, which reduce the number of independent variables, but still leads, generally, to a nonlinear equation.  This can, only sometimes, be solved analytically.  But always the solution is independent of the initial conditions.   What role do they play?   It is generally stated that the similarity  solution agrees with the (not determined) exact solution when (for some variable say t) obeys t >> t_1.   But what is  t_1?   How does it depend on the initial conditions?  How large must  t be for the similarity solution to be within 15, 10, 5, 1, 0.1, ….. percent of the real solution?   And how does this depend on the parameters and initial conditions of the problem?   I will explain how two such typical, but somewhat different, fundamental problems can be solved, both analytically and numerically,  and compare some of the results with small scale laboratory experiments, performed during the talk.  It will be suggested that many members of the audience could take away the ideas and apply them in their own special areas.

This talk is concerned with quantitative periodic homogenization in domains with boundaries. The quantitative analysis near boundaries leads to the study of boundary layers correctors, which have in general a nonperiodic structure. The interaction between the boundary and the microstructure creates geometric resonances, making the study of the asymptotics or continuity properties particularly challenging. The talk is based on work with S. Armstrong, T. Kuusi and J.-C. Mourrat, as well as work by Z. Shen and J. Zhuge

In the 80s, Hatcher and Thurston introduced the pants graph as a tool to prove that the mapping class group of a closed, orientable surface is finitely presented. The pants graph remains relevant for the study of the mapping class group, sitting between the marking graph and the curve graph. More precisely, there is a sequence of natural coarse lipschitz maps taking the marking graph via the pants graph to the curve graph.

A second motivation for studying the pants graph comes from Teichmüller theory. Brock showed that the pants graph can be interpreted as a combinatorial model for Teichmüller space with the Weil-Petersson metric.

In this talk I will introduce the pants graph, discuss some of its properties and state a few open questions.