Computing Cocycles on Simplicial Complexes

Rocío González-Díaz () and Pedro Real ()
Additional contact information
Rocío González-Díaz: Universidad de Sevilla, Depto. de Matemática Aplicada I
Pedro Real: Universidad de Sevilla, Depto. de Matemática Aplicada I

A chapter in Computer Algebra in Scientific Computing CASC’99, 1999, pp 177-190 from Springer

Abstract: 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.

Keywords: Nonnegative Integer; Simplicial Complex; Algebraic Topology; Homological Algebra; Combinatorial Formulation (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-60218-4_13

Ordering information: This item can be ordered from
http://www.springer.com/9783642602184

DOI: 10.1007/978-3-642-60218-4_13

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().