A
-local finite group consists of a finite
-group
, together with a pair of categories which encode “conjugacy” relations among subgroups of
, and which are modelled on the fusion in a Sylow
-subgroup of a finite group. It contains enough information to define a classifying space which has many of the same properties as
-completed classifying spaces of finite groups. In this paper, we study and classify extensions of
-local finite groups, and also compute the fundamental group of the classifying space of a
-local finite group.
A p-local finite group is an algebraic structure with a classifying space which has many of the properties of p-completed classifying spaces of finite groups. In this paper, we construct a family of 2-local finite groups, which are exotic in the following sense: they are based on certain fusion systems over the Sylow 2-subgroup of Spin_7(q) (q an odd prime power) shown by Solomon not to occur as the 2-fusion in any actual finite group. Thus, the resulting classifying spaces are not homotopy equivalent to the 2-completed classifying space of any finite group. As predicted by Benson, these classifying spaces are also very closely related to the Dwyer-Wilkerson space BDI(4). Erratum (11 Feb 2005). An error in the paper was pointed out to the authors by Andy Chernak. The error is corrected in the erratum at the end of version 2, which should be read alongside the paper.Comment: Published by Geometry and Topology at http://www.maths.warwick.ac.uk/gt/GTVol6/paper28.abs.html Version 2 (11 Feb 2005) Erratum adde
We present a new computing package Flagser, designed to construct the directed flag complex of a finite directed graph, and compute persistent homology for flexibly defined filtrations on the graph and the resulting complex. The persistent homology computation part of Flagser is based on the program Ripser by U. Bauer, but is optimised specifically for large computations. The construction of the directed flag complex is done in a way that allows easy parallelisation by arbitrarily many cores. Flagser also has the option of working with undirected graphs. For homology computations Flagser has an approximate option, which shortens compute time with remarkable accuracy. We demonstrate the power of Flagser by applying it to the construction of the directed flag complex of digital reconstructions of brain microcircuitry by the Blue Brain Project and several other examples. In some instances we perform computation of homology. For a more complete performance analysis, we also apply Flagser to some other data collections. In all cases the hardware used in the computation, the use of memory and the compute time are recorded.