K1-groups via binary complexes of fixed length

Abstract

We modify Grayson's model of K1 of an exact category to give a presentation whose generators are binary acyclic complexes of length at most k for any given k 2. As a corollary, we obtain another, very short proof of the identification of Nenashev's and Grayson's presentations.

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…