Groups Acting on Trees
With Prescribed Local Action
Abstract.
We extend Burger–Mozes theory of closed, non-discrete, locally quasiprimitive automorphism groups of locally finite, connected graphs to the semiprimitive case, and develop a generalization of Burger–Mozes universal groups acting on the regular tree of degree . Three applications are given: First, we characterize the automorphism types which the quasi-center of a non-discrete subgroup of may feature in terms of the group’s local action. In doing so, we explicitly construct closed, non-discrete, compactly generated subgroups of with non-trivial quasi-center, and see that Burger–Mozes theory does not extend further to the transitive case. We then characterize the -closures of locally transitive subgroups of containing an involutive inversion, and thereby partially answer two questions by Banks–Elder–Willis. Finally, we offer a new view on the Weiss conjecture.
Introduction
In the structure theory of locally compact (l.c.) groups, totally disconnected (t.d.) ones are in the focus because any locally compact group is an extension of its connected component by the totally disconnected quotient ,
and connected l.c. groups have been identified as inverse limits of Lie groups in seminal work by Gleason [Gle52], Montgomery-Zippin [MZ52] and Yamabe [Yam53].
Every t.d.l.c. group can be viewed as a directed union of compactly generated open subgroups. Among the latter, groups acting on regular graphs and trees stand out due to the Cayley-Abels graph construction: Every compactly generated t.d.l.c. group acts vertex-transitively on a connected regular graph of finite degree with compact kernel . In particular, the universal cover of is the -regular tree and we obtain a cocompact subgroup of its automorphism group ,
as an extension of by , see [Mon01, Section 11.3] and [KM08] for details.
In studying the automorphism group of a locally finite, connected graph , we follow the notation of Serre [Ser03]. The group is t.d.l.c. when equipped with the permutation topology for its action on , see Section 1.1. Given a subgroup and a vertex , the stabilizer of in induces a permutation group on the set of edges issuing from . We say that is locally “X” if for every said permutation group satisfies property “X”, e.g. being transitive, semiprimitive or quasiprimitive.
In [BM00], Burger–Mozes develop a remarkable structure theory of closed, non-discrete, locally quasiprimitive subgroups of , which resembles the theory of semisimple Lie groups, see Theorem 1.2. In Section 2, specifically Theorem 2.14, we show that this theory readily carries over to the semiprimitive case.
Let be a set of cardinality and let be the -regular tree. Burger–Mozes complement their structure theory with a particularly accessible class of subgroups of with prescribed local action: Given , their universal group is closed in , vertex-transitive, compactly generated and locally permutation isomorphic to . It is discrete if and only if is semiregular. When is transitive, is maximal up to conjugation among vertex-transitive subgroups of that are locally permutation isomorphic to , hence universal.
We generalize the universal groups by prescribing the local action on balls of a given radius , the Burger–Mozes construction corresponding to the case . Equip with a labelling, i.e. a map such that for every the map is a bijection, and for all . Also, fix a tree which is isomorphic to a ball of radius around a vertex in the labelled tree and let () be the unique label-respecting isomorphism. Then
captures the -local action of at the vertex .
Definition 3.1.
Let . Define
While is always closed, vertex-transitive and compactly generated, other properties of need not carry over. Foremost, the group need not be locally action isomorphic to ; we say that satisfies condition (C) if it is. This can be viewed as an interchangeability condition on neighbouring local actions, see Section 3.4. There also is a discreteness condition (D) on in terms of certain stabilizers in under which is discrete, see Section 3.2.2. Finally, the groups are universal in a sense akin to the above by Theorem 3.34.
For , let denote its projection to , which is naturally permutation isomorphic to via the labelling of . The following rigidity theorem is inspired by [BM00, Proposition 3.3.1].
Theorem 3.32.
Let be -transitive and simple non-abelian. Further, let with satisfy (C). Then equals either
Here, the groups of Section 3.4 satisfy both (C) and (D) and therefore yield discrete universal groups. Illustrating the necessity of the assumptions in Theorem 3.32, we construct further universal groups in the case when either point stabilizers in are not simple, is not primitive, or is not perfect, see e.g. in Section 3.4.
In Section 4, we present three applications of the framework of universal groups. First, we study the quasi-center of subgroups of . The quasi-center of a topological group consists of those elements whose centralizer in is open. It plays a major role in the Burger–Mozes Structure Theorem 1.2: A non-discrete, locally quasiprimitive subgroup of does not feature any non-trivial quasi-central elliptic elements. We complete this fact to the following local-to-global-type characterization of the automorphism types which the quasi-center of a non-discrete subgroup of may feature in terms of the group’s local action.
Theorem 4.1.
Let be non-discrete. If is locally
-
(i)
transitive then contains no inversion.
-
(ii)
semiprimitive then contains no non-trivial edge-fixating element.
-
(iii)
quasiprimitive then contains no non-trivial elliptic element.
-
(iv)
-transitive then contains no hyperbolic element of length .
More importantly, the proof of the above theorem suggests to use groups of the form for appropriate local actions in order to explicitly construct non-discrete subgroups of whose quasi-centers contain certain types of automorphisms. This leads to the following sharpness result.
Theorem 4.2.
There is and a closed, non-discrete, compactly generated subgroup of which is locally
-
(i)
intransitive and contains a quasi-central inversion.
-
(ii)
transitive and contains a non-trivial quasi-central edge-fixating element.
-
(iii)
semiprimitive and contains a non-trivial quasi-central elliptic element.
-
(iv)
-
(a)
intransitive and contains a quasi-central hyperbolic element of length .
-
(b)
quasiprimitive and contains a quasi-central hyperbolic element of length .
-
(a)
Part (ii) of this theorem can be strengthened to the following result which shows that Burger–Mozes theory does not extend further to locally transitive groups.
Theorem 4.4.
There is and a closed, non-discrete, compactly generated, locally transitive subgroup of with open, hence non-discrete, quasi-center.
We also give an algebraic characterization of the -closures of locally transitive subgroups of which contain an involutive inversion, and thereby partially answer two questions by Banks–Elder–Willis [BEW15, p. 259]. Recall (Section 1.2) that the -closure111The -closure was introduced in [BEW15] and called -closure; however the term -closure has an established meaning for permutation groups due to Wielandt, so we use -closure here. of a subgroup is given by
Theorem 4.31.
Let be locally transitive and contain an involutive inversion. Then for some labelling of and .
Combined with the independence properties (Section 1.2), introduced by Banks–Elder–Willis [BEW15] as generalizations of Tits’ Independence Property, Theorem 4.31 entails the following characterization of universal groups.
Corollary 4.32.
Let be closed, locally transitive and contain an involutive inversion. Then if and only if satisfies Property .
Banks–Elder–Willis use subgroups of with pairwise distinct -closures to construct infinitely many, pairwise non-conjugate, non-discrete simple subgroups of via Theorem 1.1 and ask whether they are also pairwise non-isomorphic as topological groups. We partially answer this question in the following theorem.
Theorem 4.34.
Let be non-discrete, locally permutation isomorphic to and contain an involutive inversion. Suppose that is transitive and that every non-trivial subnormal subgroup of is transitive on . If for some then and are non-isomorphic.
Infinitely many families of pairwise non-isomorphic simple groups of this type, each sharing a certain transitive local action, are constructed in Example 4.37.
Finally, Section 4.3 offers a new view on the Weiss conjecture [Wei78] which states that there are only finitely many conjugacy classes of discrete, locally primitive and vertex-transitive subgroups of for a given . This conjecture was extended by Potočnik–Spiga–Verret in [PSV12] to semiprimitive local actions and impressive partial results have been obtained by the same authors as well as Giudici–Morgan [GM14]. We show that under the additional assumption that each group contains an involutive inversion, it suffices to show that for every semiprimitive there are only finitely many with that satisfy conditions (C) and (D) in a minimal fashion, see Definition 4.42.
Acknowledgements
The author is indebted to Marc Burger and George Willis for their support and the suggestion to define generalized universal groups. Thanks are also due to Luke Morgan and Michael Giudici for sharing their insight on permutation groups, and Michael Giudici, for providing a proof of Lemma 3.29. Two anonymous referees’ comments were also much appreciated.
A good part of this research was carried out during visits to The University of Newcastle, Australia, for the hospitality of which the author is thankful. Finally, part of this research was supported by the SNSF Doc.Mobility fellowship 172120 as well as the ARC grants DP120100996, FL170100032 and DE210100180.
1. Preliminaries
This section collects preliminaries on permutation groups, graph theory and Burger–Mozes theory. References are given in the respective subsection.
1.1. Permutation Groups
Let be a set. In this section, we collect definitions and results concerning the group of bijections of . Refer to [DM96], [Pra97], [GM18] and [KM08, Section 1.2] for details beyond the following.
Let . The degree of is . For , the stabilizer of in is . The subgroup of generated by its point stabilizers is denoted by . The permutation group is semiregular, or free, if for all ; equivalently, if is trivial. It is transitive if its action on is transitive, and regular if it is both semiregular and transitive.
Let be transitive. The rank of is the number of orbits of the diagonal action of on . Equivalently, for all . Note that the diagonal is always an orbit of the diagonal action . The permutation group is -transitive if it acts transitively on . In other words, .
We now define several classes of permutation groups lying in between the classes of transitive and -transitive permutation groups. Let . A partition of is preserved by , or -invariant, if for all we have . The partitions and are trivial. A map is constant with respect to if whenever for some . The permutation group is primitive if it is transitive and preserves no non-trivial partition of . Equivalently, is transitive and its point stabilizers are maximal subgroups. Given a normal subgroup of , the partition of into -orbits is -invariant. Consequently, every non-trivial normal subgroup of a primitive group is transitive. The permutation group is quasiprimitive if it is transitive and all its non-trivial normal subgroups are transitive. Finally, is semiprimitive if it is transitive and all its normal subgroups are either transitive or semiregular. The following implications among the above properties follow from the definitions. We list examples illustrating that each implication is strict.
Note that is simple and that is a non-maximal subgroup of .
Permutation Topology
Let be a set and . The basic open sets of the permutation topology on are , where and . This turns into a Hausdorff, t.d. group and makes the action map continuous for the discrete topology on . The group is discrete if and only if the stabilizer in of a finite subset of is trivial. It is compact if and only if it is closed and all its orbits are finite. Finally, is second-countable if and only if is countable.
1.2. Graph Theory
We first recall Serre’s [Ser03] notation and definitions in the context of graphs and trees, and then collect generalities about automorphisms of trees. We conclude with an important simplicity criterion.
Definitions and Notation
A graph is a tuple consisting of a vertex set and an edge set , together with a fixed-point-free involution of , denoted by , and maps , providing the origin and terminus of an edge, such that and for all . Given , the pair is a geometric edge. For , we let be the set of edges issuing from . The valency of is . A vertex of valency is a leaf. A morphism between graphs and is a pair of maps and preserving the graph structure, i.e. and for all .
For , let denote the graph with vertex set and edge set . A path of length in a graph is a morphism from to . It can be identified with , where for . In this case, is a path from to .
Similarly, let and be the graphs with vertex sets and , and edge sets and respectively. A half-infinite path, or ray, in a graph is a morphism from to . It can be identified with where for . In this case, originates at, or issues from, . An infinite path, or line, in a graph is a morphism from to . A pair of edges in a path is a backtracking. A graph is connected if any two of its vertices can be joined by a path. The maximal connected subgraphs of a graph are its connected components.
A forest is a graph in which there are no non-backtracking paths with . Consequently, a morphism of forests is determined by the underlying vertex map. In particular, a path of length in a forest is determined by the images of the vertices of .
A tree is a connected forest. As a consequence of the above, the vertex set of a tree admits a natural metric: Given , define as the minimal length of a path from to . A tree in which every vertex has valency is -regular. It is unique up to isomorphism and denoted by .
Let be a tree. For , the subtree spanned by is the unique minimal subtree of containing . For and , the subtree spanned by is the ball of radius around , denoted by . Similarly, is the sphere of radius around , and . For a subtree , let denote the closest point projection, i.e. whenever . In the case of an edge , the half-trees and are the subtrees spanned by and respectively.
Two non-backtracking rays in are equivalent, , if there exist such that for all . The boundary, or set of ends, of is the set of equivalence classes of non-backtracking rays in .
Automorphism Groups of Graphs
Let be a graph. We equipt the group of automorphims of with the permutation topology for its action on .
Notation
Let . Given a subgraph , the pointwise stabilizer of in is denoted by . Similary, the setwise stabilizer of in is denoted by . In the case where is a single vertex , the permutation group that induces on is denoted by . Given a property “X” of permutation groups, the group is locally “X” if for every the permutation group has “X”; with the exception that is locally -transitive if acts transitively on the set of non-backtracking paths of length issuing from . It is locally -transitive if it is locally -transitive for all .
Let and the -regular tree. Then acts on by . Given , the stabilizer of in is .
We let denote the subgroup of generated by vertex-stabilizers and the subgroup generated by edge-stabilizers. For a subtree and , let denote the subtree of spanned by . We set . Then and
Classification of Automorphisms
Automorphisms of can be distinguished into three distinct types. Refer to [GGT18, Section 6.2.2] for details.
For , set and . If then fixes a vertex. An automorphism of this kind is elliptic. Suppose now that . If is infinite then is hyperbolic. Geometrically, it is a translation of length along the line in defined by . If is finite then and maps some edge to , and is termed an inversion.
Independence and Simplicity
The base case of the simplicity criterion presented below is due to Tits [Tit70] and applies to sufficiently rich subgroups of . The generalized version is due to Banks–Elder–Willis [BEW15], see also [GGT18].
Let denote a path in (finite, half-infinite or infinite). For every and , the pointwise stabilizer of induces an action on , the subtree spanned by those vertices of whose closest vertex in is . We therefore obtain an injective homomorphism
A subgroup satisfies Property if is an isomorphism for every path in . If is closed, it suffices to check the above properties in the case where is a single edge. For example, given a closed subgroup , Property is satisfied by its -closure
Theorem 1.1 ([BEW15, Theorem 7.3]).
Let . Suppose neither fixes an end nor stabilizes a proper subtree of setwise, and that satisfies Property . Then the group is either trivial or simple.
Burger–Mozes Theory
In [BM00], Burger–Mozes develop a structure theory of certain locally quasiprimitive automorphism groups of graphs which resembles the theory of semisimple Lie groups. Their fundamental definitions are meaningful in the setting of t.d.l.c. groups. Let be a t.d.l.c. group. Define
alternatively the intersection of all open finite-index subgroups of , and
the quasi-center of . Both and are topologically characteristic subgroups of , i.e. they are preserved by continuous automorphisms of . Whereas is closed, the quasi-center need not be so.
Whereas for a general t.d.l.c. group nothing much can be said about the size of and , Burger–Mozes show that good control can be obtained in the case of certain locally quasiprimitive automorphism groups of graphs. The following result summarizes their structure theory. It is a combination of Proposition 1.2.1, Corollary 1.5.1, Theorem 1.7.1 and Corollary 1.7.2 in [BM00].
Theorem 1.2.
Let be a locally finite, connected graph. Further, let be closed, non-discrete and locally quasiprimitive. Then
-
(i)
is minimal closed normal cocompact in ,
-
(ii)
is maximal discrete normal, and non-cocompact in , and
-
(iii)
admits minimal, non-trivial closed normal subgroups; finite in number, -conjugate and topologically simple.
If is a tree, and, in addition, is locally primitive then
-
(iv)
is a direct product of topologically simple groups.
Burger–Mozes Universal Groups
The first introduction of Burger–Mozes universal groups in [BM00, Section 3.2] was expanded in the introductory article [GGT18], which we follow closely. Most results are generalized in Section 3.
Let be a set of cardinality and let denote the -regular tree. A labelling of is a map such that for every the map is a bijection, and for all . The local action of an automorphism at a vertex is defined via
Definition 1.3.
Let and a labelling of . Define
The map satisfies a cocycle identity: For all and we have . As a consequence, is a subgroup of .
Passing to a different labelling amounts to passing to a conjugate of inside . We therefore omit the reference to an explicit labelling from here on.
The following proposition collects several basic properties of Burger–Mozes groups. We refer the reader to [GGT18, Section 6.4] for proofs.
Proposition 1.4.
Let . The group is
-
(i)
closed in ,
-
(ii)
vertex-transitive,
-
(iii)
compactly generated,
-
(iv)
locally permutation isomorphic to ,
-
(v)
edge-transitive if and only if is transitive, and
-
(vi)
discrete if and only if is semiregular.
Part iii of Proposition 1.4 relies on the following result which we include for future reference. Given and , let denote the unique label-respecting inversion of the edge with and .
Lemma 1.5.
Let . Then .
Proof.
Every element of is determined by its image on . Hence it suffices to show that is vertex-transitive and has the asserted structure. Indeed, let , and let be the labels of the shortest path from to . Then maps to as every is label-respecting. Setting we have for all distinct . Hence the assertion follows from the ping-pong lemma. ∎
The name universal group is due to the following maximality statement. Its proof, see [BM00, Proposition 3.2.2], should be compared with the proof of Theorem 3.34.
Proposition 1.6.
Let be locally transitive and vertex-transitive. Then there is a labelling of such that where is action isomorphic to the local action of .
2. Structure Theory of locally semiprimitive groups
We generalize the Burger–Mozes theory of locally quasiprimitive automorphism groups of graphs to the semiprimitive case. While this adjustment of Sections 1.1 to 1.5 in [BM00] is straightforward and has been initiated in [Tor18, Section II.7] and [CB19, Section 6.2] we provide a full account for the reader’s convenience.
2.1. General Facts
Let be a connected graph. We first collect a few general facts about several classes of subgroups of for future reference.
Lemma 2.1.
Let be locally transitive. Then is geometric edge transitive and of index at most in .
Proof.
Since is locally transitive, so is given that for all . Hence it is geometric edge transitive. In particular it has at most two vertex orbits which implies the second assertion. ∎
Lemma 2.2.
Let and let be a connected subgraph of . Suppose is such that for every and there is such that . Then satisfies .
Proof.
By assumption, . Now suppose for some . Let . Pick such that . Since induces a bijection between and we conclude that . ∎
Assume from now on that is a locally finite, connected graph.
Lemma 2.3.
Let . If is finite then there is a finitely generated subgroup such that is finite.
Proof.
Let be a connected subgraph which projects onto . For every and , pick such that . Then satisfies the conclusion by Lemma 2.2. ∎
Lemma 2.4.
Let . If is finite then is discrete.
Proof.
Let be finite such that and , which is open in . Given that and commute, acts trivially on . Hence and is discrete. ∎
Lemma 2.5.
Let . If is finite and is discrete then is discrete.
Proof.
Lemma 2.6.
Let be non-discrete. Then is infinite.
Proof.
Lemma 2.7.
Let be discrete. If is finite then is discrete.
Proof.
Apply Lemma 2.5 to and . ∎
2.2. Normal Subgroups
Let denote a locally finite, connected graph. For closed subgroups of we define
the set of closed normal subgroups of which contain and do not act freely on . The set is partially ordered by inclusion. We let denote the set of minimal elements in .
Lemma 2.8.
Let be a locally finite, connected graph and . If is finite and does not act freely on then .
Proof.
We argue using Zorn’s Lemma. First note that is non-empty as it contains . Let be a chain. Pick a finite set of representatives of . For every , the set is non-empty. Since is finite and is a chain it follows that is non-empty, i.e. there exists such that is non-trivial for every . As before, we conclude that is non-trivial. Now, for and , the set is a non-empty compact subset of , and since is a chain every finite subset of has non-empty intersection. Hence is non-empty and therefore is a closed normal subgroup of containing that does not act freely on . Overall, . ∎
The following lemma is contained in the author’s PhD thesis [Tor18, Section II.7] and, independently, in Caprace-Le Boudec [CB19, Section 6.2].
Lemma 2.9.
Let be a locally finite, connected graph. Further, let be locally semiprimitive and . Define
-
,
-
.
Then one of the following holds.
-
(i)
and acts freely on .
-
(ii)
and is geometric edge transitive.
-
(iii)
is an -invariant partition of and is a fundamental domain for the action of on for any .
Proof.
Since is locally semiprimitive and is normal in , we have . If does not act freely on then there is an edge with and an -fixed vertex for which is not semiregular, hence transitive. That is, . Now, either in which case is locally transitive and we are in case ii, or . Being locally transitive, acts transitively on the set of geometric edges and therefore has at most two vertex orbits. Given that both and are non-empty and -invariant, they constitute exactly said orbits. Since any pair of adjacent vertices is a fundamental domain for the -action on , we conclude that if then . Thus every leaf of is in and we are in case (iii) by Lemma 2.2. ∎
2.3. The Subquotient
In this section, we achieve control over and as well as the normal subgroups of in the semiprimitive case. We then describe the structure of the subquotient . First, recall the following lemma from topological group theory.
Lemma 2.10.
Let be a topological group. If is discrete then .
Proof.
For , the map , is well-defined because , and continuous. Hence there is an open set containing and such that , i.e. . ∎
Proposition 2.11.
Let be a locally finite, connected graph. Further, let be closed, non-discrete and locally semiprimitive. Then
-
(i)
is compact,
-
(ii)
acts freely on , and is discrete non-cocompact in ,
-
(iii)
for any closed normal subgroup , either is non-discrete cocompact and , or is discrete and ,
-
(iv)
acts freely on without inversions,
-
(v)
for any open normal subgroup we have , and
-
(vi)
is topologically perfect, i.e. .
Proof.
For i, let be closed and cocompact. Since is non-discrete, so is in view of Lemma 2.7. Hence . Conversely, if then is cocompact in by Lemma 2.9. We conclude that . This intersection is in fact given by a single minimal element of : Using Lemma 2.8, pick , and let . Suppose . Because is minimal, acts freely on . In particular, is discrete. Since both and are normal in , we also have and hence and are discrete by Lemma 2.5. Then so is by Lemma 2.7. Overall, and assertion now follows from Lemma 2.9.
As to ii, the group is non-cocompact by Lemma 2.6 and therefore acts freely on by Lemma 2.9. In particular, it is discrete.
For iii, let be a closed normal subgroup. If acts freely on , then is discrete and hence contained in by Lemma 2.10. If does not act freely on then is cocompact in by Lemma 2.9 and therefore contains .
Concerning iv the inclusion is automatic. Further, is normal in because it is topologically characteristic in . Therefore, if , then is non-discrete by part iii and does not act freely on . Then is finite by Lemma 2.9, contradicting Lemma 2.6 applied to which is non-discrete because is. Consequently, which proves the assertion.
For part v, note that is non-empty by Lemma 2.8 as is cocompact in by part i and non-discrete by part iii. Further, since acts freely on , every is non-discrete by part iii as well. Given an open subgroup and , the group is normal in and non-discrete. In particular, does not act freely on and hence . Thus contains the subgroup of generated by the elements of , which is closed, normal and non-discrete. Hence .
Proposition 2.12.
Let be a locally finite, connected graph. Further, let be a closed, non-discrete and locally semiprimitive. Finally, let such that . Then the following hold.
-
(i)
-
(a)
The group acts transitively on .
-
(b)
The set is finite and non-empty.
-
(a)
-
(ii)
Let
-
(a)
The group is topologically perfect.
-
(b)
The group acts freely on and .
-
(c)
The group is topologically simple.
-
(a)
-
(iii)
For every there is with .
Proof.
Since every discrete normal subgroup of is contained in by Lemma 2.10 iii and the latter acts freely on by Proposition 2.11 iii, every element of is non-discrete. We proceed with a number of claims.
In the following, given , we let denote the subgroup of generated by .
-
(2)
The group acts transitively on .
Let be an orbit for the action of on , and suppose there is an element . For every , the subgroup is normal in and acts freely on by minimality of , hence is discrete. The same therefore holds for . Thus . As is discrete by Proposition 2.11 and therefore closed in we conclude . On the other hand, is normal in since is an -orbit. It is also closed in , and non-discrete by the above. Thus by Proposition 2.11 iii, and which contradicts part 1. - (3)
-
(4)
For every there is with .
Let . Then as above. On the other hand, for , the group is closed, non-discrete and normal in , thus . Using 1, we conclude that which proves the assertion. - (5)
-
(6)
The set is finite and non-empty.
The set is non-empty by Lemma 2.8. Let , where the union is taken over all finite subsets of the set . Then is non-discrete and normal in . Hence by Proposition 2.11 iii. Since is second-countable and locally compact, it is metrizable. Hence is a separable metric space and the same holds for . Let be a countable dense subgroup, and fix an exhaustion of by finite sets. Let be an increasing sequence of finite subsets of such that . In particularwhich by 5 and 1 implies . Thus is countable. Next, fix . Then is closed and of countable index in , and thus has non-empty interior as is a Baire space. Hence is open in . Given that contains we conclude that is of finite index in using Proposition 2.11 i. Since acts transitively by on by 2 we conclude that is finite by the orbit-stabilizer theorem.
The above claims yield parts iia, iib, iiiia and iii of Proposition 2.12. We now turn to parts iiiib and iiiic.
-
iiiib
Using part 6, let and define
Note that since is characteristic in , which is normal in , the quasi-centers in the above definition normalize each other, so is a group. It is then normal in . If does not act freely on then is finite by Lemma 2.9 and there exist by Lemma 2.3 such that for the quotient is finite. For every , write where and . Let be an open subgroup such that for all . Since , there is an open subgroup such that for all . Hence is contained in which by Lemma 2.4 implies that and hence is discrete, a contradiction. Thus acts freely on , is discrete and therefore . That is, . The opposite inclusion follows from the definitions.
-
iiiic
Let and a closed subgroup containing . For every with we have
This implies , i.e. normalizes . Since , this implies and hence, by minimality of , we have either or acts freely on and . ∎
Corollary 2.13.
Let be a locally finite, connected graph. Further, let be closed, non-discrete and locally semiprimitive. Minimal, non-trivial closed normal subgroups of exist. They are all -conjugate, finite in number and topologically simple.
Proof.
Apply Proposition 2.12 to . ∎
We summarize the previous results in the following theorem, which is a verbatim copy of Burger–Mozes’ Theorem 1.2, except that the local action need only be semiprimitive, not quasiprimitive.
Theorem 2.14.
Let be a locally finite, connected graph. Further, let be closed, non-discrete and locally semiprimitive. Then
-
(i)
is minimal closed normal cocompact in ,
-
(ii)
is maximal discrete normal, and non-cocompact in , and
-
(iii)
admits minimal, non-trivial closed normal subgroups; finite in number, -conjugate and topologically simple.
If is a tree, and, in addition, is locally primitive then
-
(iv)
is a direct product of topologically simple groups.
Proof.
Parts i and ii stem from parts i, ii and iii of Proposition 2.11 in combination with Section 1. For part iii, use part iv of Proposition 2.11 and Corollary 2.13. Finally, part iv is Corollary 1.7.2 in [BM00]. It follows from Theorem 1.7.1 in [BM00] as the commutator of any two distinct elements in is contained in . ∎
3. Universal Groups
In this section, we develop a generalization of Burger–Mozes universal groups that arises through prescribing the local action on balls of a given radius around vertices. The Burger–Mozes construction corresponds to the case .
Whereas many properties of the original construction carry over to the new setup, others require adjustments. Notably, there are compatibility and discreteness conditions on the local action under which the associated universal group is locally action isomorphic to and discrete respectively.
We then exhibit examples and (non)-rigidity phenomena of our construction. Finally, a universality statement holds under an additional assumption.
3.1. Definition and Basic Properties
3.1.1. Definition
Let be a set of cardinality and let denote the -regular tree. A labelling of is a map such that for every the map is a bijection, and for all .
For every , fix a tree which is isomorphic to a ball of radius around a vertex in . Let denote its center and carry over the labelling of to via the chosen isomorphism. Then for every there is a unique, label-respecting isomorphism . We define the -local action of an automorphism at a vertex via
Definition 3.1.
Let and be a labelling of . Define
The following lemma states that the maps satisfy a cocycle identity which implies that is a subgroup of for every .
Lemma 3.2.
Let and . Then .
Proof.
We compute
3.1.2. Basic Properties
Note that the group of Definition 3.1 coincides with the Burger–Mozes universal group introduced in [BM00, Section 3.2] under the natural isomorphism . Several basic properties of the latter group carry over to the generalized setup. First of all, passing between different labellings of amounts to conjugating in . Subsequently, we shall therefore omit the reference to an explicit labelling.
Lemma 3.3.
For every quadruple of labellings of and vertices , there is a unique automorphism with and .
Proof.
Set . Now assume inductively that is uniquely determined on and let . Then is also uniquely determined on by the requirement , namely . ∎
Proposition 3.4.
Let . Further, let and be labellings of . Then the groups and are conjugate in .
Proof.
Choose . Let denote the automorphism of associated to by Lemma 3.3, then . ∎
The following basic properties of are as in Proposition 1.4.
Proposition 3.5.
Let . The group is
-
(i)
closed in ,
-
(ii)
vertex-transitive, and
-
(iii)
compactly generated.
Proof.
As to (i), note that if then for some . In this case, the open neighbourhood of in is also contained in the complement of .
For (ii), let and let be the automorphism of associated to by Lemma 3.3. Then as for all .
To prove (iii), fix . We show that is generated by the join of the compact set and the finite generating set of guaranteed by Lemma 1.5: Indeed, for pick in the finitely generated, vertex-transitive subgroup of such that . We then have and the assertion follows. ∎
For completeness, we explicitly state the following.
Proposition 3.6.
Let . Then is a compactly generated, totally disconnected, locally compact, second countable group.
Proof.
The group is totally disconnected, locally compact, second countable as a closed subgroup of and compactly generated by Proposition 3.5. ∎
Finally, we record that the groups are -closed.
Proposition 3.7.
Let . Then satisfies Property .
Proof.
Let . Clearly, . Conversely, consider and define and by
respectively. Then , and . ∎
3.2. Compatibility and Discreteness
We now generalize parts iv and vi of Burger–Mozes’ Proposition 1.4. There are compatibility and discreteness conditions (C) and (D) on subgroups that hold if and only if the associated universal group is locally action isomorphic to and discrete respectively.
We introduce the following notation for vertices in the labelled tree : Given and , set where
is the unique label-respecting morphism sending to . If is the empty word, set . Whenever admissible, we also adopt this notation in the case of and its labelling. In particular, is in natural bijection with the set .
3.2.1. Compatibility
First, we ask whether locally acts like , that is whether the actions and are isomorphic for every . Whereas this always holds for by Proposition 1.4iv it need not be true for , the issue being (non)-compatibility among elements of . See Example 3.9. The condition developed in this section allows for computations. A more practical version from a theoretical viewpoint follows in Section 3.4.
Now, let and suppose that realizes at , that is
Then given the condition that be in for all , we obtain the following necessary compatibility condition on for to act like at :
where . Set . Then the above condition can be rewritten as
Now observe the following: First, depends only on . Second, the subtree of does not depend on . Third, is the unique non-trivial, involutive and label-respecting automorphism of ; it is given by
for admissible words . Hence the above condition may be rewritten as
(C) |
In this situation we shall say that is compatible with in direction .
Proposition 3.8.
Let . Then is locally action isomorphic to if and only if satisfies (C).
Proof.
By the above, condition (C) is necessary. To show that it is also sufficient, let and . We aim to define an automorphism which realizes at . This forces us to define
Now, assume inductively that is defined consistently on in the sense that for all with . In order to extend to , let and let be the unique label such that . Set . Applying condition (C) to the pair yields an element such that
where and we have realized
Now extend consistently to by setting . ∎
Example 3.9.
Let and be the element which swaps the leaves and of . Then does not contain an element compatible with in direction and hence does not satisfy condition (C).
We show that it suffices to check condition (C) on the elements of a generating set. Let and . Set . Then
(M) |
Let denote the compatibility set of elements in which are compatible with in direction . Then (M) shows that . It therefore suffices to check condition (C) on a generating set of .
Given , we also define , the set of elements in which are compatible with in all directions from . We omit in this notation when it is clear from the context.
As a consequence, we obtain the following description of the local action of when does not satisfy condition (C).
Proposition 3.10.
Let . Then has a unique maximal subgroup which satisfies (C). We have and .
3.2.2. Discreteness
The group also determines whether or not is discrete. In fact, the following proposition generalizes Proposition 1.4vi.
Proposition 3.12.
Alternatively, is discrete if and only if satisfies (D). Example 3.9 shows that condition (C) is necessary for the second part of Proposition 3.12.
Finally, note that satisfies (D) if and only if for all .
Proof.
(Proposition 3.12). Fix . A subgroup is non-discrete if and only if for every there is such that .
Suppose that is non-discrete. Then there are and such that and . Hence there is with . In particular, where is the label of the unique edge with and .
We define condition (CD) on as the conjunction of (C) and (D). The following description is immediate from the above.
(CD) |
When satisfies (CD), an element of is determined by its action on . Hence for every and for every with . Furthermore, admits a unique involutive compatibility cocycle, i.e. a map which for all and satisfies
-
(i)
(compatibility) ,
-
(ii)
(cocycle) , and
-
(iii)
(involutive) .
Note that restricts to an automorphism of of order at most .
3.3. Group Structure
For , let denote the projection of onto . As an illustration, we record that the group structure of is particularly clear when is regular.
Proposition 3.13.
Let satisfy (C). Suppose is regular. Then .
Proof.
Fix . Since is transitive, the group is generated by and an involution inverting an edge with origin . Given , regularity of implies that for all . Now, the subgroups and of generate a free product within by the ping-pong lemma: Put and . Any non-trivial element of maps into as , and maps into . ∎
More generally, Bass-Serre theory [Ser03] identifies the universal groups as amalgamated free products, taking into account that acts with inversions.
Proposition 3.14.
Corollary 3.15.
Let satisfy (CD). If there are and an isomorphism such that , then . ∎
Note that Corollary 3.15 applies to conjugate subgroups of which satisfy (CD). The following example shows that the assumption that both and in Corollary 3.15 satisfy (CD) is indeed necessary.
Example 3.16.
Let and be the element which swaps the leaves and of . Using the notation of Section 3.4.1, consider the group which satisfies (C). In particular, by Proposition 3.13. On the other hand, set . Then while for a non-trivial element of , we have for some . Therefore, is isomorphic to by Lemma 1.5. In particular, and are not isomorphic.
Conversely, the following Proposition based on [Rad17, Appendix A], which states that in certain cases the tree can be recovered from the topological group structure of a subgroup of , applies to appropriate universal groups.
Proposition 3.17.
Let be closed and locally transitive with distinct point stabilizers. Then and are isomorphic topological groups if and only if they are conjugate in .
Proof.
By [FTN91], every compact subgroup of is either contained in a vertex stabilizer or, in case , in a geometric edge stabilizer . Since is locally transitive, the above are pairwise distinct.
The vertex stabilizers are precisely those maximal compact subgroups for which there is no maximal compact subgroup with : Indeed, for and we have whereas for all distinct and by the orbit-stabilizer theorem because and is locally transitive.
Adjacency can be expressed in terms of indices as well: Let be distinct. Then if and only if for all : Indeed, if , then by the orbit-stabilizer theorem given that is locally transitive. If is not adjacent to then because point stabilizers of every local action of are distinct.
Now, let be an isomorphism of topological groups. Then induces a bijection between the maximal compact subgroups of and , and preserves indices. Hence there is an automorphism such that for all . Furthermore, since vertex stabilizers in are pairwise distinct and
for all we have for all . ∎
The following Corollary uses the notation from Section 3.4.2.
Corollary 3.18.
Let and satisfy (C). Assume and are transitive with distinct point stabilizers. If and are isomorphic topological groups then are conjugate.
Proof.
By Proposition 3.17, the groups and are conjugate in , hence so are and for every and the assertion follows. ∎
Example 3.19.
Section 3.4.1 introduces the isomorphic, non-conjugate subgroups and of , both of which project onto and satisfy (C) but not (D). An explicit isomorphism satisfies the assumption of Corollary 3.15. However, by Corollary 3.18 the universal groups and are non-isomorphic. Therefore, Corollary 3.15 does not generalize to the non-discrete case.
Question 3.20.
Let satisfy (C) and be conjugate. Are the associated universal groups and necessarily isomorphic?
In the following, we determine the Burger–Mozes subquotient of Theorem 2.14 for non-discrete, locally semiprimitive universal groups.
Proof.
If satisfies (D) then is discrete and hence . Conversely, if satisfies (C) but not (D) then the stabilizer of any half-tree in is non-trivial: We have for some edge . Since is non-discrete by Proposition 3.12 and has Property by Proposition 3.7, the group is non-trivial. In particular, either or is non-trivial. In view of the existence of label-respecting inversions, both are non-trivial and hence so is . Therefore, has Property H of Möller–Vonk [MV12, Definition 2.3] and [MV12, Proposition 2.6] implies that has trivial quasi-center. ∎
Proof.
The subgroup is open, hence closed, and normal in by definition. Since is non-discrete by Proposition 3.12, so is . Using Proposition 2.11iii, we conclude that . Since satisfies Property by Proposition 3.7, the group is simple due to Theorem 1.1. Thus . Given that by Proposition 2.11iv, the assertion follows from Proposition 3.21. ∎
3.4. Examples
We now construct various classes of examples of subgroups of satisfying (C) or (CD), and prove a rigidity result for certain local actions.
First, we give a suitable realization of and the conditions (C) and (D). Namely, we view an automorphism of as the set as follows: Let be the natural isomorphism. For , we iteratively identify with its image under the map
where acts on by permuting the factors according to its action on . That is, multiplication in is given by
Consider the homomorphism , the projections , and
whose image we interpret as a relation on . The conditions (C) and (D) for a subgroup now read as follows.
(C) |
(D) |
3.4.1. The case
We first consider the case which is all-encompassing in certain situations, see Theorem 3.32. By the above, is realized as follows: .
Consider the map , , using the realization of from above. For every , the image
is a subgroup of which is isomorphic to and satisfies both (C) and (D). The involutive compatibility cocycle is given by . Note that implements the diagonal action on .
We obtain , following the notation of [BEW15]. Moreover, there is the following description of all subgroups with that satisfy (C) and contain .
Proposition 3.23.
Let . Given , there is satisfying (C) and fitting into the split exact sequence
if and only if is preserved by the action , .
Proof.
If there is a split exact sequence as above then is invariant under conjugation by , hence the assertion.
Conversely, if is invariant under the given action, then
fits into the sequence: First, note that contains both and . It is also a subgroup of : For we have
by assumption. In particular, . It suffices to check condition (C) on these generators of . As before, for all and . Now let . Then for all . ∎
Example 3.24.
We show that for certain dihedral groups there are only four groups of the type given in Proposition 3.23: Set for some prime . Then . Hence is a -dimensional vector space over and the -action on it permutes coordinates. When is primitive, there are only four -invariant subspaces of : The trivial subspace, the diagonal subspace , the whole space, and where is given by . Note that is -invariant because the homomorphism is. Conjecturally, there are infinitely many primes for which is primitive. The list starts with , , , , see [Slo, A001122].
Suppose that is -invariant. It suffices to show that contains as soon as contains a non-trivial element . To see this, we show that the orbit of under the cyclic group generates a -dimensional subspace of which hence equals : Indeed, the rank of the circulant matrix equals where is the polynomial , see e.g. [Day60, Corollary 1]. The polynomial factors into the irreducibles by the assumption on . Since has an even number of non-zero coefficients, we conclude that .
The following subgroups of are of the type given in Proposition 3.23. Let be transitive. Fix , let and let be normal. Furthermore, fix elements () satisfying . We define
In the case of we have whereas in the case of we have . In both cases, invariance under the action of is readily verified, as is condition (D) for .
The group can be defined for non-abelian as well, namely
However, it need not contain . Note that does not depend on the choice of the elements as is normal in , whereas and may. However, any group of the form , where is a compatibility cocycle of and are isomorphisms, which satisfies (C) and in which and commute, will be referred to as in view of Corollary 3.15.
The group can be defined without assuming transitivity of , namely
We conclude that for every .
When preserves a partition of , we define
The group satisfies (C) as well and features prominently in Section 4.1.
The following kind of -local action generalises the sign construction in [Rad17]. Let and a homomorphism to an abelian group . Define
This construction is generalised to in Section 3.4.2 where the third entry of is a set of radii over which the defining product is taken.
Proposition 3.25.
Let and a homomorphism to an abelian group . Let . If for all then and satisfies (C).
Proof.
As , and for all , an element can be turned into an element of by changing for a single, arbitrary . We conclude that and that satisfies . ∎
3.4.2. General case
We extend some constructions of Section 3.4.1 to arbitrary . Given satisfying (C), define the subgroup
Then inherits condition (C) from and we obtain . Concerning the construction we have the following.
Proposition 3.26.
Proof.
If admits an involutive compatibility cocycle , define
Then is an isomorphism and the involutive compatibility cocycle of is given by . Conversely, if a group with the asserted properties exists, set . ∎
Let satisfy (C) and let . We set for an implicit sequence of involutive compatibility cocycles. Similarly, we define . Now, let . Assume preserves a partition of . Define the group
If is non-empty for all and then satisfies (C), and if is non-trivial for all then does not satisfy (D).
The following statement generalizes Proposition 3.23.
Proposition 3.27.
Proof.
If there is a split exact sequence as above then is invariant under conjugation by . Moreover, all elements of have the form for some and . This implies the second assertion on .
Conversely, if satisfies the assumptions, then
fits into the sequence: First, note that contains both and . It is also a subgroup of : For we have
for some because normalizes . In particular, . We check condition (C) on these generators. As before, for all and because is involutive. Now, let . We then have for all by the assumption on . ∎
In the split situation of Proposition 3.27 we also denote by . For instance, the group of Proposition 3.25 satisfies (C), admits an involutive compatibility cocycle but does not satisfy (D), see Section 4.3.
Now, let and a homomorphism to an abelian group . Further, let and . Define
Proposition 3.28.
Let and a homomorphism to an abelian group . Further, let and non-empty and non-zero with . If for all then and has (C).
Proof.
As , and for all , an element can be turned into an element of by changing for a single, arbitrary . When is non-zero we conclude that and that satisfies . ∎
3.4.3. A rigid case
For certain the groups , and already yield all possible with . The main argument is based on Sections 3.4 and 3.5 of [BM00]. We first record the following lemma whose proof is due to M. Giudici by personal communication.
Lemma 3.29.
Let be -transitive and simple non-abelian. Then every extension of () by is equivalent to .
Proof.
Regarding as a normal subgroup of , consider the conjugation map . We show that complements in . Since , we have . Hence . Next, consider . By the solution of Schreier’ conjecture, is solvable. Since is not solvable we conclude . Now, by a theorem of Burnside, every -transitive permutation group is either almost simple or affine type, see [DM96, Theorem 4.1B and Section 4.8].
In the first case, is actually simple: Let . Then . Hence either or . Since is -transitive and thereby primitive, every normal subgroup acts transitively. Hence, in the first case, is regular which contradicts being almost simple. Thus the second case holds and . Now is a proper quotient of and therefore trivial. We conclude that and .
In the second case, for some and prime . Given that is non-trivial and , it contains the unique minimal normal subgroup . Since is non-abelian simple whereas the proper quotient of is solvable, . But is simple, so . ∎
The following propositions are of independent interest and used in Theorem 3.32 below. We introduce the following notation: Let and for some . We set .
Proposition 3.30.
Let satisfy (C). Suppose is transitive. Further, let and with . Then and are subnormal in of depth at most and respectively.
Proof.
We argue by induction on . For , the assertion that is normal in is a consequence of condition (C). Now, suppose satisfies the assumptions, and let and be such that . Since satisfies (C), we have , where and the right hand side implicitly has domain . Hence
by the induction hypothesis. The second assertion follows as . ∎
Proposition 3.31.
Proof.
We argue by induction on . For , the assertion follows from transitivity of . Now, let satisfy (C) but not (D). Then the same holds for . Given , write and where and . By the induction hypothesis, the group acts transitively on . Hence, using (C), there is such that . As does not satisfy (D) said transitivity further implies that is non-trivial. By Proposition 3.30, it is also subnormal of depth at most in and thus transitive. Hence there is with . ∎
The following theorem is closely related to [BM00, Proposition 3.3.1].
Theorem 3.32.
Let be -transitive and simple non-abelian. Further, let with satisfy (C). Then equals either
Proof.
Since , we may assume . Given that satisfies (C) so does the restriction . Consider the projection . We have and for all by Proposition 3.30. Since is simple, and is transitive this implies that either for all or for all .
In the first case, is an isomorphism. Hence satisfies (CD) and for an involutive compatibility cocycle of by Proposition 3.26.
In the second case, fix . We have by transitivity of . Since is simple non-abelian, [Rad17, Lemma 2.3] implies that the group is a product of subdiagonals preserved by the primitive action of on the index set of . Hence, either there is just one block and has the form for some isomorphisms , or all blocks are singletons and . In the first case, there is a compatibility cocycle of such that commutes with by Lemma 3.29. Thus . In particular, satisfies (CD). Hence .
When , we have by [BM00, Proposition 3.3.1]. ∎
If does not have simple point stabilizers or preserves a non-trivial partition, more universal groups are given by and , see Section 3.4.1. When is -transitive and has abelian point stabilizers then for some prime power by [KKP90]. Hence point stabilizers in are isomorphic to and simple if and only if is a Mersenne prime. For any value of , the projection satisfies the assumptions of Proposition 3.28 and so the groups provide further examples. The following question remains.
Question 3.33.
Let be primitive and simple non-abelian. Is there with (C) and other than , and ?
3.5. Universality
The constructed groups are universal in the sense of the following maximality statement, which should be compared to Proposition 1.6.
Theorem 3.34.
Let be locally transitive and contain an involutive inversion. Then there is a labelling of such that
where is action isomorphic to the -local action of .
Proof.
First, we construct a labelling of such that : Fix and choose a bijection . By the assumptions, there is an involutive inversion of the edge for every . Using these inversions, we define the announced labelling inductively: Set and assume that is defined on . For put if is part of the unique reduced path from to . Since the have order , we obtain for all and . Therefore, , following the proof of Lemma 1.5.
Now, let and . Further, let and be the unique reduced paths from to and respectively. Since , the group contains the unique label-respecting inversion of every edge . We therefore have
Also, stabilizes . The cocycle identity implies for every :
where is defined by . ∎
Remark 3.35.
Retain the notation of Theorem 3.34. By Proposition 1.6, there is a labelling of such that regardless of the minimal order of an inversion in . This labelling may be distinct from the one of Theorem 3.34 which fails without assuming the existence of an involutive inversion: For example, a vertex-stabilizer of the group of Example 4.39 below is action isomorphic to but for any labelling because whereas
by Proposition 3.14.
We complement Theorem 3.34 with the following criterion for certain subgroups of to contain an involutive inversions.
Proposition 3.36.
Let be locally transitive with odd order point stabilizers. If contains a finite order inversion then it contains an involutive one.
Proof.
Let be a finite order inversion of an edge and for some odd and some . It suffices to show that , in which case is an involutive inversion. Suppose . Then is non-trivial and fixes the edge . Because point stabilizers in the local action of have odd order, it follows that is non-trivial as well, but . ∎
For example, Proposition 3.36 applies when is discrete and vertex-transitive: Combined with local transitivity this implies the existence of a finite order inversion.
We remark that primitive permutation groups with odd order point stabilizers were classified in [LS91]. For instance, they include for any prime power that satisfies .
3.6. A Bipartite Version
In this section, we introduce a bipartite version of the universal groups developed in Section 3 which plays a critical role in the proof of Theorem 4.2ivivb below. Retain the notation of Section 3. In particular, let denote the -regular tree. Fix a regular bipartition of .
3.6.1. Definition and Basic Properties
The groups to be defined are subgroups of , the maximal subgroup of preserving the bipartition . Alternatively, it can be described as the subgroup generated by all point stabilizers, or all edge-stabilizers.
Definition 3.37.
Let and be a labelling of . Define
Note that is a subgroup of thanks to Lemma 3.2 and the assumption that it is a subset of . Further, Proposition 3.4 carries over to the groups . We shall therefore omit the reference to an explicit labelling in the following. Also, we recover the following basic properties.
Proposition 3.38.
Let . The group is
-
(i)
closed in
-
(ii)
transitive on both and , and
-
(iii)
compactly generated.
Parts i and ii are proven as their analogues in Proposition 3.5 whereas part iii relies on part ii and the subsequent analogue of Lemma 1.5, for which we introduce the following notation: Given and , let denote the unique label-respecting translation with . Given an element , we set . Then and if is such that for every exactly one of belongs to , then where .
Lemma 3.39.
Let . Then , the free group on the set .
Proof.
Every element of is uniquely determined by its image on . To see that it hence suffices to show that is transitive on . Indeed, let . Then for some where . Write . Then as every is label-respecting. Hence and that
yields a well-defined isomorphism. ∎
3.6.2. Compatibility and Discreteness
In order to describe the compatibility and the discreteness condition in the bipartite setting, we first introduce a suitable realization of , similar to the one at the beginning of Section 3.4. Let and be as before. For , we inductively identify with its image under
where acts on by permuting the factors according to its action on . In addition, consider the map , for every , as well as
For , conditions (C) and (D) for now read as follows.
(C) |
(D) |
For we have, using the maps () as in Section 3.4,
(C) |
(D) |
Analogues of Proposition 3.12 are proven using the discreteness conditions (D) above. We do not introduce new notation for any of the above as the context always implies which condition is to be considered. The definition of the compatibility sets for and carries over from Section 3.2 in a straightforward fashion.
3.6.3. Examples
Let . Then the group introduced in Section 3.4.1 satisfies conditions (C) and (D) for the case above, and we have .
Similarly, the group satisfies condition (C) for the case as , and we have .
The following example gives an analogue of the groups . Notice, however, that in this case the second argument is a subgroup of rather than and need not be normal, as the -local action at vertices in and need not be the same.
Example 3.40.
The next example constitutes the base case in Section 4.1.5 below.
Example 3.41.
Let . Suppose preserves a non-trivial partition of . Then
is preserved by the action of on : Let and . Then . Also, note that if then so is .
The subgroup of consisting of those elements which are self-compatible in all directions from is precisely given by
in view of condition (C) for the case above.
4. Applications
In this section, we give three applications of the framework of universal groups. First, we characterize the automorphism types which the quasi-center of a non-discrete subgroup of may feature in terms of the group’s local action, and see that Burger–Mozes theory does not extend to the transitive case. Second, we give an algebraic characterization of the -closures of locally transitive subgroups of containing an involutive inversion, and thereby partially answer two question by Banks–Elder–Willis. Third, we offer a new view on the Weiss conjecture.
4.1. Groups Acting on Trees With Non-Trivial Quasi-Center
By Proposition 2.11ii, a non-discrete, locally semiprimitive subgroup of does not contain any non-trivial quasi-central edge-fixating elements. We complete this fact to the following local-to-global-type characterization of quasi-central elements.
Theorem 4.1.
Let be non-discrete. If is locally
-
(i)
transitive then contains no inversion.
-
(ii)
semiprimitive then contains no non-trivial edge-fixating element.
-
(iii)
quasiprimitive then contains no non-trivial elliptic element.
-
(iv)
-transitive then contains no hyperbolic element of length .
Theorem 4.2.
There is and a closed, non-discrete, compactly generated subgroup of which is locally
-
(i)
intransitive and contains a quasi-central inversion.
-
(ii)
transitive and contains a non-trivial quasi-central edge-fixating element.
-
(iii)
semiprimitive and contains a non-trivial quasi-central elliptic element.
-
(iv)
-
(a)
intransitive and contains a quasi-central hyperbolic element of length .
-
(b)
quasiprimitive and contains a quasi-central hyperbolic element of length .
-
(a)
Proof.
(Theorem 4.1). Fix a labelling of and let be non-discrete.
For i, suppose inverts . Since is locally transitive and , there is an inversion of for all . By definition, the centralizer of in is open for all . Hence, using non-discreteness of , there is such that commutes with for all and . However, for all , that is in contradiction to the above.
Part ii is Proposition 2.11ii and part iii is [BM00, Proposition 1.2.1 (ii)]. Here, the closedness assumption is unnecessary.
For part iv, suppose is a translation of length which maps to for some . Since is locally -transitive and , there is a translation which maps to for all . By definition, the centralizer of in is open for all . Hence, using non-discreteness of there is such that commutes with for all and . However, for all , that is in contradiction to the above. ∎
We complement part ii of Theorem 4.1 with the following result inspired by [BM00, Proposition 3.1.2] and [Rat04, Conjecture 2.63],
Proposition 4.3.
Let be non-discrete and locally semiprimitive. If all orbits of are uncountable then is trivial.
Proof.
By Theorem 4.1, the group contains no inversions. Let be the set of fixed points of hyperbolic elements in . Since , the set is -invariant. Also, is discrete by Theorem 4.1 and hence countable as is second-countable. Thus is countable and hence empty. We conclude that does not contain elliptic elements in view of [GGT18, Lemma 6.4]. ∎
The following strengthening of Theorem 4.2ii proved in Section 4.1.2 shows that Burger–Mozes theory does not generalize to the locally transitive case.
Theorem 4.4.
There is and a closed, non-discrete, compactly generated, locally transitive subgroup of with open, hence non-discrete, quasi-center.
We prove Theorem 4.2 by construction in the consecutive sections. Whereas parts i to iviva all use groups of the form for appropriate local actions , part ivivb uses a group of the form . All sections appear similar at first glance but vary in detail.
4.1.1. Theorem 4.2i
For certain intransitive we construct a closed, non-discrete, compactly generated, vertex-transitive group which locally acts like and contains a quasi-central involutive inversion.
Let . Assume that the partition of into -orbits has at least three elements and that for all .
Fix an orbit of size at least and . Define groups for inductively by and
Proposition 4.5.
Proof.
We prove all three properties simultaneously by induction: For , the assertions i and ii are trivial. The third translates to being non-trivial for all which is an assumption. Now, assume that all properties hold for . Then the definition of is meaningful because of i and it is a subgroup of because preserves each . Assertion i is now evident. Statement ii carries over from to . So does iii since . ∎
Definition 4.6.
Retain the above notation. Define .
Now, is compactly generated, vertex-transitive and contains an involutive inversion because . Also, is closed as an intersection of closed sets. The -local action of is given by because for all and therefore .
Lemma 4.7.
The group is non-discrete.
Proof.
Let and . We construct a non-trivial element which fixes : Set . By parts i and iii of Proposition 4.5 as well as the definition of , there is a non-trivial element with . Applying parts i and ii of Proposition 4.5 repeatedly, we obtain non-trivial elements for all with . Set for all and define by fixing and setting . Since for all we conclude that . ∎
Proposition 4.8.
The quasi-center of contains an involutive inversion.
Proof.
Let . The group contains the label-respecting inversion of for all : Let and . Then and for all since . That is, commutes with . ∎
4.1.2. Theorem 4.2ii
For certain transitive we construct a closed, non-discrete, compactly generated, vertex-transitive group which locally acts like and has open quasi-center.
Let be transitive. Assume that preserves a non-trivial partition of and that for all . Further, suppose that is abelian and preserves setwise.
Example 4.9.
Let be regular abelian and regular. Then satisfies the above properties as .
Define groups for inductively by and
Proposition 4.10.
Proof.
We prove all three properties simultaneously by induction: For , the assertion i is trivial whereas iii is an assumption. The second translates to being non-trivial for all which is an assumption. Now, assume all properties hold for . Then the definition of is meaningful because of i and it is a subgroup of because preserves . Statement ii carries over from to . Finally, iii follows inductively because preserves setwise. ∎
Definition 4.11.
Retain the above notation. Define .
Now, is compactly generated, vertex-transitive and contains an involutive inversion because . Also, is closed as an intersection of closed sets. The -local action of is given by because for all and therefore .
Lemma 4.12.
The group is non-discrete.
Proof.
Let and . We construct a non-trivial element which fixes : Consider . By part ii of Proposition 4.10 as well as the definition of , there is a non-trivial element with . Applying part i of Proposition 4.10 repeatedly, we obtain non-trivial elements for all with . Set for all and define by fixing and setting . Since for all we conclude that . ∎
Proposition 4.13.
The group has open quasi-center.
Proof.
Remark 4.14.
Without assuming local transitivity one can achieve abelian point stabilizers, following the construction of the previous section. This cannot happen for non-discrete locally transitive groups which are vertex-transitive as the following argument shows: By Proposition 1.6, the group is contained in where is the local action of . If is abelian, then so is . Since any transitive abelian permutation group is regular we conclude that and hence are discrete. In this sense, the construction of this section is efficient.
4.1.3. Theorem 4.2iii
For certain semiprimitive we construct a closed, non-discrete, compactly generated, vertex-transitive group which locally acts like and contains a non-trivial quasi-central elliptic element.
Let be semiprimitive. Suppose preserves a non-trivial partition of and that for all . Further, suppose that contains a non-trivial central element which preserves setwise.
Example 4.15.
Consider where are the standard basis vectors. We have . The blocks of size are as listed above given that .
Define groups for inductively by and
Proposition 4.16.
Proof.
We prove all three properties simultaneously by induction: For , the assertion i is trivial whereas iii is an assumption. The second translates to being non-trivial for all which is an assumption. Now, assume all properties hold for . Then the definition of is meaningful because of i and it is a subgroup of because preserves . Statement ii carries over from to . Finally, iii follows inductively because and hence preserves setwise: For we have
Definition 4.17.
Retain the above notation. Define .
Now, is compactly generated, vertex-transitive and contains an involutive inversion because . Also, is closed as an intersection of closed sets. The -local action of is given by because for all and therefore .
Lemma 4.18.
The group is non-discrete.
Proof.
Let and . We construct a non-trivial element which fixes : Consider . By part ii of Proposition 4.16 and the definition of , there is a non-trivial with . Applying part i of Proposition 4.16 repeatedly, we obtain non-trivial elements for all with . Set for all and define by fixing and setting . Since for all we conclude that . ∎
Proposition 4.19.
The quasi-center of contains a non-trivial elliptic element.
Proof.
By Proposition 4.16, the element which fixes and whose -local action is everywhere commutes with . Hence . ∎
Remark 4.20.
The argument of this section does not work in the quasiprimitive case because a quasiprimitive group with non-trivial center is abelian and regular: If is non-trivial then it is transitive, and it suffices to show that is trivial. Suppose moves . Pick with . Then , contradicting the assumption that .
4.1.4. Theorem 4.2iviva
For certain intransitive we construct a closed, non-discrete, compactly generated, vertex-transitive group which locally acts like and contains a quasi-central hyperbolic element of length .
Let . Assume that the partition of has at least three elements and that . Choose a non-trivial element and with . Further, suppose that for all .
Define groups for inductively by and
Proposition 4.21.
The groups () defined above satisfy:
Proof.
We prove all four properties simultaneously by induction: For , the assertions i and ii are trivial. The third translates to being non-trivial for all which is an assumption, as is iv. Now, assume that all properties hold for . Then the definition of is meaningful because of i and it is a subgroup of because preserves . Assertion i is now evident. Statements ii and iii carry over from to . Finally, iii follows inductively because and hence preserves setwise: For we have
Definition 4.22.
Retain the above notation. Define .
Now, is compactly generated, vertex-transitive and contains an involutive inversion because . Also, is closed as the intersection of all its -closures. The -local action of is given by as for all and therefore .
Lemma 4.23.
The group is non-discrete.
Proof.
Let and . We construct a non-trivial element which fixes : Consider . By parts i and iii of Proposition 4.21 as well as the definition of , there is a non-trivial element with . Applying parts i and ii of Proposition 4.21 repeatedly, we obtain non-trivial elements for all with . Set for all and define by fixing and setting . Since for all we conclude that . ∎
Proposition 4.24.
The quasi-center of contains a translation of length .
Proof.
Fix and let be as above. Consider the line through with labels
Define by and for all . Then is a translation of length along . Furthermore, commutes with : Indeed, let . Then and
for all because and . ∎
4.1.5. Theorem 4.2ivivb
For certain quasiprimitive we construct a closed, non-discrete, compactly generated group which locally acts like and contains a quasi-central hyperbolic element of length .
Let be quasiprimitive. Suppose preserves a non-trivial partition . Further, suppose that and that is transitive for all and .
Example 4.25.
Consider which has blocks of size and non-trivial block stabilizers as for all given that .
Retain the notation of Example 3.41. Define groups for inductively by and
Proposition 4.26.
The groups () defined above satisfy:
-
(i)
Every is self-compatible in all directions from .
-
(ii)
The compatibility set is non-empty for all and .
In particular, the group satisfies (C). -
(iii)
The compatibility set is non-trivial for all .
In particular, the group does not satisfy (D).
Proof.
We prove all three properties simultaneously by induction: For , the assertion i holds by construction of , as do ii and iii. Now assume that all properties hold for . Then the definition of is meaningful because of i and it is a subgroup because preserves . Also, satisfies i because is inversion-closed. Statements ii and iii carry over from . ∎
Definition 4.27.
Retain the above notation. Define .
Now, is closed as an intersection of closed sets and compactly generated by for some and a finite generating set of , see Lemma 3.39. For vertices in , the -local action is because . For vertices in the -local action is as .
Lemma 4.28.
The group is non-discrete.
Proof.
Let and . We construct a non-trivial element which fixes : Consider : By parts i and iii of Proposition 4.5 and the definition of , there is a non-trivial element with . Applying parts i and ii of Proposition 4.26 repeatedly, we obtain non-trivial elements for all with . Set for all and define by fixing and setting . Since for all we conclude that . ∎
Proposition 4.29.
The quasi-center of contains a translation of length .
Proof.
Fix and . Consider the line through with labels
Define by and for all . Then is a translation of length along . Furthermore, commutes with : Indeed, let . Then and for all :
as for all and , and . ∎
Remark 4.30.
We argue that the construction of this section does not carry over to any primitive and .
First, note that : For and we have . We now observe the following obstruction to non-discreteness: Given any orbit , the subgroup of consisting of elements which are self-compatible in all directions from is precisely .
Indeed, every element of is self-compatible in all directions from . Conversely, let be self-compatible in all directions from . Consider the equivalence relation on defined by if and only if . Since whenever , this relation is -invariant: Since we have for all whenever . Since is primitive, it is the universal relation, so .
4.2. Banks–Elder–Willis -closures
Theorem 3.34 yields a description of the -closures of locally transitive subgroups of which contain an involutive inversion, and thereby a characterization of the locally transitive universal groups. Recall that the -closure of a subgroup is
Combined with Corollary 3.18 the following partially answers the question for an algebraic description of a group’s -closure in the last paragraph of [BEW15].
Theorem 4.31.
Let be locally transitive and contain an involutive inversion. Then for some labelling of and .
Proof.
Let and be as in Theorem 3.34. Then :
Let and . Since there is with , and since is -locally action isomorphic to there is such that . Then satisfies .
Conversely, let . Then all -local actions of stem from elements of . Given that by Theorem 3.34, we conclude that . ∎
Corollary 4.32.
Let be closed, locally transitive and contain an involutive inversion. Then for some labelling of and an action if and only if satisfies Property .
Proof.
Banks–Elder–Willis use certain subgroups of with pairwise distinct -closures to construct infinitely many, pairwise non-conjugate, non-discrete simple subgroups of via Theorem 1.1 and [BEW15, Theorem 8.2]. For example, the group qualifies by the argument in [BEW15, Section 4.1]. Whereas has trivial quasi-center given that it is simple, certain groups with non-trivial quasi-center, always have infinitely many distinct -closures.
Proposition 4.33.
Let be closed, non-discrete, locally transitive and contain an involutive inversion. If, in addition, has non-trivial quasi-center then has infinitely many distinct -closures.
Proof.
Banks–Elder–Willis ask whether the infinitely many, pairwise non-conjugate, non-discrete simple subgroups of they construct are also pairwise non-isomorphic as topological groups. By Proposition 3.17, this is the case if said simple groups are locally transitive with distinct point stabilizers, which can be determined from the original group’s -local actions thanks to Theorem 4.31.
Theorem 4.34.
Let be non-discrete, locally permutation isomorphic to and contain an involutive inversion. Suppose that is transitive and that every non-trivial subnormal subgroup of is transitive on . If for some then and are non-isomorphic.
Proof.
In view of [BEW15, Theorem 8.2], the groups and are non-conjugate. We show that they satisfy the assumptions of Proposition 3.17 which then implies the assertion. It suffices to consider . By Theorem 4.31, we have for some . By virtue of Proposition 3.10, we may assume that satisfies (C). Since is non-discrete, so is . Therefore, does not satisfy (D), see Proposition 3.12. Hence, in view of the local action of and Proposition 3.31, the group is non-trivial and thus transitive by Proposition 3.30 for all and . Now, let . For every pick . Let be such that . Since is transitive for every we conclude that is locally -transitive at . So Proposition 3.17 applies. ∎
Example 4.35.
Lemma 4.36.
Let be -transitive. If is prime then every non-trivial subnormal subgroup of () acts transitively on .
Proof.
Since acts transitively on , which has prime order, is primitive. So every non-trivial normal subgroup of acts transitively on . Iterate. ∎
Example 4.37.
The proof of Theorem 4.34 shows that the assumptions on can be replaced with asking that be locally transitive with distinct point stabilizers, which may be feasible to check in a given example.
For instance, let be transitive with distinct point stabilizers. Assume that preserves a non-trivial partition of and that it is generated by its block stabilizers, i.e. .
Let be such that for all . Inductively define groups by and , and check that
-
(i)
is non-empty for all and ,
-
(ii)
is non-trivial for all ,
-
(iii)
, and
-
(iv)
for all and with .
In particular satisfies (C) but not (D) for all . Set . By the above, is non-discrete and contains both and . Hence Theorem 4.31 applies and we have . From Item iii, we conclude that the () are pairwise distinct. Given that locally acts like due to Item iv, the are hence pairwise non-isomorphic.
4.3. A View on the Weiss Conjecture
The Weiss conjecture states that there are only finitely many conjugacy classes of discrete, vertex-transitive, locally primitive subgroups of for a given . We now study the universal group construction in the discrete case and thereby offer a new view on this conjecture: Under the additional assumption that each group contains an involutive inversion, it suffices to show that for every primitive there are only finitely many with and which satisfy (CD) in a minimal fashion; see Definition 4.42 and the discussion thereafter.
The following consequence of Theorem 4.31 identifies certain groups relevant to the Weiss conjecture as universal groups for local actions satisfying condition (CD).
Corollary 4.38.
Let be discrete, locally transitive and contain an involutive inversion. Then for some , a labelling of and satisfying (CD) which is isomorphic to the -local action of .
Proof.
Discreteness of implies Property for every such that stabilizers in of balls of radius in are trivial. Then apply Theorem 4.31. ∎
Therefore, studying the class of groups given in Corollary 4.38 reduces to studying subgroups which satisfy (CD) and for which is transitive. By Corollary 3.15, any two conjugate such groups yield isomorphic universal groups. In this sense, it suffices to examine conjugacy classes of subgroups of . This can be done computationally using the description of conditions (C) and (D) developed in Section 3.2, using e.g. [GAP17].
Example 4.39.
Consider the case . By [Tut47], [Tut59] and [DM80], there are, up to conjugacy, seven discrete, vertex-transitive and locally transitive subgroups of . We denote them by , , , , , and . The subscript determines the isomorphism class of the vertex stabilizer, whose order is . A group contains an involutive inversion if and only if it has no superscript. The minimal order of an inversion in and is . See also [CL89]. By Corollary 4.38, the groups are of the form . We recover their local actions in the following table of conjugacy class representatives of subgroups of and which satisfy (C) and project onto a transitive subgroup of . The list is complete for , and for in the case of (CD).
Description of (C) (D) i.c.c. 2 3 yes yes yes \cdashline1-7 2 6 yes yes yes 2 12 yes yes yes 2 24 yes no no 2 24 yes no yes 2 48 yes no no Description of (C) (D) i.c.c. 3 24 yes yes yes 3 48 yes yes yes
The column labelled “i.c.c.” records whether admits an involutive compatibility cocycle. This can be determined in [GAP17] and is automatic in the case of (CD). The group of Proposition 3.25 admits an involutive compatibility cocycle which we describe as follows: Say . Let be the transposition which fixes , and let be the element whose -local action is everywhere except at . Then . Further, let be the non-trivial element with . We then have and for all distinct , with cyclic notation.
The kernel is the diagonal subgroup of . Using the above, we conclude , , , and .
Question 4.40.
Can the groups and be described as universal groups with prescribed local actions on edge neighbourhoods that prevent involutive inversions?
The long standing Weiss conjecture [Wei78] states that there are only finitely many conjugacy classes of discrete, vertex-transitive, locally primitive subgroups of for a given . Potočnic–Spiga–Verret [PSV12] show that a permutation group , for which there are only finitely many conjugacy classes of discrete, vertex-transitive subgroups of that locally act like , is necessarily semiprimitive, and conjecture the converse. Promising partial results were obtained in the same article as well as by Giudici–Morgan in [GM14].
Corollary 4.38 suggests to restrict to discrete, locally semiprimitive subgroups of containing an involutive inversion.
Conjecture 4.41.
Let be semiprimitive. Then there are only finitely many conjugacy classes of discrete subgroups of which locally act like and contain an involutive inversion.
For a transitive permutation group , let denote the collection of subgroups of which are discrete, locally act like and contain an involutive inversion. Then the following definition is meaningful by Corollary 4.38.
Definition 4.42.
Let be transitive. Define
if the maximum exists and otherwise.
Given Definition 4.42, Conjecture 4.41 is equivalent to asserting that is finite whenever is semiprimitive. The remainder of this section is devoted to determining for certain classes of transitive permutation groups.
Proposition 4.43.
Let be transitive. Then if and only if is regular.
Proof.
If is regular, then by Proposition 3.13. Conversely, if then . Hence which implies that is trivial for all . That is, is regular. ∎
The next proposition provides a large class of primitive groups of dimension . It relies on the following relations between various characteristic subgroups of a finite group. Recall that the socle of a finite group is the subgroup generated by its minimal normal subgroups, which form a direct product.
Lemma 4.44.
Let be a finite group. Then the following are equivalent.
-
(i)
The socle has no abelian factor.
-
(ii)
The solvable radical is trivial.
-
(iii)
The nilpotent radical is trivial.
Proof.
If has no abelian factor then is trivial: A non-trivial solvable normal subgroup of would contain a minimal solvable normal subgroup of which is necessarily abelian. Next, ii implies iii as every nilpotent group is solvable. Finally, if has an abelian factor then contains a (minimal) normal abelian, hence nilpotent subgroup. Thus iii implies i. ∎
Proposition 4.45.
Let be primitive, non-regular and assume that has trivial nilpotent radical for all . Then .
Proof.
Suppose that satisfies (C) and that the sequence
is exact. Fix . Then . Since satisfies (C), we have for all , and since is transitive these projections all coincide with the same . Now consider for some . Either is trivial, in which case has (CD), or is non-trivial. In the latter case, say is non-trivial for some . Then is subnormal in as and therefore has trivial nilpotent radical. The Thompson-Wielandt Theorem [Tho70], [Wie71] (cf. [BM00, Theorem 2.1.1]) now implies that there is no which satisfies and (CD). Thus . Equality holds by Proposition 4.43. ∎
Proposition 4.45 applies to and () whose point stabilizers have non-abelian simple socle . It also applies to primitive groups of O’Nan-Scott type (TW) and (HS), whose point stabilizers have trivial solvable radical [DM96, Theorem 4.7B] and simple non-abelian socle [LPS88] respectively.
To contrast the primitive case, we show that imprimitive wreath products have dimension at least , illustrating the use of involutive compatibility cocycles. Recall that for and the wreath product admits a natural imprimitive action on with the partition , namely .
Proposition 4.47.
Let and be finite sets of size at least . Furthermore, let and be transitive. Then .
Proof.
We define a subgroup which projects onto , satisfies (C), does not satisfy (D) but admits an involutive compatibility cocycle. This suffices by Lemma 3.26. For , let denote the -th embedding of into . Recall the map from Section 3.4.1 and consider
Furthermore, let denote the embedding of into . We define
By construction, does not satisfy (D). To see that admits an involutive compatibility cocycle, we first determine its group structure. Consider the subgroups and . Then . Observe that and commute, intersect trivially and that permutes the factors of each product. Hence
An involutive compatibility cocycle of may now be defined by setting
for all , , and for all . In fact, the map extends to an involutive compatibility cocycle of which in turn extends to an involutive compatibility cocycle of . ∎
References
- [BEW15] C. Banks, M. Elder, and G. Willis, Simple groups of automorphisms of trees determined by their actions on finite subtrees, Journal of Group Theory 18 (2015), no. 2, 235–261.
- [BM00] M. Burger and S. Mozes, Groups acting on trees: from local to global structure, Publications Mathématiques de l’IHÉS 92 (2000), no. 1, 113–150.
- [CB19] P.-E. Caprace and A. Le Boudec, Bounding the covolume of lattices in products, Compositio Mathematica 155 (2019), no. 12, 2296–2333.
- [CL89] M. Conder and P. Lorimer, Automorphism groups of symmetric graphs of valency 3, Journal of Combinatorial Theory, Series B 47 (1989), no. 1, 60–72.
- [Day60] D. Daykin, On the Rank of the Matrix f(A) and the Enumeration of Certain Matrices over a Finite Field, Journal of the London Mathematical Society 1 (1960), no. 1, 36–42.
- [DM80] D. Ž. Djoković and G. Miller, Regular groups of automorphisms of cubic graphs, Journal of Combinatorial Theory, Series B 29 (1980), no. 2, 195–230.
- [DM96] J. Dixon and B. Mortimer, Permutation groups, vol. 163, Springer, 1996.
- [FTN91] A. Figà-Talamanca and C. Nebbia, Harmonic analysis and representation theory for groups acting on homogenous trees, vol. 162, Cambridge University Press, 1991.
- [GAP17] The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.8.7, 2017.
- [GGT18] A. Garrido, Y. Glasner, and S. Tornier, Automorphism Groups of Trees: Generalities and Prescribed Local Actions, New Directions in Locally Compact Groups (P.-E. Caprace and M. Monod, eds.), Cambridge University Press, 2018, pp. 92–116.
- [Gle52] A. Gleason, Groups without small subgroups, Annals of Mathematics (1952), 193–212.
- [GM14] M. Giudici and L. Morgan, A class of semiprimitive groups that are graph-restrictive, Bulletin of the London Mathematical Society 46 (2014), no. 6, 1226–1236.
- [GM18] by same author, A theory of semiprimitive groups, Journal of Algebra 503 (2018), 146–185.
- [KKP90] G. Károlyi, .J Kovács, and P. Pálfy, Doubly transitive permutation groups with abelian stabilizers, Aequationes mathematicae 39 (1990), no. 2-3, 161–166.
- [KM08] B. Krön and R. Möller, Analogues of Cayley graphs for topological groups, Mathematische Zeitschrift 258 (2008), no. 3, 637.
- [LPS88] M. Liebeck, C. Praeger, and J. Saxl, On the O’Nan-Scott theorem for finite primitive permutation groups, Journal of the Australian Mathematical Society (Series A) 44 (1988), no. 03, 389–396.
- [LS91] M. Liebeck and J. Saxl, On point stabilizers in primitive permutation groups, Communications in Algebra 19 (1991), no. 10, 2777–2786.
- [Mon01] N. Monod, Continuous bounded cohomology of locally compact groups, Springer, 2001.
- [MV12] R. G. Möller and J. Vonk, Normal subgroups of groups acting on trees and automorphism groups of graphs, Journal of Group Theory 15 (2012), no. 6, 831–850.
- [MZ52] D. Montgomery and L. Zippin, Small subgroups of finite-dimensional groups, Proceedings of the National Academy of Sciences 38 (1952), no. 5, 440–442.
- [Pra97] C. Praeger, Finite quasiprimitive graphs, Surveys in combinatorics, 1997, Cambridge University Press, 1997, pp. 65–85.
- [PSV12] P. Potočnik, P. Spiga, and G. Verret, On graph-restrictive permutation groups, Journal of Combinatorial Theory, Series B 102 (2012), no. 3, 820–831.
- [Rad17] N. Radu, A classification theorem for boundary 2-transitive automorphism groups of trees, Inventiones Mathematicae 209 (2017), no. 1, 1–60.
- [Rat04] D. Rattaggi, Computations in groups acting on a product of trees: Normal subgroup structures and quaternion lattices, Ph.D. thesis, ETH Zurich, 2004.
- [Ser03] J.-P. Serre, Trees, Springer, 2003.
- [Slo] N. Sloane, The On-Line Encyclopedia of Integer Sequences, https://oeis.org.
- [Smi17] S. Smith, A product for permutation groups and topological groups, Duke Mathematical Journal 166 (2017), no. 15, 2965–2999.
- [Tho70] J. Thompson, Bounds for orders of maximal subgroups, Journal of Algebra 14 (1970), no. 2, 135–138.
- [Tit70] J. Tits, Sur le groupe des automorphismes d’un arbre, Essays on topology and related topics, Springer, 1970, pp. 188–211.
- [Tor18] S. Tornier, Groups Acting on Trees and Contributions to Willis Theory, Ph.D. thesis, ETH Zurich, 2018.
- [Tut47] W. Tutte, A family of cubical graphs, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 43, Cambridge University Press, 1947, pp. 459–474.
- [Tut59] by same author, On the symmetry of cubic graphs, Canadian Journal of Mathematics 11 (1959).
- [Wei78] R. Weiss, s-Transitive graphs, Algebraic methods in graph theory 25 (1978), 827–847.
- [Wie71] H. Wielandt, Subnormal subgroups and permutation groups, Ohio State Univ., 1971.
- [Yam53] H. Yamabe, A generalization of a theorem of Gleason, Annals of Mathematics (1953).