Nerve Complexes of Circular Arcs
We show that the nerve and clique complexes of n arcs in the circle are homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time \(O(n\log n)\). For the particular case of the nerve complex of evenly-spaced arcs of the same length, we determine explicit homology bases and we relate the complex to a cyclic polytope with n vertices. We give three applications of our knowledge of the homotopy types of nerve complexes of circular arcs. First, we show that the Lovász bound on the chromatic number of a circular complete graph is either sharp or off by one. Second, we use the connection to cyclic polytopes to give a novel topological proof of a known upper bound on the distance between successive roots of a homogeneous trigonometric polynomial. Third, we show that the Vietoris–Rips or ambient Čech simplicial complex of n points in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension, and furthermore this homotopy type can be computed in time \(O(n\log n)\).
KeywordsNerve complex Čech complex Vietoris–Rips complex Circular arc Cyclic polytope
Mathematics Subject Classification05E45 52B15 68R05
We would like to thank Anton Dochtermann for encouraging us to consider the connection to the Lovász bound in Sect. 6, and we would like to thank Arnau Padrol and Yuliy Baryshnikov for helpful conversations about cyclic polytopes. We are grateful to the referees for suggestions regarding the paper, and in particular for bringing  to our attention. Research of MA was carried out while at the Max Planck Institut für Informatik, Saarbrücken, Germany. Research of HA was supported by the Institute for Mathematics and its Applications with funds provided by the National Science Foundation. FF was supported by the German Science Foundation DFG via the Berlin Mathematical School.
- 2.Adamaszek, M., Adams, H.: The Vietoris–Rips complex of the circle. Preprint, arXiv:1503.03669
- 3.Adamaszek, M., Adams, H., Motta, F.: Random cyclic dynamical systems. Preprint, arXiv:1511.07832
- 11.Björner, A.: Topological Methods. Handbook of Combinatorics, vol. 2. Elsevier, Amsterdam (1995)Google Scholar
- 15.Chazal, F., Oudot, S.: Towards persistence-based reconstruction in Euclidean spaces. In: Proceedings of the 24th Annual Symposium on Computational Geometry, pp. 232–241. ACM, New York (2008)Google Scholar
- 16.Colin de Verdière, É., Ginot, G., Goaoc, X.: Multinerves and Helly numbers of acyclic families. In: Proceedings of the 28th Annual Symposium on Computational Geometry, pp. 209–218. ACM, New York (2012)Google Scholar
- 31.Previte-Johnson, C.: The \(D\)-Neighborhood Complex of a Graph. PhD thesis, Colorado State University, Fort Collins (2014)Google Scholar
- 32.Taylan, D.: Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs. Order (2015). doi: 10.1007/s11083-015-9379-3