A dagger category is a category where for every morphism f:x --> y there is a chosen adjoint f*:y --> x, as for example in the category of Hilbert spaces. I will explain this definition in elementary terms and give a few example. The only prerequisites for this talk are the notion of category, functor, and Hilbert space.

Dagger categories are a great categorical framework for some concepts from functional analysis such as C*-algebras and they also allow us to state Atiyah's definition unitary topological field theories in categorical lanugage. There is however a problem with dagger categories: they are what category theorists like to call 'evil'. This is isn't really meant as a moral judgement, it just means that many ways of thinking about ordinary categories don't quite translate to dagger categories.

For example, not every fully faithful and essentially surjective dagger functor is also a dagger equivalence. I will present a notion of 'indefinite completion' that I came up with to describe dagger categories in less 'evil' terms. (Those of you who know Karoubi completion will see a lot of similarities.) I'll also explain how this can be used to compute categories of dagger functors, and more specifically groupoids of unitary TFTs.

The Drinfeld half-plane is a rigid analytic variety over a p-adic field. In this talk, I will give an overview of the geometric aspects of this space and describe its connection with representation theory.

Agent-based models are an intuitive, interpretable way to model markets and give us a powerful mechanism to analyze counterfactual scenarios that might rarely occur in historical market data. However, building realistic agent-based models is challenging and requires that we (a) ensure that agent behaviors are realistic, and (b) calibrate the agent composition using real data. In this talk, we will present our work to build realistic agent-based models using a multi-agent reinforcement learning approach. Firstly, we show that we can learn a range of realistic behaviors for heterogeneous agents using a shared policy conditioned on agent parameters and analyze the game-theoretic implications of this approach. Secondly, we propose a new calibration algorithm (CALSHEQ) which can estimate the agent composition for which calibration targets are approximately matched, while simultaneously learning the shared policy for the agents. Our contributions make the building of realistic agent-based models more efficient and scalable.

We consider weakly-coupled QFT in AdS at finite temperature. We compute the holographic thermal two-point function of scalar operators in the boundary theory. We present analytic expressions for leading corrections due to local quartic interactions in the bulk, with an arbitrary number of derivatives and for any number of spacetime dimensions. The solutions are fixed by judiciously picking an ansatz and imposing consistency conditions. The conditions include analyticity properties, consistency with the operator product expansion, and the Kubo-Martin-Schwinger condition. For the case without any derivatives we show agreement with an explicit diagrammatic computation. The structure of the answer is suggestive of a thermal Mellin amplitude. Additionally, we derive a simple dispersion relation for thermal two-point functions which reconstructs the function from its discontinuity.