The isomorphism problem of planar polygon spaces
classification
🧮 math.GT
math.AT
keywords
isomorphismcohomologyconjectureproblemringsubringapplyingbars
read the original abstract
We give a proof of a Conjecture of Walker which states that one can recover the lengths of the bars of a circular linkage from the cohomology ring of the configuration space. For a large class of length vectors, this has been shown by Farber, Hausmann and Schuetz. In the remaining cases, we use Morse theory and the fundamental group to describe a subring of the cohomology invariant under graded ring isomorphism. From this subring the conjecture can be derived by applying a result of Gubeladze on the isomorphism problem of monoidal rings.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.