In mathematics, subgroup growth is a branch of group theory, dealing with quantitative questions about subgroups of a given group.[1]
Let
G
n
an(G)
H
n
G
G
sn(G)
U
n
G
mn(G)
\triangleleft(G) | |
s | |
n |
n
Subgroup growth studies these functions, their interplay, and the characterization of group theoretical properties in terms of these functions.
The theory was motivated by the desire to enumerate finite groups of given order, and the analogy with Mikhail Gromov's notion of word growth.
Let
G
Zn\longrightarrowG
such that group multiplication can be expressed by polynomial functions in these coordinates; in particular, the multiplication is definable. Using methods from the model theory of p-adic integers, F. Grunewald, D. Segal and G. Smith showed that the local zeta function
\zetaG,(s)=
infty | |
\sum | |
\nu=0 |
s | |
pn |
(G)p-ns
p-s
As an example, let
G
x,y,z
[x,y]=z,[x,z]=[y,z]=1.
G
(a,b,c)
(a,b,c)\circ(a',b',c')=(a+a',b+b',c+c'+ab').
U
G
U
G
G=\langlex,y,z\rangle\triangleright\langley,z\rangle\triangleright\langlez\rangle\triangleright1
(g1,g2,g3)\inG
U
g1,g2,g3
U
g2\in\langley,z\rangle,g3\in\langlez\rangle
U
\zetaG,(s)=
1 | |
(1-p-1)3 |
\intl{M}|a11
s-1 | |
| | |
p |
|a22
s-2 | |
| | |
p |
|a33
s-3 | |
| | |
p |
d\mu,
\mu
Zp
| ⋅ |p
l{M}
p
\{a11,a12,a13,a22,a23,a33\}
a11 | |
\{x |
a12 | |
y |
a13 | |
z |
,
a22 | |
y |
a23 | |
z |
,
a33 | |
z |
\}
a33|a11 ⋅ a22
Now, the integral can be transformed into an iterated sum to yield
\zetaG,(s)=\suma\geq\sumb\geq
a+b | |
\sum | |
c=0 |
p-as-b(s-1)-c(s-2)=
1-p3-3s | |
(1-p-s)(1-p1-s)(1-p2-2s)(1-p2-3s) |
\zetaG(s)
\zetaG(s)=
\zeta(s)\zeta(s-1)\zeta(2s-2)\zeta(2s-3) | |
\zeta(3s-3) |
.
For more complicated examples, the computations become difficult, and in general one cannot expect a closed expression for
\zetaG(s)
\zetaG,(s)
can always be expressed as a definable
p
p
\zetaG(s)
p-s
\Re(s)=1
\zetaG(s)
\Re(s)>\alpha-\delta
where
\alpha
\zetaG(s)
\delta
\Re(s)=\alpha
\sumn\leqsn(G)\simx\alphalogkx
\alpha
k
Let
G
U
n
G
U
G
g(hU)=(gh)U.
In this way,
U
G
G/U
G
G/U
G
\{1,\ldots,n\},
the stabilizer of the point 1 is a subgroup of index
n
G
\{2,\ldots,n\}
can be permuted in
(n-1)!
ways, we find that
sn(G)
G
(n-1)!
G
sn(G)=
hn(G) | |
(n-1)! |
-
n-1 | |
\sum | |
\nu=1 |
hn-\nu(G)s\nu(G) | |
(n-\nu)! |
,
where
hn(G)
\varphi:G → Sn.
In several instances the function
hn(G)
sn(G)
hn(G)
sn(G)
As an example, let
F2
F2
F2 → Sn,
that is
hn(F
2. | |
2)=(n!) |
From this we deduce
sn(F2)\simn ⋅ n!.
For more complicated examples, the estimation of
hn(G)