This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the topological complexity of its order complex.
The order complex of $PGL_2(p^{2^n})$ is contractible when $p$ is odd
A Combinatorial Analog of a Theorem of F.J.Dyson
On the homeomorphism and homotopy type of complexes of multichains
![QR code for arXiv:1605.06755 [math.CO]](http://oss.arxitics.com/images/favicon.svg)