arXiv · 1905.01440
Higher analogs of simplicial and combinatorial complexity
Abstract
We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$ and higher combinatorial complexity with higher simplicial complexity of the order complex of $P$.
Explore related subjects
Keep this discovery
Amit Kumar Paul. 2019-05-04. Higher analogs of simplicial and combinatorial complexity. https://arxiv.org/abs/1905.01440
Cite the original work for its findings. Save a collection to share your selection of sources.