K1K_1-groups via binary complexes of fixed length

preprint2019arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.