Ponencia
Computing Cocycles on Simplicial Complexes
Autor/es | González Díaz, Rocío
Real Jurado, Pedro |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 1999 |
Fecha de depósito | 2021-09-22 |
Publicado en |
|
ISBN/ISSN | 978-3-540-66047-7 |
Resumen | 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 ... 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. |
Agencias financiadoras | Junta de Andalucía Ministerio de Educación y Ciencia (MEC). España |
Identificador del proyecto | FQM-0143
PB97-1025-C02-02 |
Cita | González Díaz, R. y Real Jurado, P. (1999). Computing Cocycles on Simplicial Complexes. En CASC 1999: 2nd International Workshop on Computer Algebra in Scientific Computing (177-190), Munich, Germany: Springer. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Computing cocycles on simplicial ... | 159.7Kb | [PDF] | Ver/ | |