Topologically speaking, left-orderable countable groups are precisely those countable groups that embed into the group of orientation preserving homeomorphisms of the real line. A recent advancement in the theory of left-orderable groups is the discovery of finitely generated left-orderable simple groups by Hyde and Lodha. We will discuss a construction that extends this result by showing that every countable left-orderable group is a subgroup of such a group. We will also discuss some of the algebraic, geometric, and computability properties that this construction bears. The construction is based on novel topological and geometric methods that also will be discussed. The flexibility of the embedding method allows us to go beyond the class of left-orderable groups as well. Based on a joint work with Markus Steenbock.

In this talk we will introduce Leary and Minasyan's CAT(0) but not biautomatic groups as lattices in a product of a Euclidean space and a tree.  We will then investigate properties of general lattices in that product space.  We will also consider a construction of lattices in a Salvetti complex for a right-angled Artin group and a Euclidean space.  Finally, if time permits we will also discuss a "hyperbolic Leary–Minasyan group" and some work in progress with Motiejus Valiunas towards an application.

The Hull--Strominger system is a system of non-linear PDEs on heterotic string theory involving a pair of Hermitian metrics $(g,h)$ on a six dimensional manifold $M$. One of these equations dictates the metric $g$ on $M$ to be conformally balanced. We will begin the talk by giving a description of the geometry of cohomogeneity one manifolds and SU(3)-structures. Then, we will look for solutions to the Hull--Strominger system in the cohomogeneity one setting. We show that a six-dimensional simply connected cohomogeneity one manifold under the almost effective action of a connected Lie group $G$ admits no $G$-invariant balanced non-Kähler SU(3)-structures. This is a joint work with F. Salvatore.

One of the great challenges of neural networks is to understand how they work.  For example: does a neuron encode a meaningful signal on its own?  Or is a neuron simply an undistinguished and arbitrary component of a feature vector space?  The tension between the neuron doctrine and the population coding hypothesis is one of the classical debates in neuroscience. It is a difficult debate to settle without an ability to monitor every individual neuron in the brain.

Within artificial neural networks we can examine every neuron. Beginning with the simple proposal that an individual neuron might represent one internal concept, we conduct studies relating deep network neurons to human-understandable concepts in a concrete, quantitative way: Which neurons? Which concepts? Are neurons more meaningful than an arbitrary feature basis? Do neurons play a causal role? We examine both simplified settings and state-of-the-art networks in which neurons learn how to represent meaningful objects within the data without explicit supervision.

Following this inquiry in computer vision leads us to insights about the computational structure of practical deep networks that enable several new applications, including semantic manipulation of objects in an image; understanding of the sparse logic of a classifier; and quick, selective editing of generalizable rules within a fully trained generative network.  It also presents an unanswered mathematical question: why is such disentanglement so pervasive?

In the talk, we challenge the notion that the internal calculations of a neural network must be hopelessly opaque. Instead, we propose to tear back the curtain and chart a path through the detailed structure of a deep network by which we can begin to understand its logic.

I will introduce asymptotic safety, which is a quantum field theoretic
paradigm providing a predictive ultraviolet completion for quantum field
theories. I will show examples of asymptotically safe theories and then
discuss the search for asymptotically safe models that include quantum
gravity.
In particular, I will explain how asymptotic safety corresponds to a new
symmetry principle - quantum scale symmetry - that has a high predictive
power. In the examples I will discuss, asymptotic safety with gravity could
enable a first-principles calculation of Yukawa couplings, e.g., in the
quark sector of the Standard Model, as well as in dark matter models.

The path signature is a characterization of paths that originated in Chen's iterated integral cochain model for path spaces and loop spaces. More recently, it has been used to form the foundations of rough paths in stochastic analysis, and provides an effective feature map for sequential data in machine learning. In this talk, we return to the topological foundations in Chen's construction to develop generalizations of the signature.

In this talk, I'll present inequalities bounding the number of critical cells in a filtered cell complex on the one hand, and the entries of the Betti tables of the multi-parameter persistence modules of such filtrations on the other hand. Using the Mayer-Vietoris spectral sequence we first obtain strong and weak Morse inequalities involving the above quantities, and then we improve the weak inequalities achieving a sharp lower bound for the number of critical cells. Furthermore, we prove a sharp upper bound for the minimal number of critical cells, expressed again in terms of the entries of Betti tables. This is joint work with Andrea Guidolin (KTH, Stockholm). The full paper is posted online as arxiv:2108.11427.