Consider the coboundary matrix $C^1(G, \mathbb{Z}) \to C^2(G, \mathbb{Z})$ of the normalized bar resolution of $G$ with coefficients in the trivial $\mathbb{Z}G$-module $\mathbb{Z}$. That is, thinking of the elements of $C^1(G,\mathbb{Z})$ as row vectors in $\mathbb{Z}^{|G|-1}$ (-1 because it's normalized), the coboundary matrix here is of size $(|G|-1) \times (|G|^2-2|G|+1)$.
I noticed that when I put this matrix into Smith Normal Form, it seemed that all the elementary divisors divided $|G|$. I have verified this in GAP for all groups up to and including order 60. (I am happy to share my GAP code and its output if anyone wants. For the curious, this arises in at least one approach to algorithms for testing isomorphism of finite groups.)
Q1. Is it the case that the elementary divisors of the above coboundary map always divide $|G|$, and if so why?
I know that $|G|$ annihilates $H^2(G, \mathbb{Z})$, but that proof is about the transfer map on cohomology and doesn't depend on the resolution, whereas (I think!) the coboundary map above is strongly about this particular resolution, so I couldn't see how the transfer argument would tell me something about this particular coboundary matrix.
My second observation is that most of the elementary divisors seem to be 1. (In fact, I originally thought they were always 1 until I did a computer search. At some point I think I had a proof that they are all 1 for cyclic groups.) Up to order 60, most groups have only one or two elementary divisors that aren't 1, and the max number of non-1 elementary divisors is 5 (which occurs only once, for SmallGroup(32, 51)). Also, most elementary divisors seem to not only divide the order of the group, but to be relatively small, even among numbers that divide $|G|$. I know that in the world of finite groups only going up to order 60 one may see patterns due to the "law of small numbers groups", but I nonetheless ask:
Q2. Is there some explanation for the distribution of these elementary divisors, especially why there are so many 1s and why in general they are relatively small among the set of all divisors of $|G|$?
I am particularly curious if for perfect or simple groups, all the elementary divisors are 1 (this is true for $A_5$ and, IIRC, for cyclic groups), but for the sake of not including too many questions in a single post I think I'll leave it at that.
(Note: it is standard that, writing $d(G)$ for the min number of generators of $G$, the columns are all in the $\mathbb{Z}$-span of the columns indexed by pairs $(g,h)$ where $h$ is one of a chosen generating set. Thus we can reduce the size of the matrix to $(|G|-1) \times (|G|-1)d(G)$ without changing the nonzero elementary divisors. This helped a lot in speeding up the GAP calculations.)