On higher order homological finiteness of rewriting systems. (Q557065)

For rewriting systems, the homotopical finiteness condition of `finite derivation type' (FDT) and the finiteness condition of `finite homological type' (FHT) have been defined. For finitely presented groups, the two finiteness conditions FDT and FHT are equivalent. In the case of monoids, FDT implies FHT but the converse was shown not to be true in a prior work of Pride and Otto. In this paper, the authors consider generalizations FHT\(_n\) of FHT and FDT\(_n\) of FDT to higher dimensions. Extending their prior work, the authors show that for each positive integer \(n\), there exists a finitely presented monoid that is not of type FDT, that is of type FHT\(_n\) but not of type FHT\(_{n+1}\), and that has word problem solvable in quadratic time. This result separates FDT\(_2\) from FHT\(_2\) answering an open question of McGlashan. This result also shows that FHT\(_n\) (\(n\geq 1\)) yield an infinite hierarchy that is independent of FDT.