Abstract
We compare minimal combinatorial models of homotopy types: arbitrary simplicial complexes, flag complexes and order complexes. Flag complexes are the simplicial complexes which do not have the boundary of a simplex of dimension greater than one as an induced subcomplex. Order complexes are classifying spaces of posets and they correspond to models in the category of finite T 0-spaces. In particular, we prove that stably, that is after a suitably large suspension, the optimal flag complex representing a homotopy type is approximately twice as big as the optimal simplicial complex with that property (in terms of the number of vertices). We also investigate some related questions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
