To a group theorist ribbon groups look like knot groups, except that we know everything about knot groups and next to nothing about ribbon groups.
I will talk about an old paper of mine with Peter Teichner where several questions on ribbon groups naturally arise.
Given a group G, one can seek to understand (some of) its subgroups. Centralisers of elements are easy to define, but maybe not so easy to understand: even in such well studied groups as Out(Fn) they are not yet understood in general. I'll discuss recent work with Armando Martino where we extend what is known in Out(Fn), involving a (surprising?) connection to free-by-cyclic groups and their automorphisms as well as working with actions on trees. The strategies seem like they should apply in many more cases, and if time allows I'll discuss ongoing work (with Gilbert Levitt and Armando Martino) exploring these possibilities.
This talk will be an invitation to the study of cubulated groups and their quotients via the tools of cubical small cancellation theory. Non-positively curved cube complexes are a class of cell-complexes whose geometry and combinatorial structure is closely related to the structure of the groups that act nicely on their universal covers. I will tell you a bit about what we know and don’t know about these groups and spaces, and about the tools we have to study their quotients. I will explain some applications of the study of these quotients to producing a large variety of examples of large-dimensional hyperbolic (and non-hyperbolic) groups.
Recent years have seen many new ideas appearing in the solution theories of singular stochastic partial differential equations. An exciting application of SPDEs that is beginning to emerge is to the construction and analysis of quantum field theories. In this talk, I will describe how stochastic quantisation of Parisi–Wu can be used to study QFTs, especially those arising from gauge theories, the rigorous construction of which, even in low dimensions, is largely open.
In their seminal 2012 paper, Elekes and Szabó found that a certain weak combinatorial non-expansion property of an algebraic relation suffices to trigger the group configuration theorem, showing that only (approximate subgroups of) algebraic groups can be responsible for it. I will discuss some more recent variations and elaborations on this result, focusing on the case of ternary relations on varieties of dimension >1.
The usual language of algebraic geometry is not appropriate for Arithmetical geometry: addition is singular at the real prime. We developed two languages that overcome this problem: one replace rings by the collection of “vectors” or by bi-operads and another based on “matrices” or props. These are the two languages of [Har17], but we omit the involutions which brings considerable simplifications. Once one understands the delicate commutativity condition one can proceed following Grothendieck footsteps exactly. The square matrices, when viewed up to conjugation, give us new commutative rings with Frobenius endomorphisms.
Tensor decomposition express a tensor as a linear combination of elementary tensors. They have applications in chemometrics, computer science, machine learning, psychometrics, and signal processing. Their uniqueness properties render them suitable for data analysis tasks in which the elementary tensors are the quantities of interest. However, in applications, the idealized mathematical model is corrupted by measurement errors. For a robust interpretation of the data, it is therefore imperative to quantify how sensitive these elementary tensors are to perturbations of the whole tensor. I will give an overview of recent results on the condition number of tensor decompositions, established with my collaborators C. Beltran, P. Breiding, and N. Dewaele.
Recently Linares-Otto-Tempelmayr have unveiled a very interesting algebraic structure which allows to define a new class of rough paths/regularity structures, with associated applications to stochastic PDEs or ODEs. This approach does not consider trees as combinatorial tools but their fertility, namely the function which associates to each integer k the number of vertices in the tree with exactly k children. In a joint work with J-D Jacques we have studied this algebraic structure and shown that it is related with a general and simple class of so-called post-Lie algebras. The construction has remarkable properties and I will try to present them in the simplest possible way.
Placeholder entry; date+time TBC.
Abstract for talk: In this talk, we present a systematic discretization of the Bernstein-Gelfand-Gelfand (BGG) diagrams and complexes over cubical meshes of arbitrary dimension via the use of tensor-product structures of one-dimensional piecewise-polynomial spaces, such as spline and finite element spaces. We demonstrate the construction of the Hessian, the elasticity, and div-div complexes as examples for our construction.
Let $k,l>1$ be two multiplicatively independent integers. A subset $X$ of $\mathbb{N}^n$ is $k$-recognizable if the set of $k$-ary representations of $X$ is recognized by some finite automaton. Cobham's famous theorem states that a subset of the natural numbers is both $k$-recognizable and $l$-recognizable if and only if it is Presburger-definable (or equivalently: semilinear). We show the following strengthening. Let $X$ be $k$-recognizable, let $Y$ be $l$-recognizable such that both $X$ and $Y$ are not Presburger-definable. Then the first-order logical theory of $(\mathbb{N},+,X,Y)$ is undecidable. This is in contrast to a well-known theorem of Büchi that the first-order logical theory of $(\mathbb{N},+,X)$ is decidable. Our work strengthens and depends on earlier work of Villemaire and Bès. The essence of Cobham's theorem is that recognizability depends strongly on the choice of the base $k$. Our results strengthens this: two non-Presburger definable sets that are recognizable in multiplicatively independent bases, are not only distinct, but together computationally intractable over Presburger arithmetic. This is joint work with Christian Schulz.