A combinatorial algorithm for computing higher order linking numbers (Q1688482)

In [Conf. algebr. Topol., Univ. Ill. Chicago Circle 1968, 174--205 (1969; Zbl 0212.55904)], \textit{W. S. Massey} introduced the higher-order linking as an application of his higher-order cohomology operations defined in terms of suitable cochains. Massey calculated the third-order linking numbers for some 3-component links by shifting from cohomology and cup product to homology and intersection theory via duality theorems for manifolds. In this article the authors complete Massey's original approach by developing systematically the intersection theory at the relative chain-cochain level in the simplicial category, and use it to derive recursive combinatorial formulae for computing all higher-order linking numbers.