Computing simplicial representatives of homotopy group elements

A central problem of algebraic topology is to understand the homotopy groups $\pi_d(X)$ of a topological space $X$. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental group $\pi_1(X)$ of a given finite simplicial complex $X$ is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex $X$ that is simply connected (i.e., with $\pi_1(X)$ trivial), compute the higher homotopy group $\pi_d(X)$ for any given $d\geq 2$. %The first such algorithm was given by Brown, and more recently, \v{C}adek et al. However, these algorithms come with a caveat: They compute the isomorphism type of $\pi_d(X)$, $d\geq 2$ as an \emph{abstract} finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of $\pi_d(X)$. Converting elements of this abstract group into explicit geometric maps from the $d$-dimensional sphere $S^d$ to $X$ has been one of the main unsolved problems in the emerging field of computational homotopy theory. Here we present an algorithm that, given a~simply connected space $X$, computes $\pi_d(X)$ and represents its elements as simplicial maps from a suitable triangulation of the $d$-sphere $S^d$ to $X$. For fixed $d$, the algorithm runs in time exponential in $size(X)$, the number of simplices of $X$. Moreover, we prove that this is optimal: For every fixed $d\geq 2$, we construct a family of simply connected spaces $X$ such that for any simplicial map representing a generator of $\pi_d(X)$, the size of the triangulation of $S^d$ on which the map is defined, is exponential in $size(X)$

Hochschild homology invariants of K\"ulshammer type of derived categories

For a perfect field $k$ of characteristic $p>0$ and for a finite dimensional symmetric $k$-algebra $A$ K\"ulshammer studied a sequence of ideals of the centre of $A$ using the $p$-power map on degree 0 Hochschild homology. In joint work with Bessenrodt and Holm we removed the condition to be symmetric by passing through the trivial extension algebra. If $A$ is symmetric then the dual to the K\"ulshammer ideal structure was generalised to higher Hochschild homology in earlier work. In the present paper we follow this program and propose an analogue of the dual to the K\"ulshammer ideal structure on the degree $m$ Hochschild homology theory also to not necessarily symmetric algebras

Interpretable statistics for complex modelling: quantile and topological learning

As the complexity of our data increased exponentially in the last decades, so has our need for interpretable features. This thesis revolves around two paradigms to approach this quest for insights. In the first part we focus on parametric models, where the problem of interpretability can be seen as a “parametrization selection”. We introduce a quantile-centric parametrization and we show the advantages of our proposal in the context of regression, where it allows to bridge the gap between classical generalized linear (mixed) models and increasingly popular quantile methods. The second part of the thesis, concerned with topological learning, tackles the problem from a non-parametric perspective. As topology can be thought of as a way of characterizing data in terms of their connectivity structure, it allows to represent complex and possibly high dimensional through few features, such as the number of connected components, loops and voids. We illustrate how the emerging branch of statistics devoted to recovering topological structures in the data, Topological Data Analysis, can be exploited both for exploratory and inferential purposes with a special emphasis on kernels that preserve the topological information in the data. Finally, we show with an application how these two approaches can borrow strength from one another in the identification and description of brain activity through fMRI data from the ABIDE project

\v{C}ech-Delaunay gradient flow and homology inference for self-maps

We call a continuous self-map that reveals itself through a discrete set of point-value pairs a sampled dynamical system. Capturing the available information with chain maps on Delaunay complexes, we use persistent homology to quantify the evidence of recurrent behavior. We establish a sampling theorem to recover the eigenspace of the endomorphism on homology induced by the self-map. Using a combinatorial gradient flow arising from the discrete Morse theory for \v{C}ech and Delaunay complexes, we construct a chain map to transform the problem from the natural but expensive \v{C}ech complexes to the computationally efficient Delaunay triangulations. The fast chain map algorithm has applications beyond dynamical systems.Comment: 22 pages, 8 figure

Scl, sails and surgery

We establish a close connection between stable commutator length in free groups and the geometry of sails (roughly, the boundary of the convex hull of the set of integer lattice points) in integral polyhedral cones. This connection allows us to show that the scl norm is piecewise rational linear in free products of Abelian groups, and that it can be computed via integer programming. Furthermore, we show that the scl spectrum of nonabelian free groups contains elements congruent to every rational number modulo $\mathbb{Z}$, and contains well-ordered sequences of values with ordinal type $\omega^\omega$. Finally, we study families of elements $w(p)$ in free groups obtained by surgery on a fixed element $w$ in a free product of Abelian groups of higher rank, and show that \scl(w(p)) \to \scl(w) as $p \to \infty$.Comment: 23 pages, 4 figures; version 3 corrects minor typo