Home Arithmetic lattices in unipotent algebraic groups
Article Publicly Available

Arithmetic lattices in unipotent algebraic groups

  • Khalid Bou-Rabee EMAIL logo and Daniel Studenmund
Published/Copyright: November 8, 2019

Abstract

Fixing an arithmetic lattice Γ in an algebraic group G, the commensurability growth function assigns to each n the cardinality of the set of subgroups Δ with [Γ:ΓΔ][Δ:ΓΔ]=n. This growth function gives a new setting where methods of F. Grunewald, D. Segal and G. C. Smith’s “Subgroups of finite index in nilpotent groups” apply to study arithmetic lattices in an algebraic group. In particular, we show that, for any unipotent algebraic -group with arithmetic lattice Γ, the Dirichlet function associated to the commensurability growth function satisfies an Euler decomposition. Moreover, the local parts are rational functions in p-s, where the degrees of the numerator and denominator are independent of p. This gives regularity results for the set of arithmetic lattices in G.

1 Introduction

Let G be an algebraic group defined over (an algebraic -group). Two subgroups Δ1 and Δ2 of G() are commensurable if their commensurability index

c(Δ1,Δ2):=[Δ1:Δ1Δ2][Δ2:Δ1Δ2]

is finite. An arithmetic lattice of G is a subgroup of G() that is commensurable with G(). The first purpose of this article is to show that, when G is unipotent, the set of arithmetic lattices in G has a great deal of regularity. The second purpose is to bring attention to a new notion of quantifying commensurability.

The main tool of this article is the commensurability growth function

{}

assigning to each n the cardinality

𝐜n(G(),G()):=|{ΔG():c(G(),Δ)=n}|.

We study 𝐜n(G(),G()) for groups G in the class 𝒰 of unipotent algebraic -groups, starting with the fact that 𝐜n(G(),G()) is finite for all n in Lemma 3.1. Note that the correspondence between G and G() is the Mal’cev correspondence [12] between unipotent -groups and torsion-free finitely generated nilpotent groups (see also [5]).

Our proofs follow the outline of F. Grunewald, D. Segal and G. C. Smith [6], who studied the subgroup growth function of torsion-free finitely generated nilpotent groups Γ, defined by an(Γ):={ΔΓ:[Γ:Δ]=n}, by decomposing the associated zeta function into a product of local functions (see also [4]). We overcome an additional technical hurdle in order to prove rationality of our local zeta functions. While Grunewald, Segal and Smith use a result of J. Denef [2] to prove rationality, we require rationality of an integral over a noncompact set, and therefore draw from work of A. MacIntyre [11] developed after [6]. See § 1.2 for more details.

In view of the relationship 𝐜n(Γ,Γ)=an(Γ), the function 𝐜n extends an to pairs of groups. While we have the simple relationship

𝐜n(G(),G())an(G()),

it is clear from the results in this paper that this inequality is strict when G is unipotent. The difference is evident even in the one-dimensional case.

1.1 The setting

Our results about 𝐜n are stated in the language of zeta functions. Let G be an algebraic group and a family of subgroups of G(). We associate to such a family the Dirichlet series

ζ(s)=Δc(G(),Δ)-s=n=1𝐜n()n-s,

where 𝐜n():=|{Δ:c(G(),Δ)=n}|.

Following [6], there are two questions one can ask about the sequence 𝐜n(): (a) how fast does it grow, and (b) how regularly does it behave? Pursuing (a) is the study of commensurability growth, which we do not directly address here. We will address (b) by decomposing ζ into local parts and proving a local regularity theorem. The families we consider are the following:

(G):={all arithmetic lattices insideG},
n(G):={Δ(G):c(Δ,G())=n},
(p)(G):={Δ(G):c(Δ,G())is a power ofp}.

Define the global and local commensurability zeta functions

ζG:=ζ(G)andζG,p:=ζ(p)(G).

1.2 The main results

We start with an elementary example, proved in § 2.

Proposition 1.1.

Let G=Ga, the additive algebraic group, so that G(Z)=Z and G(R)=R. Then, formally,

ζG(s)=ζ2(s)ζ(2s).

The zeta functions introduced in [6] decompose into Euler products. Our first main result, proved in § 3.1, is an analogous decomposition of the commensurability zeta function ζG for G𝒰 .

Proposition 1.2.

If GU, then

ζG(s)=pζG,p(s)

as formal products over all primes of Dirichlet series.

The main content of this article, our next result, is proved in § 3.2.

Theorem 1.3.

Let GU; then the function ζG,p(s) is rational in p-s, where the degrees of the numerators and denominators are bounded independently of the prime p.

Proposition 1.2 and Theorem 1.3 provide regularity results for the set of arithmetic lattices, (G).

Corollary 1.4.

Let GU; then

  1. 𝐜n((G))=𝐜piei((G)), where n=piei is the prime factorization of n;

  2. there exist positive integers l and k such that, for each prime p, the sequence (𝐜pi((G)))i>l satisfies a linear recurrence relation over of length at most k.

Our proof of Theorem 1.3 uses [11, Theorem 22]. We require a stronger theorem than that used in [6] since we express the local commensurability zeta function as a p-adic integral over an unbounded set (see Proposition 3.12). To find this explicit formula, we constructed a parametrization of lattices that gives a closed form for the commensurability index function (see Lemma 3.10). We also discovered an explicit correspondence

{closedKG(p):c(G(p),K)=pk}{ΔG():c(G(),Δ)=pk}

that may be of independent interest (see Lemma 3.5).

We were moved to pursue this subject after reading the work of N. Avni, S. Lim and E. Nevo [1] on the related concept of commensurator growth. Commensurator growth in [1], subgroup growth in [6] and commensurability growth in this paper are all studied through their associated zeta functions. Associating zeta functions to growth functions in groups is an active area of research, centering around subgroup growth and representation growth. For background reading on these subjects, we recommend the references [10, 15, 8].

Notation

  1. c(A,B)=[A:AB][B:AB].

  2. 𝒰 is the class of unipotent algebraic -groups.

  3. 𝒯 is the class of torsion-free finitely generated nilpotent groups.

  4. |S| is the cardinality of the set S.

  5. [x,y]=x-1y-1xy=x-1xy.

  6. Gn=gn:gG for n.

  7. Z(G) is the center of G.

  8. Tn(R) is the set of lower-triangular n×n matrices over a commutative ring R.

  9. ζ(s) is the Riemann zeta function.

2 The one-dimensional case

We begin with the integers. In this case, we can directly relate the commensurability zeta function with the classical zeta function.

Proposition 2.1.

Let G=Ga, the additive algebraic group, so that G(Z)=Z and G(R)=R. Then, formally,

ζG(s)=ζ2(s)ζ(2s).

Proof.

The subgroups of commensurable with are all of the form r, where r*. Writing r=n/d in reduced form, we have c(,r)=nd. Hence,

𝐜n((G))=|{a/b:a,b,(a,b)=1,ab=n}|.

From this, we get, for distinct primes p1,p2,p3,,pn,

𝐜p1j1p2j2pnjn((G))=𝐜p1j1((G))𝐜p2j2((G))𝐜pnjn((G)).

And for any prime p, we have 𝐜pk((G))=2. Hence, 𝐜n((G))=2ωn, where ωn is the number of distinct primes dividing n. Following [7, p. 255], we compute

ζG(s)=n=12ωnn-s=pprime(1+k=12pks)=pprime(2p-s1-p-s+1)=pprime1-p-2s(1-p-s)2=ζ2(s)ζ(2s).

3 Unipotent algebraic groups

To any G𝒰, we fix an embedding of G() into a group Tn() such that

G()=Tn()G()

given by Kolchin’s theorem [9]. With this in hand, we first show that, for any unipotent algebraic -group G, the commensurability growth function takes values in .

Lemma 3.1.

Let G be in U. Then Ln(G) is finite for any nN.

Proof.

Given n, for any Δn(G) and for every hΔ, we have hnG(). By [13, Exercise 7, p. 114], there exists a finitely generated subgroup ΓG() that contains every nth root of an element of G. Then every element in n(G) is a subgroup of Γ of index at most n[Γ:G()]. Since Γ is finitely generated, it has finitely many subgroups of any given index, so n(G) is finite. ∎

As an immediate consequence of the proof of Lemma 3.1, we get the well-known fact that arithmetic lattices in G are contained in G().

Lemma 3.2.

If G is in U, then each element of L(G) is a subgroup of G(Q). ∎

Slight modifications of a technical idea in the proof of Lemma 3.1 will be used repeatedly throughout the rest of the paper, so we encapsulate them here. Throughout, for any ΔG() and n, we write Δ1/n for the group generated by elements gG() such that gnΔ.

Lemma 3.3.

Let G be in U and Γ=G(Z) have nilpotence class c and Hirsch length d.

  1. For any k, [Γ1/k:Γ] is finite.

  2. We have (Γp-k)pkc(c+1)/2Γ.

  3. For any prime p and any k, we have [Γp-k:Γ]pdkc(c+1)/2.

Proof.

Item 1 follows from [13, Exercise 7, p. 114]. Item 2 follows from [13, Proposition 3, p. 113]. For the final statement, by [13, Exercise 7, p. 114], the group Γp-k is a finitely generated nilpotent group. As a finite extension of Γ, it has Hirsch length at most d, and hence

[Γp-k:(Γp-k)pkc(c+1)/2]pdkc(c+1)/2.

Then, by item 2, it follows that we have bounded [Γp-k:Γ] as desired. ∎

3.1 The Euler decomposition

Proposition 3.4.

If G is in U, then

ζG(s)=p𝑝𝑟𝑖𝑚𝑒ζG,p(s).

Proof.

Any group in n(G) is a subgroup of G()1/n. Hence, applying item 1 of Lemma 3.3, we see that Ω=n(G) is finitely generated and contains each element of n(G) as a subgroup of finite index. Hence, Λn=An(G)A is a subgroup of finite index in Ω. Let Λn be the normal core of Λn in Ω.

Consider the group Γ:=Ω/Λn. It is a finite nilpotent group, and hence decomposes into a product of its Sylow p-subgroups:

Ω/Λn=pSp.

For any image A in Γ of an element Δn(G), we get the decomposition

A=pAp,

where Ap are the Sylow p-subgroups of A and ApSp for every p. A similar statement is true for the image Q of G() in Γ; we have

Q=pprimeQp,whereQpSp.

We compute

QA=pprime(ApQp).

Hence,

c(G(),Δ)=c(Q,A)=pprimec(Ap,Qp).

Further, c(Ap,Qp) is the greatest power of p that divides n. Since any such element of n(G) arises from such a decomposed A, we have

𝐜n()=pkn𝐜pk(),

and hence the Euler decomposition for the commensurability zeta function above holds. ∎

3.2 p-adic formulation and the proof of Theorem 1.3

Let G𝒰. Fix a Mal’cev basis (x1,,xn) for G() so that

1<x1<x1,x2<<x1,,xn=G()

is a central series with infinite cyclic successive quotients. Elements in G(p) may be identified with the set of all “p-adic words” of the form

𝐱(𝐚)=x1a1xnan,where𝐚pn.

Note that 𝐱 parametrizes G() when restricted to 𝐚n. Let λ, κ, and μ(i) for i2 be polynomials defined over as in [6, p. 197] for the 𝒯 group G() so that, for 𝐚n, we have

𝐱(𝐚)k=𝐱(a1,a2,a3,,an)k=𝐱(λ(𝐚,k)),
𝐱(𝐚1)𝐱(𝐚2)𝐱(𝐚i)=𝐱(μ(i)(𝐚1,𝐚2,,𝐚i)),
[𝐱(𝐚1),𝐱(𝐚2)]=𝐱(κ(𝐚1,𝐚2)).

We denote the closure of a subset S of G(p) to be S¯ or S-. For any Γ(G), we have that Γ¯ is the pro-p completion of Γ [16, Theorem 4.3.5].

Lemma 3.5.

For each k, the closure map gives a one-to-one correspondence between elements of Lpk(G) and closed subgroups H of G(Qp) with

c(H,G(p))=pk.

Proof.

Let Γ=G()p-k. Note that Γ contains every subgroup in pk(G). Moreover, by item 2 of Lemma 3.3, we have that ΓpNG() for N=kc(c+1)/2, where c is the nilpotence class of G. It follows that any Δpk(G) contains ΓpN+k. Note that ΓpN+k is a normal subgroup of Γ and the quotient group Γ/ΓpN+k is a finite p-group. It follows that, for each Δpk(G), there is some such that [Γ:Δ]=p.

Let K be the closure of Γ in G(p). Then K is a finitely generated pro-p group. Any closed subgroup HG(p) satisfying c(H,G(p))=pk is a finite-index subgroup of G(p)p-k=K. The closure map gives an index-preserving bijection between subgroups of Γ with index a power of p and finite-index subgroups of K. This completes the proof. ∎

Define Gi=x1r1,,xiri:r1,,rip. The following is an extension of the notion of good basis from [6] to the G(p) setting.

Definition 3.6.

Let H be a closed subgroup of G(p). An n-tuple (h1,,hn) of elements in H is called a good basis if h1,,hi-=HGi for each i=1,,n.

Lemma 3.7.

Let hiGiGi-1 for i=1,,n, and let H=h1,,hn-. Then the following statements hold.

  1. c(H,G(p))<.

  2. (h1,,hn) is a good basis for H if and only if

    (3.1)[hi,hj]h1,,hi-1-𝑓𝑜𝑟 1i<jn.
  3. Suppose equation (3.1) holds, and let h1,,hnH. Then (h1,,hn) is a good basis for H if and only if there exists rip*, wih1,,hi-1- such that hi=wihiri for 1in.

Proof.

Since hiGiGi-1 for i=1,,n, we have

hi=x1ri1x2ri2xnrin,whererijp.

For any such nonzero rij, we have rij=up-k, where k and up*. If all such k are nonpositive, then we appeal to [6, Lemma 2.1]. Otherwise, let k be the maximal integer that appears in this way. Then

Hx1p-k,x2p-k,,xnp-k-G(p)p-k.

By continuity of taking powers, G(p)p-k is the closure of G()p-k in G(p). Thus, by applying item 2 of Lemma 3.3, we have that there exists m such that HmG(p). It follows that G(p)H must have the same dimension as G, and so item 1 follows. Items 2 and 3 follow from small modifications of the proof of [6, Lemma 2.1]. ∎

Definition 3.8.

For Δ(G), define 𝔘(Δ) to be the collection of pairs (A,B), where ATn(p), BTn(p), such that if ai denotes the ith row of A and bi denotes the ith row of B,

  1. (𝐱(a1),,𝐱(an)) is a good basis for Δ¯,

  2. (𝐱(b1),,𝐱(bn)) is a good basis for Δ¯G(p).

Combining suitable 𝔘(Δ) into one set, we define

𝔘p:=k=1(Δpk(G)𝔘(Δ)).

The next proposition shows that 𝔘p is Lp-defined in the sense of [11] (that is, it can be defined using first-order logic, p-norms and field operations). Note that |x|p|y|p can be stated in LP (see the example in [11, p. 71]).

Lemma 3.9.

Let (A,B)Tn(Qp)×Tn(Zp). Then (A,B)Up if and only if each of the following holds.

  1. det(A)0 and the rows a1,,an of the matrix A satisfy

    𝑓𝑜𝑟 1i<jn,there existYij1,,Yiji-1psuch thatκ(ai,aj)=μ(i-1)(λ(a1,Yij1),,λ(ai-1,Yiji-1)).
  2. det(B)0 and the rows b1,,bn of the matrix B satisfy

    𝑓𝑜𝑟 1i<jn,there existYij1,,Yiji-1psuch thatκ(bi,bj)=μ(i-1)(λ(b1,Yij1),,λ(bi-1,Yiji-1)).

    Moreover, let 𝐲:pnG(p) be the function defined by

    𝐲(𝐝):=𝐱(a1)d1𝐱(a2)d2𝐱(an)dn.

    Then there exists vectors c1,,cipn such that, for all i=1,,n,

    𝐲(ci)=𝐱(bi).
  3. |det(B)|p is maximal over all B satisfying 2.

Proof.

Let (A,B)𝔘(Δ). Then conditions 1, 2 are satisfied by Lemma 3.7. To see condition 3, note that |det(B)|p=[G():G()Δ], while any matrix B satisfying condition 2 determines a subgroup of G(p)Δ¯ and hence satisfies |det(B)|p[G():G()Δ].

Let (A,B)𝔘p. Let H be the closed subgroup of G(p) generated by 𝐱(ai), where ai are the rows or A, and let Δ be the subgroup in p(G) corresponding to H given by Lemma 3.5. The conditions above ensure (A,B)𝔘(Δ). ∎

Our parametrization of arithmetic lattices gives a nice formula for the commensurability index.

Lemma 3.10.

Let ΔL(G). Then, for any (A,B)U(Δ), we have

c(Δ¯,G(p))=|det(B)2det(A)-1|p-1.

Proof.

A direct application of the results of [6, p. 198] shows

[G(p):G(p)Δ¯]=|det(B)|p-1.

Let C be the matrix whose ith row ci satisfies 𝐲(ci)=𝐱(bi), where 𝐲 is the function defined in Lemma 3.9. Note that CTn(p). Because Δ¯=𝐲(pn), it follows as above from [6, p. 198] that

[Δ¯:G(p)Δ¯]=|det(C)|p-1.

Using the fact that the rows of B are coordinate vectors of a good basis, computation shows that bi=(qi1,,qi(i-1),aiicii,0,,0), where qijp for all j<i and aii and cii are the respective diagonal elements of A and C. It follows that

|det(B)|p-1=|det(AC)|p-1.

The desired result follows. ∎

For n, let ν be the Haar measure on pn normalized so that ν(pn)=1.

Lemma 3.11.

For a matrix MTn(Qp), let f(M):=i=1nm11mii. Let ΔL(G). Then U(Δ) is an open subset of Tn(Qp)×Tn(Zp) and

ν(𝔘(Δ))=(1-p-1)2n|f(A)f(B)|p

for any (A,B)U(Δ).

Proof.

For Δ(G) and a ring R, let R(Δ) be the set of matrices M in Tn(R) with rows m1,,mn such that 𝐱(m1),,𝐱(mn) are a good basis for Δ¯. Notice that 𝔘(Δ)=p(Δ)×p(G()Δ). Hence, that 𝔘(Δ) is an open subset of Tn(p)×Tn(p) is a straightforward application of the first part of the proof of [6, Lemma 2.5, p. 198].

Moreover, the second part of the proof of [6, Lemma 2.5, p. 198] and Fubini’s theorem give

𝔘(Δ)1dν=p(Δ)×p(G()Δ)1dν=p(Δ)p(G()Δ)1dν=pΔ)(1-p-1)n|f(B)|pdν=(1-p-1)2n|f(A)f(B)|p.

Proposition 3.12.

Let f be as in Lemma 3.11. We have

ζG,p(s)=1(1-p-1)2n(A,B)𝔘p|f(A)f(B)|p-1|det(B)2det(A)-1|psdν.

Proof.

By Lemma 3.11, for any (A,B)𝔘(Δ), the integrand evaluates to

ν(𝔘(Δ))-1c(Δ,G())-s.

By decomposing 𝔘p into disjoint open sets,

𝔘p=k=1(Δpk(G)𝔘(Δ)),

using Lemma 3.11, we compute

1(1-p-1)2n𝔘p(|f(A)f(B)|p-1|det(B)2det(A)-1|ps)dν
  =k=1(Δpk(G)(𝔘(Δ)ν(𝔘(Δ))-1c(Δ,G())-sdν))
  =k=1(Δpk(G)(𝔘(Δ)ν(𝔘(Δ))-1p-ksdν))
  =k=1(Δpk(G)p-ks)=k=1𝐜pk((G))pks=ζG,p(s).

We are now ready to prove our main result.

Proof of Theorem 1.3.

We first show that the local commensurability zeta functions converge for sufficiently large s. Given Δpk(G), for any γΔ, we have γpkG(p) so ΔΓk:=(G())p-k. Then, by item 3 of Lemma 3.3, there exists D, depending only on G, such that |Γk:G()|pDk. Hence, any Δpk(G) is a subgroup of Γk of index at most p(1+D)k, giving

(3.2)𝐜pk((G))sp(1+D)k(Γk)sp(1+D)k(N),

where sm(G) is the subgroup growth function (the number of subgroups of index at most m) and N is the free nilpotent group of class and rank equal to that of G(). It follows from [6] that sp(1+D)k(N)pαk for some fixed α that does not depend on p. Hence, inequality (3.2) gives that ζG,p(s) is finite for s>M, where M does not depend on p.

The integrand in Proposition 3.12 and 𝔘p are both Lp-definable in the sense of [11] (see also [2]) by Lemma 3.9. Thus, by [11, Theorem 22], we have that ζG,p(s) is a rational function with numerator and denominator degrees bounded by a constant depending only on G. ∎

4 Parting remarks

At present, we are unable to precisely compute closed forms of the zeta functions for unipotent groups of dimension greater than one. Even the two-dimensional case is too difficult for us. However, we can compute an explicit formula for 𝐜n in the two-dimensional case. Here we work globally over rather than locally as we did in § 3.2.

Consider the case G()=2. Let 𝔙n be the set of pairs of nonnegative matrices

(A,C)=((a11a120a22),(c11c120c22)),

where aij, cij, 0a12<a22 and c12<c22, satisfying the following two properties:

  1. det(C2)det(A)=n,

  2. if DGL2() satisfies DAGL2(), then |det(D)|det(C).

Then 𝐜n((G))=|𝔙n|. The bijection is defined as follows: Suppose ΔG() is a lattice with c(2,Δ)=n. The rows of A give an ordered generating set S for Δ2. The rows of C give the coordinates of a generating set of Δ2 with respect to S.

We can simplify this expression. Define D: to be the denominator of a rational number in reduced form. Eliminating the cij’s gives the formula

𝐜n((G))=|{(a11,a12,a22)03:a12<a22,a11a22(lcm(D(a12/a22),D(a11))D(a22))2=n}|.

We do not have such a simple expression for the Heisenberg group. Computing nice expressions for these examples would, at the very least, give an indication of whether the results in [3, 14] hold for commensurability zeta functions.


Communicated by John S. Wilson


Award Identifier / Grant number: DMS-1405609

Award Identifier / Grant number: DMS-1547292

Funding statement: K. Bou-Rabee supported in part by NSF grant DMS-1405609. D. Studenmund supported in part by NSF grant DMS-1547292.

Acknowledgements

We are grateful to Benson Farb, Tasho Kaletha, Michael Larsen, and Andrew Putman for their conversations and support. In particular, Benson Farb provided helpful comments on an early draft. We are very grateful to an anonymous referee for useful comments and corrections on an earlier draft.

References

[1] N. Avni, S. Lim and E. Nevo, On commensurator growth, Israel J. Math. 188 (2012), 259–279. 10.1007/s11856-011-0122-5Search in Google Scholar

[2] J. Denef, The rationality of the Poincaré series associated to the p-adic points on a variety, Invent. Math. 77 (1984), no. 1, 1–23. 10.1007/BF01389133Search in Google Scholar

[3] M. du Sautoy and F. Grunewald, Analytic properties of zeta functions and subgroup growth, Ann. of Math. (2) 152 (2000), no. 3, 793–833. 10.2307/2661355Search in Google Scholar

[4] M. P. F. du Sautoy, Finitely generated groups, p-adic analytic groups and Poincaré series, Ann. of Math. (2) 137 (1993), no. 3, 639–670. 10.2307/2946534Search in Google Scholar

[5] F. Grunewald and J. O’Halloran, Nilpotent groups and unipotent algebraic groups, J. Pure Appl. Algebra 37 (1985), no. 3, 299–313. 10.1016/0022-4049(85)90103-3Search in Google Scholar

[6] F. J. Grunewald, D. Segal and G. C. Smith, Subgroups of finite index in nilpotent groups, Invent. Math. 93 (1988), no. 1, 185–223. 10.1007/BF01393692Search in Google Scholar

[7] G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 6th ed., Oxford University, Oxford, 2008. 10.1093/oso/9780199219858.001.0001Search in Google Scholar

[8] B. Klopsch, An introduction to compact p-adic Lie groups, Lectures on Profinite Topics in Group Theory, London Math. Soc. Stud. Texts 77, Cambridge University, Cambridge (2011), 7–61. 10.1017/CBO9780511793837.003Search in Google Scholar

[9] E. R. Kolchin, Algebraic matric groups and the Picard–Vessiot theory of homogeneous linear ordinary differential equations, Ann. of Math. (2) 49 (1948), 1–42. 10.2307/1969111Search in Google Scholar

[10] A. Lubotzky and D. Segal, Subgroup Growth, Progr. Math. 212, Birkhäuser, Basel, 2003. 10.1007/978-3-0348-8965-0Search in Google Scholar

[11] A. Macintyre, Rationality of p-adic Poincaré series: uniformity in p, Ann. Pure Appl. Logic 49 (1990), no. 1, 31–74. 10.1016/0168-0072(90)90050-CSearch in Google Scholar

[12] A. I. Mal’cev, The Metamathematics of Algebraic Systems. Collected Papers: 1936–1967, Stud. Logic Found. Math. 66, North-Holland, Amsterdam, 1971. Search in Google Scholar

[13] D. Segal, Polycyclic Groups, Cambridge Tracts in Math. 82, Cambridge University, Cambridge, 1983. 10.1017/CBO9780511565953Search in Google Scholar

[14] C. Voll, Functional equations for zeta functions of groups and rings, Ann. of Math. (2) 172 (2010), no. 2, 1181–1218. 10.4007/annals.2010.172.1181Search in Google Scholar

[15] C. Voll, A newcomer’s guide to zeta functions of groups and rings, Lectures on Profinite Topics in Group Theory, London Math. Soc. Stud. Texts 77, Cambridge University, Cambridge (2011), 99–144. 10.1017/CBO9780511793837.005Search in Google Scholar

[16] J. S. Wilson, Profinite Groups, London Math. Soc. Monogr. (N. S.) 19, Oxford University, New York, 1998. 10.1093/oso/9780198500827.001.0001Search in Google Scholar

Received: 2019-08-08
Revised: 2019-10-01
Published Online: 2019-11-08
Published in Print: 2020-03-01

© 2020 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 28.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jgth-2019-0112/html
Scroll to top button