Related papers: $K_1$-groups via binary complexes of fixed length

We show that in Grayson's model of higher algebraic $K$-theory using binary acyclic complexes, the complexes of length two suffice to generate the whole group. Moreover, we prove that the comparison map from Nenashev's model for $K_1$ to…

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…

We adapt Grayson's model of higher algebraic $K$-theory using binary acyclic complexes to the setting of stable $\infty$-categories. As an application, we prove that the $K$-theory of stable $\infty$-categories preserves infinite products.

In this article, we study higher Nil $K$-groups via binary complexes. More particularly, we exhibit an explicit form of generators of higher Nil $K$-groups in terms of binary complexes.

We present news proofs of the additivity, resolution and cofinality theorems for the algebraic $K$-theory of exact categories. These proofs are entirely algebraic, based on Grayson's presentation of higher algebraic $K$-groups via binary…

This paper provides a complete presentation of $K_1(Var)$, the $K_1$ group of varieties, resolving and simplifying a problem left open in \cite{ZakhK1}. Our approach adapts Gillet-Grayson's $G$-Construction to define an un-delooped…

In a previous paper I gave a presentation for the Quillen higher algebraic K-groups of an exact category in terms of "acyclic binary multicomplexes". In this paper I take that presentation as a definition of the higher K-groups, generalize…

The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…

We give a method to produce representations of the braid group $B_n$ of $n-1$ generators ($n\leq \infty$). Moreover, we give sufficient conditions over a non unitary representation for being of this type. This method produces examples of…

For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set…

This is half an overview article since what we describe here is essentially known. We describe $KK$-theory by generators and relations in a formal sum of formal products of $*$-homomorphisms and some synthetical morphisms. What comes out is…

The following question was asked by V. V. Bludov in The Kourovka Notebook in 1995: If a torsion-free group $G$ has a finite system of generators $a_1$, ..., $a_n$ such that every element of $G$ has a unique presentation in the form…

Let $C_{m} $ be a cyclic group of order $m$. We prove that if the group $G$ fits into an extension $1\to C_{2^{n+1}}^2\to G\to C_2\to 1$ then $G$ is good in the sense of Hopkins-Kuhn-Ravenel, i.e., $K(s)^*(BG)$ is evenly generated by…

For all sufficiently large odd integers $n$, the following version of Higman's embedding theorem is proved in the variety ${\cal B}_n$ of all groups satisfying the identity $x^n=1$. A finitely generated group $G$ from ${\cal B}_n$ has a…

Let a compact group G act on real or complex C*-algebras A and B, with A separable and B sigma-unital. We express the G-equivariant Kasparov groups KK_n(A,B) by algebraic K-groups of a certain additive category.

We develop the general formalism of approximable triangulated categories, and prove two representability theorems.

A cyclic presentation of a group is a presentation with an equal number of generators and relators that admits a particular cyclic symmetry. We characterise the orientable, non-orientable, and redundant cyclic presentations and obtain…

Guralnick, Kantor, Kassabov and Lubotzky (J. Eur. Math. Soc. 13.2, 2011, 391-458) [GKKL] give 3-generator 7-relator presentations of $A_n$ and $S_n$ with bit-length $O(\log n)$ for $n\geq5$. This is the best possible bit-length, since…

The standard $(n, k, d)$ model of random groups is a model where the relators are chosen randomly from the set of cyclically reduced words of length $k$ on an $n$-element generating set. Gromov's density model of random groups considers the…

In this manuscript, it is shown that the group of $K_1$-zero-cycles on the second generalized Severi-Brauer variety of an algebra $A$ of index 4 is given by elements of the group $K_1(A)$ together with a square-root of their reduced norm.…