Topological complexity of spatial polygon spaces

DOI10.1090/PROC/12998MaRDI QIDQ2809220zbMATH OpenOpenAlexFDO

Authors Donald M. Davis

Publication date 27 May 2016

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.01519

zbMATH Keywords

spatial polygon spacestopological complexity

Mathematics Subject Classification ID

Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Discriminantal varieties and configuration spaces in algebraic topology (55R80) Moduli problems for topological structures (58D29)

Abstract: Using known results about their integral cohomology ring, we prove that the topological complexity of the space of n-gons in R^3 with prescribed side lengths equals 2n-5, assuming that the space is nonempty and does not contain any straight-line polygons.

Review text

The topological complexity \(\mathrm{TC}(X)\) of a space \(X\) is a numerical homotopy invariant introduced by \textit{M. Farber} in [Discrete Comput. Geom. 29, No. 2, 211--221 (2003; Zbl 1038.68130)] in order to study the motion planning problem in Robotics from a topological perspective.NEWLINENEWLINEIf \(\overline{\ell}=(\ell _1,\dots,\ell_n)\) is an \(n\)-tuple of positive real numbers, the author of the paper under review deals with the computation of the topological complexity of \(N(\overline{\ell})\), the space of equivalence classes of oriented \(n\)-gons in \(\mathbb R^3\) with consecutive sides of length \(\ell_1,\dots,\ell_n\), identified under translation and rotation of \(\mathbb R^3\). Namely, as far as \(N(\overline{\ell})\) is nonempty and contains no straight-line polygons, the author proves by using cohomological arguments that \(\mathrm{TC}(N(\overline{\ell}))=2n-5\).

Recommendations

• TOPOLOGICAL COMPLEXITY (WITHIN 1) OF THE SPACE OF ISOMETRY CLASSES OF PLANAR n-GONS FOR SUFFICIENTLY LARGE n
• Topological complexity of planar polygon spaces with small genetic code
• Topological complexity of some planar polygon spaces
• Relative topological complexity of a pair
• Topological complexity of configuration spaces

Cites work

• scientific article; zbMATH DE number 653130 (Why is no real title available?)
• Invitation to topological robotics
• Mod two homology and cohomology
• Motion planning and control of a planar polygonal linkage
• The cohomology ring of polygon spaces
• Topological complexity of planar polygon spaces with small genetic code
• Topological complexity of some planar polygon spaces

Cited in

(10)

• Complexity of triangulations of the projective space.
• On topological complexity of non-orientable surfaces
• Topological complexity of \(n\) points on a tree
• Relative topological complexity of a pair
• K-theory and immersions of spatial polygon spaces
• Topological complexity of some planar polygon spaces
• Relative topological complexity and configuration spaces
• Topological complexity of planar polygon spaces with small genetic code
• Topological complexity of certain moment-angle complexes
• TOPOLOGICAL COMPLEXITY (WITHIN 1) OF THE SPACE OF ISOMETRY CLASSES OF PLANAR n-GONS FOR SUFFICIENTLY LARGE n

This page was built for publication: Topological complexity of spatial polygon spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809220)