Discrete Morse theory for computing cellular sheaf cohomology (Q330097)

The purpose of the paper under review is to create and analyze algorithms in order to compute sheaf cohomology. One of the tools the authors use to do this is a version of discrete Morse theory adapted for use with sheaves. This algorithm called ``Scythe'' is easily described. ``Scythe'' takes as input a parametrization \(F\) of a cochain complex over a graded poset \((X,\leq)\). This parametrization is obtained through a cellular cosheaf \(\mathcal{F}\) over a CW complex \(\mathcal{X}\) with values in a free \(R\)-module, a process discussed by the authors in Chapter 2. From this parametrization, ``Scythe'' outputs a Morse parametrization \(F^{\Sigma}\). Part of the algorithm involves applying an additional algorithm provided by the authors called ``ReducePair''. This uses discrete Morse methods in order to reduce the complex \(\Sigma\) to a simpler complex without changing the important topological features. After an introduction to the paper, the second chapter lays the groundwork for the rest of the paper. This includes pertinent definitions, such as that of parametrization and Morse data. Chapter 3 builds the necessary discrete Morse theory tools. While similar to and inspired by Forman's discrete Morse theory, the authors undertake the interesting task of developing such a theory suitable for cellular sheaves. The necessary steps taken are to come up with an acyclic matching and then show that this allows one to reduce to the Morse complex without effecting cohomology. Once this invariance has been established, the authors are ready to present their main algorithm (described briefly above) in Chapter 4. The algorithm is proven to be correct, and an analysis of the time complexity is given. Chapter 5 gives applications of the algorithm to computing cohomology via the Čech approach and the Leray approach.