Higher analogs of simplicial and combinatorial complexity

From MaRDI portal
Publication:2329338




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.









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)