加载中…
In Grayson’s combinatorial description of higher K-groups, the generators are bounded acyclic binary multi-complexes of arbitrary size. Generalising work by Kasprowski, Winges and the author, we show in this paper that multi-complexes of bounded size suffice and we provide the corresponding relations. Furthermore, we report on the progress in our attempt to algebraically prove the surjectivity of Quillen’s dévissage isomorphism for K_1 and we give an elementary and fairly simple example in the codomain which appears to require a more sophisticated approach.

生成讲解博客的中文版本

生成AI智能校验的中文版本