Simplification Techniques for Maps in Simplicial Topology
classification
🧮 math.AT
keywords
mapssimplicialtopologyalgorithmiccochaincohomologycombinatorialcomputational
read the original 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 k-th powers exclusively in terms of face operators.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.