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 s...
on the occasion of his 60th birthday Abstract. In 1988, Golumbic and Hammer characterized powers of ...
Many questions about homotopy are provably hard or even unsolvable in general. However, in specific ...
Lovász conjectured that every connected 4-regular planar graph $G$ admits a realization as a system ...
Abstract. We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a ...
We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an ...
A \v{C}ech complex of a finite simple graph $G$ is a nerve complex of balls in the graph, with one b...
A spatial embedding of a graph G is a realization of G into the 3-dimensional Euclidean space R^3. J...
Circle graphs are intersection graphs of chords in a circle and k-polygon graphs are the intersectio...
41 pages, 4 figuresWe derive conditions under which the reconstruction of a target space is topologi...
[[abstract]]A circular arc family $F$ is a collection of arcs on a circle. A circular-arc graph is t...
International audienceGiven a simplicial complex and a collection of subcomplexes covering it, the n...
Citation: Arone, G., & Turchin, V. (2015). Graph-complexes computing the rational homotopy of high d...
The sectional category of a continuous map between topological spaces is a numerical invariant of th...
Lovász conjectured that every connected 4-regular planar graph G admits a realization as a system o...
AbstractWe show that the homotopy limit of a diagram of nerves of categories is again a nerve of a c...
on the occasion of his 60th birthday Abstract. In 1988, Golumbic and Hammer characterized powers of ...
Many questions about homotopy are provably hard or even unsolvable in general. However, in specific ...
Lovász conjectured that every connected 4-regular planar graph $G$ admits a realization as a system ...
Abstract. We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a ...
We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an ...
A \v{C}ech complex of a finite simple graph $G$ is a nerve complex of balls in the graph, with one b...
A spatial embedding of a graph G is a realization of G into the 3-dimensional Euclidean space R^3. J...
Circle graphs are intersection graphs of chords in a circle and k-polygon graphs are the intersectio...
41 pages, 4 figuresWe derive conditions under which the reconstruction of a target space is topologi...
[[abstract]]A circular arc family $F$ is a collection of arcs on a circle. A circular-arc graph is t...
International audienceGiven a simplicial complex and a collection of subcomplexes covering it, the n...
Citation: Arone, G., & Turchin, V. (2015). Graph-complexes computing the rational homotopy of high d...
The sectional category of a continuous map between topological spaces is a numerical invariant of th...
Lovász conjectured that every connected 4-regular planar graph G admits a realization as a system o...
AbstractWe show that the homotopy limit of a diagram of nerves of categories is again a nerve of a c...
on the occasion of his 60th birthday Abstract. In 1988, Golumbic and Hammer characterized powers of ...
Many questions about homotopy are provably hard or even unsolvable in general. However, in specific ...
Lovász conjectured that every connected 4-regular planar graph $G$ admits a realization as a system ...