English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

Nerve Complexes of Circular Arcs

MPS-Authors
/persons/resource/persons127763

Adamaszek,  Michal
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:1410.4336.pdf
(Preprint), 616KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Adamaszek, M., Adams, H., Frick, F., Peterson, C., & Previte-Johnson, C. (2014). Nerve Complexes of Circular Arcs. Retrieved from http://arxiv.org/abs/1410.4336.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-4473-5
Abstract
We show that the nerve complex of n arcs 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. 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 the dihedral group action on homology, 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 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. Second, we show that the Lovasz bound on the chromatic number of a circular complete graph is either sharp or off by one. Third, we show that the Vietoris--Rips 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).