Computing Cocycles on Simplicial Complexes
Rocio Gonzalez-Diaz, Pedro Real
Abstract
In this note, working in the context of simplicial sets, we give a detailed study of the complexity for computing chain level Steenrod squares, in terms of the number of face operators required. This analysis is based on the combinatorial formulation given in [R. Gonzalez-Diaz, P. Real. A Combinatorial Method for Computing Steenrod Squares. J. of Pure and Applied Algebra, 139 (1999) 89-108]. As an application, we give here an algorithm for computing cup-i products over integers on a simplicial complex at chain level.
Create a lesson
Related papers
Koszul duality and homotopy algebras for operads over quivers
Hang Yuan
Magnitude, path and coarse homology
Yasuhiko Asao
The p-local topologoical period-index problem in dimensions 2p+2 and below
Diarmuid Crowley, Xing Gu
Toward Quillen stratification for the odd primary Steenrod algebra
John H. Palmieri
Indecomposable Uniform Families on the Adams 4-Line
Jordan Benson, Runji Li
Sn-equivariant L-classes of Cartesian powers of Witt spaces and the Hodge index conjecture for symmetric products
Mohammadali Aligholi