Effectiveness of Walker's Cancellation Theorem

Abstract

Walker's Cancellation theorem for abelian groups tells us that if A is finitely generated and G and H are such that A G A H, then G H. Michael Deveau showed that the theorem can be effectivized, but not uniformly. In this paper, we expand on Deveau's initial analysis to show that the complexity of uniformly outputting an index of an isomorphism between G and H, given indices for A, G, H, the isomorphism between A G and A H, and the rank of A, is 0'.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…