Rocío González–Díaz, Pedro Real Universidad de Sevilla, Depto. de Matemática Aplicada I, (2001)
by Unknown Authors
BibTeX
@MISC{01rocíogonzález–díaz,,
author = {},
title = {Rocío González–Díaz, Pedro Real Universidad de Sevilla, Depto. de Matemática Aplicada I,},
year = {2001}
}
OpenURL
Abstract
In this note, working in the context of simplicial sets [17], we give a detailed study of the complexity for computing chain level Steenrod squares [20, 21], in terms of the number of face operators required. This analysis is based on the combinatorial formulation given in [5]. As an application, we give here an algorithm for computing cup–i products over integers on a simplicial complex at chain level. 1







