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