UPPER BOUND FOR MONOIDAL TOPOLOGICAL COMPLEXITY

摘要

We show that tc(M) (M) <= 2 cat(M) for a finite simplicial complex M. For example, we have tc(M) (S-n boolean OR S-m) = 2 for any positive integers n and m.