Skip to content
Preprint

The Nil K-groups of finite groups

Sep 2026 · 0 citations · 33 references
Mathematics

Abstract

We show that for every finite group $G$ and every integer $n$, the Nil group $\mathrm{NK}_n(\mathbb{Z}[G])$ of the integral group ring of $G$ has finite exponent, and give a bound depending on n and the order $|G|$. This bound is explicit when every prime divisor of $|G|$ is at least $3+n/2$. More generally, our finite exponent result applies to $\mathrm{NK}_n(R[G])$ whenever $R$ is a regular, torsion-free, Noetherian commutative ring such that $R/p$ is regular for every prime $p$ that divides $|G|$. In the Appendix, M. Morrow provides an alternative approach and also shows that the Nil group $\mathrm{NK}_n(X)$ of an excellent Noetherian scheme $X$, with $X[1/p]$ regular, is annihilated by a finite power of $p$, provided $X$ admits a suitable resolution of singularities. By extending his argument to certain noncommutative rings, we also show that, for $R$ as above and $\alpha$ any automorphism of $G$, the Farrell Nil groups $\mathrm{NK}_n(R[G],\alpha)$ have finite exponent. As a consequence, for every virtually cyclic group $\Gamma$, the group $\mathrm{K}_n(\mathbb{Z}[\Gamma])$ is a direct sum of a finitely generated abelian group and an infinite countable direct sum of copies of a finite abelian group.

View source

Similar papers

Preprint Oct 2026

Additive bases and the zero-sum invariant $\mathsf{N}(G)$ for groups $C_p\oplus C_{np}$

Let $G$ be a finite abelian group, and let $c_0(G)$ be the least integer such that every regular sequence over $G$ of at least this length is an additive basis. Let $\mathsf N(G)$ be the least integer $l$ such that every weak-regular sequence $S$ over $G$ with $|S|\ge l$ has a nonempty zero-sum subsequence $T$ satisfyi...

Wenkai Yang · 0 citations
Preprint Sep 2026

Nonvanishing of cohomology for groups

Let $G$ be a finite group. We prove that the order of the abelianization $G/G'$ divides the order of $H^{2m}(G,\mathbb{Z})$ for every $m\geq1$. As a consequence, for a field $K$, nonvanishing of $Ext^1_{KG}(K,K)$ implies nonvanishing of $Ext^n_{KG}(K,K)$ for every $n\geq1$. This answers a conjecture by Erdmann, Kl\'asz...

Tiago Cruz, René Marczinzik · 0 citations
Preprint Sep 2026

On the order of a finite group with trivial centre and bounded conjugacy classes

A group is called an $n$-$\bfc$-group if each of its conjugacy classes is finite and contains at most $n$ elements. By a theorem of B.~H.~Neumann the derived subgroup of such a group is finite of $n$-bounded order, whereas the order of the group itself need not be bounded, as extraspecial $p$-groups show. We prove that...

I. Gorshkov · 0 citations
Preprint Oct 2026

When Do Restricted Sumsets Cover a Finite Abelian Group?

For a subset $A$ of a finite abelian group $G$, let $\Sigma_k(A)$ denote the set of sums of $k$ distinct elements of $A$, and let $\Sigma(A)=\bigcup_{k\ge1}\Sigma_k(A)$. The problem of determining when $\Sigma(A)=G$ goes back to Erd\H{o}s and Heilbronn. Nguyen and Vu later formulated the corresponding fixed-length ques...

Dong-Chun Han, Yuan-Hong Ren · 0 citations
Preprint Oct 2026

Almost tight asymptotic enumeration of finite $p$-groups: Almost all finite groups are $2$-groups of class $2$

Let $f(n)$ denote the number of isomorphism classes of groups of order $n$. We prove, uniformly over all primes $p$, that \[ \log_p f(p^m)=\frac{2}{27}m^3-\frac49m^2+O(m), \] with an absolute implied constant. This improves the classical upper bounds of Sims (\emph{Proc. Lond. Math. Soc.}, 1965) and Newman--Seeley and...

Yi-Nan Li, You-Ming Qiao · 0 citations
Preprint Oct 2026

Almost all finite groups are $2$-groups of class two

We prove that almost all finite groups are $2$-groups of nilpotency class two, when groups of order at most $x$ are counted up to isomorphism and $x\to\infty$. More precisely, uniformly for $2^m\leq x<2^{m+1}$, all but an $O(2^{-cm^2})$ proportion have order $2^m$ and class two, for some absolute constant $c>0$. For ea...

Ning Su, Bin-Zhou Xia · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.