Abstract
We modify Grayson's model of of an exact category to give a presentation whose generators are binary acyclic complexes of length at most for any given . As a corollary, we obtain another, very short proof of the identification of Nenashev's and Grayson's presentations.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.