Higher analogs of simplicial and combinatorial complexity
Algebraic Topology
2019-05-07 v1
Abstract
We introduce higher simplicial complexity of a simplicial complex and higher combinatorial complexity of a finite space (i.e. is a finite poset). We relate higher simplicial complexity with higher topological complexity of and higher combinatorial complexity with higher simplicial complexity of the order complex of .
Cite
@article{arxiv.1905.01440,
title = {Higher analogs of simplicial and combinatorial complexity},
author = {Amit Kumar Paul},
journal= {arXiv preprint arXiv:1905.01440},
year = {2019}
}