Computably simple copies for homogeneous completely decomposable groups
Computably simple copies for homogeneous completely decomposable groups
Let be a subgroup of , and consider a computable group of the form
A computably simple-copy conjecture. Theorem~ holds for any computable group of this form. That is, every computable homogeneous completely decomposable group of infinite rank has a computably simple copy. The claim extends the construction for the free abelian group; the nonhomogeneous or non-completely-decomposable cases are described as substantially more difficult because divisibility conditions must be maintained.
Sources & referencesView supporting material
Primary source
Alexander G. Melnikov and Andre Nies, “Computably locally compact groups and their closed subgroups”, arXiv:2407.19440 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.