Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9652867 | Journal of Symbolic Computation | 2005 | 17 Pages |
Abstract
This paper offers an algorithmic solution to the problem of obtaining “economical” formulae for some maps in Simplicial Topology, having, in principle, a high computational cost in their evaluation. In particular, maps of this kind are used for defining cohomology operations at the cochain level. As an example, we obtain explicit combinatorial descriptions of Steenrod kth powers exclusively in terms of face operators.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Rocio Gonzalez-Diaz, Pedro Real,