Tue, 02 Nov 2021
14:15
L5

Solving semidecidable problems in group theory

Giles Gardam
(Münster)
Abstract

Group theory is littered with undecidable problems. A classic example is the word problem: there are groups for which there exists no algorithm that can decide if a product of generators represents the trivial element or not. Many problems (the word problem included) are at least semidecidable, meaning that there is a correct algorithm guaranteed to terminate if the answer is "yes", but with no guarantee on how long one has to wait. I will discuss strategies to try and tackle various semidecidable problems computationally using modern solvers for Boolean satisfiability, with the key example being the discovery of a counterexample to the Kaplansky unit conjecture.

Alois Alzheimer called Alzheimer's disease (AD) the disease of forgetfulness in a 1906 lecture that would later mark its discovery. Alzheimer noticed the presence of aggregated protein plaques, made up of misfolded variants of amyloid-beta (A$\beta$) and tau ($\tau$P) proteins, in the brain of one of his patients. These plaques are thought to be the drivers of the overall cognitive decline that is observed in AD. AD is now one of the leading causes of death in many developed countries, including the United Kingdom.

Thu, 21 Oct 2021
15:00
Virtual

The stable boundary

Maryanthe Malliaris
(University of Chicago)
Abstract

This talk will be about the stable boundary seen from different recent points of view.

Tue, 12 Oct 2021

15:30 - 16:30
L6

Exact correlations in topological quantum chains

Nick Jones
(University of Oxford)
Abstract

Free fermion chains are particularly simple exactly solvable models. Despite this, typically one can find closed expressions for physically important correlators only in certain asymptotic limits. For a particular class of chains, I will show that we can apply Day's formula and Gorodetsky's formula for Toeplitz determinants with rational generating function. This leads to simple closed expressions for determinantal order parameters and the characteristic polynomial of the correlation matrix. The latter result allows us to prove that the ground state of the chain has an exact matrix-product state representation.

Thu, 28 Oct 2021
14:00
Virtual

Randomized FEAST Algorithm for Generalized Hermitian Eigenvalue Problems with Probabilistic Error Analysis

Agnieszka Międlar
(University of Kansas)
Further Information

This talk is hosted by the Computational Mathematics Group of the Rutherford Appleton Laboratory.

Abstract

Randomized NLA methods have recently gained popularity because of their easy implementation, computational efficiency, and numerical robustness. We propose a randomized version of a well-established FEAST eigenvalue algorithm that enables computing the eigenvalues of the Hermitian matrix pencil $(\textbf{A},\textbf{B})$ located in the given real interval $\mathcal{I} \subset [\lambda_{min}, \lambda_{max}]$. In this talk, we will present deterministic as well as probabilistic error analysis of the accuracy of approximate eigenpair and subspaces obtained using the randomized FEAST algorithm. First, we derive bounds for the canonical angles between the exact and the approximate eigenspaces corresponding to the eigenvalues contained in the interval $\mathcal{I}$. Then, we present bounds for the accuracy of the eigenvalues and the corresponding eigenvectors. This part of the analysis is independent of the particular distribution of an initial subspace, therefore we denote it as deterministic. In the case of the starting guess being a Gaussian random matrix, we provide more informative, probabilistic error bounds. Finally, we will illustrate numerically the effectiveness of all the proposed error bounds.

 

---

A link for this talk will be sent to our mailing list a day or two in advance.  If you are not on the list and wish to be sent a link, please contact @email.

Mon, 08 Nov 2021

16:00 - 17:00
L3

TModel-free portfolio theory: a rough path approach

DAVID PROEMEL
(Mannheim University)
Abstract

Classical approaches to optimal portfolio selection problems are based 
on probabilistic models for the asset returns or prices. However, by 
now it is well observed that the performance of optimal portfolios are 
highly sensitive to model misspecifications. To account for various 
type of model risk, robust and model-free approaches have gained more 
and more importance in portfolio theory. Based on a rough path 
foundation, we develop a model-free approach to stochastic portfolio 
theory and Cover's universal portfolio. The use of rough path theory 
allows treating significantly more general portfolios in a model-free 
setting, compared to previous model-free approaches. Without the 
assumption of any underlying probabilistic model, we present pathwise 
Master formulae analogously to the classical ones in stochastic 
portfolio theory, describing the growth of wealth processes generated 
by pathwise portfolios relative to the wealth process of the market 
portfolio, and we show that the appropriately scaled asymptotic growth 
rate of Cover's universal portfolio is equal to the one of the best 
retrospectively chosen portfolio. The talk is based on joint work with 
Andrew Allan, Christa Cuchiero and Chong Liu.

 

Mon, 01 Nov 2021

16:00 - 17:00
L3

: Locality for singular stochastic PDEs

YVAIN BRUNED
(Edinburgh University)
Abstract

 In this talk, we will present the tools of regularity structures to deal with singular stochastic PDEs that involve non-translation invariant differential operators. We describe in particular the renormalized equation for a very large class of spacetime dependent renormalization schemes. Our approach bypasses the previous approaches in the translation-invariant setting. This is joint work with Ismael Bailleul.

 

Mon, 25 Oct 2021

16:00 - 17:00
L3

Brownian Windings

ISAO SAUZEDDE
(University of Oxford)
Abstract

Given a point and a loop in the plane, one can define a relative integer which counts how many times the curve winds around the point. We will discuss how this winding function, defined for almost every points in the plane, allows to define some integrals along the loop. Then, we will investigate some properties of it when the loop is Brownian.
In particular, we will explain how to recover data such as the Lévy area of the curve and its occupation measure, based on the values of the winding of uniformly distributed points on the plane.

 

Subscribe to