Deciding almost freeness of an action is NP-hard
classification
🧮 math.AT
keywords
actionalmostcompactdecidingnp-hardborelconstructionencode
read the original abstract
We encode a compact Lie group action on a compact manifold by the Sullivan model of its Borel construction. We then prove that deciding whether this action is almost free is NP-hard.
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.