Higher analogs of simplicial and combinatorial complexity

From MaRDI portal
Publication:2329338

DOI10.1016/J.TOPOL.2019.106859zbMATH Open1425.57015arXiv1905.01440OpenAlexW2969857904MaRDI QIDQ2329338FDOQ2329338

Amit Kumar Paul

Publication date: 17 October 2019

Published in: Topology and its Applications (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1905.01440




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Higher analogs of simplicial and combinatorial complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329338)