Complexes of tournaments, directionality filtrations and persistent homology

Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as “tournaplexes”, whose simplices are tournaments. In particular, given a digraph $${\mathcal {G}}$$ G , we associate with it a “flag tournaplex” which is a tournaplex containing the directed flag complex of $${\mathcal {G}}$$ G , but also the geometric realisation of cliques that are not directed. We define several types of filtrations on tournaplexes, and exploiting persistent homology, we observe that flag tournaplexes provide finer means of distinguishing graph dynamics than the directed flag complex. We then demonstrate the power of these ideas by applying them to graph data arising from the Blue Brain Project’s digital reconstruction of a rat’s neocortex.

The symplectic geometry of higher Auslander algebras: Symmetric products of disks

We show that the perfect derived categories of Iyama’s d-dimensional Auslander algebras of type ${\mathbb {A}}$ are equivalent to the partially wrapped Fukaya categories of the d-fold symmetric product of the $2$ -dimensional unit disk with finitely many stops on its boundary. Furthermore, we observe that Koszul duality provides an equivalence between the partially wrapped Fukaya categories associated to the d-fold symmetric product of the disk and those of its $(n-d)$ -fold symmetric product; this observation leads to a symplectic proof of a theorem of Beckert concerning the derived Morita equivalence between the corresponding higher Auslander algebras of type ${\mathbb {A}}$ . As a by-product of our results, we deduce that the partially wrapped Fukaya categories associated to the d-fold symmetric product of the disk organise into a paracyclic object equivalent to the d-dimensional Waldhausen $\text {S}_{\bullet }$ -construction, a simplicial space whose geometric realisation provides the d-fold delooping of the connective algebraic K-theory space of the ring of coefficients.

Complexes of Tournaments, Directionality Filtrations and Persistent Homology

Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as ``tournaplexes'', whose simplices are tournaments. In particular, given a digraph G, we associate with it a ``flag tournaplex'' which is a tournaplex containing the directed flag complex of G, but also the geometric realisation of cliques that are not directed. We define several types of filtrations on tournaplexes, and exploiting persistent homology, we observe that flag tournaplexes provide finer means of distinguishing graph dynamics than the directed flag complex. We then demonstrate the power of these ideas by applying them to graph data arising from the Blue Brain Project's digital reconstruction of a rat's neocortex.