Article
A combinatorial method for computing Steenrod squares
Author/s | González Díaz, Rocío
![]() ![]() ![]() ![]() ![]() ![]() ![]() Real Jurado, Pedro ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Department | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Date | 1999 |
Published in |
|
Abstract | We present here a combinatorial method for computing Steenrod squares of a simplicial set X. This method is essentially based on the determination of explicit formulae for the component morphisms of a higher diagonal ... We present here a combinatorial method for computing Steenrod squares of a simplicial set X. This method is essentially based on the determination of explicit formulae for the component morphisms of a higher diagonal approximation (i.e., a family of morphisms measuring the lack of commutativity of the cup product on the cochain level) in terms of face operators of X. A generalization of this method to Steenrod reduced powers is sketched |
Funding agencies | Junta de Andalucía Ministerio de Educación y Ciencia (MEC). España |
Project ID. | FQM-0143
![]() PB97-1025-C02-02 ![]() |
Citation | González Díaz, R. y Real Jurado, P. (1999). A combinatorial method for computing Steenrod squares. Journal of Pure and Applied Algebra, 139 (1-3), 89-108. |