Braiding groups of automorphisms and almost-automorphisms of trees

Abstract We introduce “braided” versions of self-similar groups and Röver–Nekrashevych groups, and study their finiteness properties. This generalizes work of Aroca and Cumplido, and the first author and Wu, who considered the case when the self-similar groups are what we call “self-identical.” In particular, we use a braided version of the Grigorchuk group to construct a new group called the “braided Röver group,” which we prove is of type 
$\operatorname {\mathrm {F}}_\infty $
 . Our techniques involve using so-called d-ary cloning systems to construct the groups, and analyzing certain complexes of embedded disks in a surface to understand their finiteness properties.


Introduction
In this paper we introduce and study braided versions of self-similar groups of tree automorphisms and Röver-Nekrashevych groups of tree almost-automorphisms.A subgroup of the group of automorphisms of an infinite rooted regular tree is called self-similar if it is "built out of copies of itself" in some sense (see Definition 1.2).The Röver-Nekrashevych group associated to a self-similar group is the group of self-homeomorphisms of the boundary of the tree that locally "look like" the self-similar group (see Definition 2.7).The first example, now called the Röver group, was constructed by Röver in [Röv99], using the Grigorchuk group constructed by Grigorchuk in [Gri80,Gri84].In [Nek04] Nekrashevych constructed Röver-Nekrashevych groups in general, starting with an arbitrary self-similar group.
The braided variants of Röver-Nekrashevych groups we construct here were previously considered by Aroca-Cumplido [AC22] in the special case when the self-similar groups are what we call "self-identical" (Definition 1.3), and these examples were also studied by the first author and Wu in [SW].These papers are part of a large body of recent work devoted to "braiding" groups in the extended family of Thompson's groups.The original braided Thompson group brV was introduced independently by Brin [Bri07] and Dehornoy [Deh06], as a braided version of the classical Thompson group V .Thompson's group F also has a braided counterpart brF , first considered in [BBCS08].Thompson's group T has a number of different "braidings", found, e.g., in [FK08,FK11,Wit19].Braided versions of the Brin-Thompson groups from [Bri04] were recently constructed by Spahn [Spa].Finally, Houghton's groups, which are related to Thompson's groups, have braided variants due to Degenhardt [Deg00].The braided Houghton groups along with the braided versions of T from [FK08,FK11] are also studied in [GLU22].
In this paper we "braid" arbitrary self-similar groups and arbitrary Röver-Nekrashevych groups.In particular we get a new group that we call the braided Röver group, which is a braided variant of the Röver group, i.e., the Röver-Nekrashevych group specifically arising from the Grigorchuk group.(A torsion-free version of the Grigorchuk group that could be called a "braided" version was previously constructed by Grigorchuk in [Gri85]; the braided Grigorchuk group we construct here is slightly different.)To construct braided self-similar groups, we work inside an infinitely iterated wreath product of braid groups, and impose conditions arising from a "braided wreath recursion" on elements (see Definition 1.7).To construct braided Röver-Nekrashevych groups, we use the framework of d-ary cloning systems, developed by the authors and Stefan Witzel in [WZ18,SZ21]: we use the braided wreath recursion to produce a d-ary cloning system associated to any braided self-similar group, and then the braided Röver-Nekrashevych group is the resulting Thompson-like group that arises from the d-ary cloning system (see Definition 2.10).
As often happens with new Thompson-like groups, for example in many of the aforementioned references, it is of interest to understand their finiteness properties.A group is of type F n if it has a classifying space with finite n-skeleton, where a classifying space is a connected CW-complex whose fundamental group is the group in question and whose higher homotopy groups are all trivial.Thus, type F 1 is equivalent to finite generation and type F 2 is equivalent to finite presentability.We say type F ∞ for type F n for all n.The classical Thompson's groups F , T , and V , and the Brin-Thompson groups nV , are all of type F ∞ [BG84,Bro87,FMWZ13], as are all their aforementioned braided variants [BFM + 16, Wit19, GLU22, Spa].There is also a "ribbon braided" variant of V that is of type F ∞ [Thu17].The Röver group along with some related Röver-Nekrashevych groups are of type F ∞ as well [FH15,BM16,SZ21].In particular this includes Röver-Nekrashevych groups arising from self-identical groups [FH15].Röver-Nekrashevych groups also afforded the first known examples of simple groups of type F n−1 but not F n for arbitrary n, in [SWZ19].Here we analyze finiteness properties of braided Röver-Nekrashevych groups, and prove two main results: Theorem 4.1.The braided Röver group is of type F ∞ .
When G is braided self-identical, Theorem 3.1 was proved by the first author and Wu in [SW], where it was proved that the converse also holds.We prove that the braided Grigorchuk group is (like the original Grigorchuk group) not finitely presentable (Proposition 1.22), so Theorem 4.1 shows that the converse of Theorem 3.1 is not true in general.We remark that it remains an interesting problem for n ≥ 2 to find explicit examples of G for which Theorem 3.1 applies but the results in [SW] do not, i.e., G is braided self-similar but not braided self-identical.(For an example when n = 1, see Example 1.11 using Z ≀ Z.) Let d ∈ N with d ≥ 2, let X be a set with d elements, called an alphabet, and let X * be the set of all finite words in X (including the empty word, denoted ∅).The infinite rooted d-ary tree, denoted T d , naturally has X * as its vertex set.The root is ∅, and given a vertex v the children of v are the vertices of the form vx for x ∈ X. Definition 1.1 (Automorphism).An automorphism of T d is a bijection X * → X * that preserves incidence (and so in particular fixes ∅).The group of all automorphisms of T d is denoted Aut(T d ).
We will be interested in certain subgroups of Aut(T d ), called self-similar groups.A vast amount of information about self-similar groups can be found in [Nek05].To define them we need to view Aut(T d ) as an infinitely iterated wreath product, namely as we will now begin to explain.
Our convention for wreath products is that S d ≀ X G := S d ⋉ G X , i.e., the group doing the acting is written on the left.We write the subscript X in ≀ X to emphasize that this is the permutation wreath product coming from S d := Symm(X) acting on X.We may also sometimes identify X with {1, . . ., d} so that elements of G X can be conveniently written as tuples (g 1 , . . ., g d ).We will also sometimes write . Now let us be more rigorous about infinitely iterated wreath products.Let S d ≀ n X S d be the n-times-iterated wreath product, e.g., ), and so forth.For each n ∈ N we have an epimorphism S d ≀ n X S d → S d ≀ n−1 X S d given by "forgetting the rightmost factor"; for example S d ≀ 2 X S d → S d ≀ 1 X S d is the map (σ, ((τ 1 , (υ 1 1 , . . ., υ d 1 )), . . ., (τ d , (υ 1 d , . . ., υ d d )))) → (σ, (τ 1 , . . ., τ d )).This forms a projective system, and the infinitely iterated wreath product S d ≀ ∞ X S d is the projective limit of this system.It is clear that this is isomorphic to Aut(T d ).The point is that an automorphism of T d can be viewed as first shuffling the d many children of the root, then independently for each child of the root shuffling its d many children, then shuffling their children, and so on.
Thanks to this viewpoint we see that Aut(T d ) ∼ = S d ≀ X Aut(T d ).Hence, an element f ∈ Aut(T d ) can be decomposed as f = ρ(f )(f 1 , . . ., f d ), where is the natural epimorphism coming from the wreath product, and f i ∈ Aut(T d ).This is called the wreath recursion.This produces a function (not a homomorphism) ψ : Aut(T d ) → Aut(T d ) X sending f to ψ(f ) := (f 1 , . . ., f d ), so the wreath recursion of f is f = ρ(f )ψ(f ).For any subgroup G ≤ Aut(T d ) the image ψ(G) is a subset of Aut(T d ) X , and this leads us to the definition of self-similar: The easiest example of a self-similar subgroup of Aut(T d ) is given by a certain action of the symmetric group S d on T d .This kind of example will come up a lot, so we will actually give it its own name: Example 1.4 (Subgroups of the symmetric group).For σ ∈ S d = Symm(X) we can define an element of Aut(T d ), also denoted σ, by declaring that σ sends the vertex In particular ψ(σ) = (σ, . . ., σ), and so viewing S d as a subgroup of Aut(T d ) in this way we see that S d , and indeed any subgroup of S d , is self-identical (hence self-similar).Every self-identical subgroup occurs in this way.
Example 1.5 (Grigorchuk group).The Grigorchuk group, introduced by Grigorchuk in [Gri80], is the subgroup Grig ≤ Aut(T 2 ) generated by elements a, b, c, and d defined by the following wreath recursions.(These are usually denoted by a, b, c, and d, but we will be writing those for the braided version, so we will write a, b, c, and d here.)First, a = (1 2)(id, id), where we identify X with {1, 2}.Next, b = (a, c), c = (a, d), and d = (id, b), where the lack of a symbol in front of the ordered pair indicates that b, c, and d fix the children of the root.The Grigorchuk group was the first example of a finitely generated group that has intermediate growth, and that is amenable but not elementary amenable [Gri84].
1.1.Braiding groups of automorphisms.Now we describe a braided version of all of the above.Let B d be the d-strand braid group.Via the standard projection B d → S d , we get an action of B d on X. Hence we can consider finitely iterated wreath products B d ≀ n X B d , take the projective limit, and get the infinitely iterated wreath product which we may also write as , and so just like with Aut(T d ) we get a "braided wreath recursion": any f ∈ brAut(T d ) decomposes as f = φ(f )(f 1 , . . ., f d ), where is the natural epimorphism coming from the wreath product, and f i ∈ brAut(T d ).Also note that the epimorphism B d → S d induces an epimorphism For any f ∈ brAut(T d ) define ψ(f ) := (f 1 , . . ., f d ), where f = φ(f )(f 1 , . . ., f d ) is the braided wreath recursion.In particular for any subgroup G ≤ brAut(T d ) the image ψ(G) is a subset of brAut(T d ) X .This leads us to the following: Note that the image in Aut(T d ) under π of any braided self-similar group is a self-similar group (with an analogous statement for self-identical).
Remark 1.9.In terms of being able to construct these variants of self-similar groups, there is nothing particularly special about braid groups.More generally, given any group Γ acting on any set Y one can form the iterated wreath products Γ ≀ n Y Γ, take the projective , and then consider subgroups G for which the associated wreath recursion of any element of G involves only elements of G.One could call these "(Γ, Y )-self-similar".Our focus here is on braided versions, so we will not pursue this degree of generality here.
Example 1.10 (Subgroups of the braid group).This example is the "braided" version of Example 1.4.For β ∈ B d we can define an element of brAut(T d ), also denoted β, via the braided wreath recursion β = β(β, . . ., β).In particular, viewing B d as a subgroup of brAut(T d ) in this way we see that B d , and indeed any subgroup of B d , is braided selfidentical (hence braided self-similar).
Before the next example, let us fix a generator ζ of B 2 ∼ = Z, which will also be useful in all that follows.We will use the braid where the strand on the left crosses over the strand on the right as the strands go down, as in Figure 1.
) for all k ∈ Z, so an induction argument shows that all the b n := a n ba −n pairwise commute.Hence we get a well defined epimorphism Z ≀ Z → a, b , and we claim it is an isomorphism.It suffices to show that if (b i 1 ) Hitting a, b with π, since b ∈ ker(π) and one can check that a maps under π to an infinite order element of Aut(T 2 ), we see that q = 0. Now applying braided wreath recursions and using induction on the p i , we see that the only possibility is p 1 = • • • = p ℓ = 0, as desired.Before discussing our main example of the braided Grigorchuk group, let us pin down the kernel of the map π : brAut(T d ) → Aut(T d ), i.e., π : Lemma 1.12.The kernel of π : X S d , the map π is the restriction of the analogous map between these direct products.The kernel of the map on the direct products is clearly the direct product of the P B d ≀ n X P B d .This shows that the kernel of π is the intersection of Corollary 1.13.The kernel of π : brAut(T 2 ) → Aut(T 2 ) is abelian.
Proof.By Lemma 1.12, the kernel is a direct product of copies of P B 2 ∼ = Z.Lemma 1.16.The restriction of π : brAut(T 2 ) → Aut(T 2 ) to brGrig yields an epimorphism from brGrig onto Grig.
Proof.First note that π : B 2 → S 2 sends ζ to (1 2).Thus π : brAut(T 2 ) → Aut(T 2 ) sends a to the element a of Grig.It follows immediately that b, c, and d respectively map under π to b, c, and d.
Momentarily, we will prove that the braided Grigorchuk group is not finitely presented.The proof is inspired by the proof for the Grigorchuk group with some modifications, and we (roughly) follow this proof as given in [dlH00].First we need some setup.
By Lemma 1.15, we see there is a canonical epimorphism from F := Z * Z 2 onto brGrig by mapping the generator of the first copy of Z to a and mapping the generators of Z 2 to b and c.Thus any element in brGrig can be written (non-uniquely) as where the z i are of the form b m i c n i for some m i , n i ∈ Z and are nontrivial except possibly when i = 1 or ℓ + 1.Call an expression of this form reduced.For a reduced expression as above, declare the length, denoted |z 1 a k 1 z 2 • • • a k ℓ z ℓ+1 |, to be the number of terms in the alternating product, so the length is 2ℓ − 1, 2ℓ, or 2ℓ + 1 depending on whether z 1 and/or z ℓ+1 are equal to 1. Similarly, define , the sum of the exponents on the a terms.
Given any word w in the generators a, b, c, and d and their inverses, one can obtain a new word in reduced form by iteratively applying the following reductions and the analogous ones for their inverses: (i) g i g j = g i+j for g ∈ {a, b, c, d} (ii) d −1 = bc (iii) cb = bc Call the resulting word w red .Lemma 1.18.Let w be a reduced expression for an element of brGrig.Consider the braided wreath recursion w = φ(w)(w 1 , w 2 ).Then Proof.Using the braided wreath recursion and applying the reductions we get Thus each pair z i a k i in the alternating product contributes at most one term to w 1 and at most one term to w 2 .The result now follows.
Proof.Let w be an expression in reduced form.To decide if w represents the identity, proceed as follows.and return to (i) which should be checked for both w red 1 and w red 2 .It follows from Lemma 1.18 that the procedure terminates.
Let W red be the set of reduced words, so we can identify W red with F = Z * Z 2 .For w ∈ W red and for j 1 , . . ., j n ∈ {1, 2}, let w red j 1 •••jn denote the reduced word defined inductively by Definition 1.20.For each n ≥ 0, let K n denote the subset of F given by Lemma 1.21.We have K n is normal in F and all the inclusions are strict.
Proof.It is clear that K n = ker Ψ follows from the fact that the procedure in Lemma 1.19 terminates.It remains to show that each K n is normal and that the inclusions are strict.It is clear that K 0 is normal in F and so we proceed by induction.Observe that Let w ∈ K n .We claim that any conjugate of w by one of the generators is again in K n .For a −1 wa, this follows from the fact that |a −1 wa| a = |w| a and that (a −1 wa) 1 = w 2 and (a −1 wa) 2 = w 1 .For the remaining cases, we see that |b −1 wb| a = |c −1 wc| a = |d −1 wd| a = |w| a , and moreover,

Now normality follows from the induction hypothesis.
Finally, we verify that the inclusions are proper.Let σ be the endomorphism of F defined by σ(a) = a −1 c −1 a, σ(b) = d, σ(c) = b, and σ(d) = c.Observe that σ takes reduced words to reduced words and moreover if |w| a = 0 then |σ(w)| a = 0. Also note that σ(a) We claim that σ n (w) and σ n ( w) are in K n+1 but not K n .For the base cases, one easily checks that w and w are both in K 1 but not in K 0 .Now note that σ(w) 1 = w, σ(w) 2 = w, σ( w) 1 = w, and σ( w) 2 = w, so using the base case we get that σ(w) and σ( w) are both in K 2 but not K 1 .Continuing in this way, the result follows by induction.
Proof.Suppose brGrig is finitely presented.As it is a quotient of F , it has a presentation of the form giving brGrig ∼ = F/R where R = ker(Ψ) is the normal closure of r 1 , . . ., r k in F .As each r i is contained in some K n , this contradicts Lemma 1.21.
Anthony Genevois has pointed out to us that Proposition 1.22 also follows from [BGdlH13, Theorem 1.6], which implies that no finitely presented amenable group has Grig as a quotient.
Remark 1.23.Our braided Grigorchuk group brGrig is similar to the torsion-free group of intermediate growth constructed by Grigorchuk in [Gri85, Section 5]; see [All21] for a similar construction (which in discussions with Daniel Allcock we have determined is isomorphic to the group in [Gri85]).The difference is that, phrased in our language, it seems likely that that group would use the braided wreath recursions b = (a, c), c = (a, d), and d = (1, b).We chose c = (a −1 , d) so that we would get bcd = 1, which makes brGrig feel more closely related to Grig.We will leave it as a question for future investigation whether brGrig is isomorphic to the group from [Gri85,All21], and so in particular whether brGrig has intermediate growth.

Braiding groups of almost-automorphisms of trees
In this section we discuss groups of almost-automorphisms of trees, and introduce braided versions.We will use the framework of d-ary cloning systems from [SZ21], which generalize cloning systems from [WZ18].Very loosely, d-ary cloning systems provide a way to construct new Thompson-like groups, and have proven useful in a variety of recent work, for example on decision problems [BZFG + 18], orderability [Ish18], von Neumann algebras [BZ], and the so called Jones technology [Bro21].Let us recall the relevant background.
2.1.Cloning systems.Definition 2.1 (d-ary cloning system).Let d ≥ 2 be an integer and (G n ) n∈N a family of groups.For each n ∈ N let ρ n : G n → S n be a homomorphism to the symmetric group S n , called a representation map.For each 1 ≤ k ≤ n let κ n k : G n → G n+d−1 be an injective function (not necessarily a homomorphism), called a d-ary cloning map.We write ρ n to the left of its input and κ n k to the right of its input, for reasons of visual clarity.Now we call the triple ((G n ) n∈N , (ρ n ) n∈N , (κ n k ) k≤n ) a d-ary cloning system if the following axioms hold: (C1): Here we always have 1 ≤ k < ℓ ≤ n and g, h ∈ G n , and ς n k denotes the standard d-ary cloning maps for the symmetric groups.
The maps ς n k are explained in [SZ21, Example 2.2], and we will review them in Example 2.4 below.
Remark 2.2.For an illustration of a cloning map in the special case G n = brW n (defined in Subsection 2.3), we direct the reader to Figure 2. Given a d-ary cloning system on a family of groups (G n ) n∈N one gets a Thompson-like group, denoted T d (G * ), which can be viewed as a sort of "Thompson limit" of the G n .Let us recall the construction of T d (G * ).First, a d-ary tree is a finite rooted tree in which each non-leaf vertex has d children, and a d-ary caret is a d-ary tree with d leaves.An element of T d (G * ) is represented by a triple (T − , g, T + ) where T ± are d-ary trees with the same number of leaves, say n, and g is an element of G n .There is an equivalence relation on such triples, and the equivalence classes are the elements of T d (G * ).The equivalence relation is given by expansion and reduction: an expansion of (T − , g, T + ) is a triple of the form (T ′ − , (g)κ n k , T ′ + ) where T ′ + is T + with a d-ary caret added to the kth leaf and T ′ − is T − with a d-ary caret added to the ρ n (g)(k)th leaf.A reduction is the reverse of an expansion.Now declare that two triples are equivalent if we can get from one to the other via a finite sequence of expansions and reductions, and write [T − , g, T + ] for the equivalence class of (T − , g, T + ).

Definition 2.3 (Thompson-like group). The Thompson-like group
We have not explained the group operation on T d (G * ).The idea is that given any two elements [T − , g, T + ] and [U − , h, U + ], up to expansions we can assume T + = U − .This is because any pair of d-ary trees have a common d-ary tree obtainable from either of them by adding d-ary carets to their leaves.Now the group operation on when T + = U − .The cloning axioms ensure that this is a well defined group operation.The identity is [T, 1, T ] (for any T ) and inverses are given by [T − , g, Example 2.4 (Cloning permutations).The most fundamental example of a d-ary cloning system is on the family (S n ) n∈N of symmetric groups.Take ρ n : S n → S n to be the identity, and let ς n k : S n → S n+d−1 be the function described as follows.Visualize σ ∈ S n by drawing arrows going up, from a line of labels 1 through n for the domain to another line of labels 1 through n for the range, with an arrow from i to σ(i) Example 2.5 (Cloning braids).The braided version of the above example is a d-ary cloning system on the family (B n ) n∈N of braid groups.Take ρ n : B n → S n to be the natural projection of B n onto S n , and let ϑ n k : B n → B n+d−1 be the function described as follows.Visualize β ∈ B n as an n-strand braid diagram, counting the strands 1 through n at the bottom.Now (β)ϑ n k ∈ B n+d−1 is obtained by replacing the kth strand (counting at the bottom) by d parallel strands.As discussed in [WZ18, Remark 2.10], in the d = 2 case this really defines a cloning system (this was essentially already shown by Brin in [Bri07], before cloning systems had been introduced, using the language of Zappa-Szép products), and it is easy to see that in the arbitrary d case it defines a d-ary cloning system.The Thompson-like group T d (B * ) that arises from this d-ary cloning system is (isomorphic to) the braided Higman-Thompson group brV d , considered previously by Aroca and Cumplido in [AC22], and the first author and Wu in [SW].
2.2.Almost-automorphisms. Every automorphism of T d induces a self-homeomorphism of the boundary ∂T d , which is a d-ary Cantor space.The idea behind almost-automorphisms of T d is to consider self-homeomorphisms of ∂T d that locally "look like" they came from Aut(T d ).Far more detail and rigor can be found for example in [LB17] and [SZ21, Subsection 1.3].For our purposes here, we will use the isomorphism in [SZ21, Theorem 2.6] to simply define the group of almost-automorphisms of T d as the Thompson-like group arising from the following cloning system.
For n ∈ N, let W n := S n ≀ Aut(T d ) (in [SZ21] this was denoted A n , but here we will use W n ).Here the wreath product has no subscript, and so this should be interpreted as meaning there are n copies of Aut(T d ) and S n acts on {1, . . ., n} in the standard way.Following [SZ21, Subsection 2.2], we will define a d-ary cloning system on (W n ) n∈N .Let ρ n : W n → S n be the natural epimorphism onto the S n term, i.e., To define the d-ary cloning maps κ n k : W n → W n+d−1 we need some notation.Given As proved in [SZ21, Proposition 2.4], these ρ n and κ n k define a d-ary cloning system on the W n .

Definition 2.6 (Group of almost-automorphisms). The group of almost-automorphisms
where (W n ) n∈N is equipped with the above d-ary cloning system.
where (S n ≀ G) n∈N is equipped with the above d-ary cloning system.This definition agrees with the usual definition first given by Nekrashevych [Nek04], thanks to [SZ21, Corollary 2.7].
The Röver group V 2 (Grig) was first constructed by Röver in [Röv99], and generalized by Nekrashevych in [Nek04] to the full family of Röver-Nekrashevych groups V d (G).Röver proved that V 2 (Grig) is isomorphic to the abstract commensurator of Grig, and is a finitely presented simple group [Röv99,Röv02].Belk and Matucci [BM16] proved that it is even of type F ∞ .Analogous results for certain V d (G) were proved by Nekrashevych [Nek04], Farley and Hughes [FH15], and the authors [SZ21].
2.3.Braiding groups of almost-automorphisms. Now we will introduce braided Röver-Nekrashevych groups.Starting with self-identical groups, this was previously done by Aroca and Cumplido in [AC22], but for self-similar groups that are not self-identical, to the best of our knowledge this has not been done.In particular using the braided Grigorchuk group to construct a braided Röver group is new.As a remark, Aroca and Cumplido's constructions could have been phrased in the language of cloning systems, as they mention in their introduction (though they did not use this framework outside their introduction), so one can view our approach here as a direct generalization of theirs.

Convention:
The notation B n ≀ G, i.e., with no subscript on the ≀, will always mean B n ≀ {1,...,n} G defined via the action of the braid group B n on {1, . . ., n} coming from the natural projection B n → S n .
Recall that brAut( We want to define a d-ary cloning system on (brW n ) n∈N .We will use the notation ρ n and κ n k like we did in the non-braided case for the cloning system on (W n ) n∈N , and no confusion should arise.Let ρ n : brW n → S n be the composition of brW n → W n with W n → S n , where the first map is induced by the standard epimorphism B n → S n together with π : brAut(T d ) → Aut(T d ), and the second map is the ρ n epimorphism from the non-braided case.To define the d-ary cloning maps κ n k : brW n → brW n+d−1 we need some notation.Given k is injective, since ϑ n k is injective and f k is uniquely determined by its braided wreath recursion.See Figure 2 for an example.id f We use thick lines to indicate the strand getting cloned and the resulting strands.
) is a d-ary cloning system.Proof.The proof is similar to that of [SZ21, Proposition 2.4] about the non-braided situation, and some parts work in exactly the same way.Hence, in the course of this proof, we will sometimes just state that a certain step works analogously to the corresponding step in [SZ21, Proposition 2.4].First we prove (C1) (cloning a product).Let f = β(f 1 , . . ., f n ) and g = γ(g 1 , . . ., g n ) be elements of brW n , so the product f g equals βγ(f γ(1) g 1 , . . ., f γ(n) g n ).
Here B n acts on {1, . . ., n} via the projection B n → S n , and the notation γ(i) indicates this action.Similar to the proof of [SZ21, Proposition 2.4], the left-hand side of (C1) is Here the braided wreath recursions of f γ(k) and . Now we need to show that the right-hand side of (C1), which is (f )κ n γ(k) (g)κ n k , equals the same thing.One can compute (similar to the proof of [SZ21, Proposition 2.4]) that this equals where the superscript indicates conjugation in brW n+d−1 .By the same argument as in the proof of [SZ21, Proposition 2.4], the "tuple parts" of the left-and right-hand sides of (C1) are the same, so we only need to show that the "braid parts" are the same, i.e., that (βγ Since we already know the ϑ n k define a d-ary cloning system on braid groups, we know (βγ)ϑ n k = (β)ϑ n γ(k) (γ)ϑ n k , and since φ is a homomorphism this means it suffices to show that (γ) To see this, note that the kth through (k + d − 1)st strands of (γ)ϑ n k are all parallel to each other, and these are the only strands of φ (k) (f γ(k) ) that can braid non-trivially; see Figure 3.
Next, (C2) follows by an exactly analogous argument to the proof of [SZ21, Proposition 2.4].
Our main example is the following: Definition 2.11 (Braided Röver group).We define the braided Röver group to be the group brV 2 (brGrig).
See Figure 4 for an example of an element of the braided Röver group.
There is an obvious relationship between braided Röver-Nekrashevych groups and (nonbraided) Röver-Nekrashevych groups, analogous to how the braided Thompson group brV surjects onto Thompson's group V .Given a braided Röver-Nekrashevych group brV d (G), we get a well defined epimorphism where π(G) is the image of G under π : brAut(T d ) → Aut(T d ).This epimorphism (which by abuse of notation we are also denoting by π) is given by sending The d-ary cloning systems on (B n ≀G) n∈N and (S n ≀π(G)) n∈N are clearly respected by π, so this map really is well defined.
Remark 2.12.The kernel of π : brV such that β is pure and each f i lies in the kernel of π : brAut(T d ) → Aut(T d ).By Lemma 1.12 each of these kernels is a direct product of copies of P B d .Overall this means that the kernel of π : brV pure braid groups P B n with infinitely many copies of P B d , with the direct limit informed by the cloning maps.

Finiteness properties
In this section we inspect finiteness properties of braided Röver-Nekrashevych groups.The main result of this section is: The case when G is braided self-identical was already proved in [SW], where it was shown that for braided self-identical G the converse of Theorem 3.1 is also true.(In general the converse of Theorem 3.1 is not always true, as our Theorem 4.1 will show.)3.1.Stein-Farley complexes.The starting point for deducing finiteness properties for a Thompson-like group is often to construct a so called Stein-Farley complex on which the group can act.For groups of the form T 2 (G * ), i.e., those arising from (2-ary) cloning systems, this was done in [WZ18].For groups of the form T d (S * ≀G), i.e., Röver-Nekrashevych groups, the Stein-Farley construction was done in [SZ21].For arbitrary groups of the form T d (G * ), i.e., those arising from d-ary cloning systems in general, the Stein-Farley construction has not technically been done in the literature, but it is easy to mimic the 2-ary construction, and this is the goal of this subsection.Also see [Zar21] for an introductory take on the situation when d = 2 and G m = {1} for all m, i.e., for Thompson's group F .The name Stein-Farley complex pays homage to Stein [Ste92] and Farley [Far03], who constructed complexes like these for the classical Thompson groups and some close relatives.
Given a d-ary cloning system ((G m ) m∈N , (ρ m ) m∈N , (κ m k ) k≤m ) we will construct a cube complex, denoted by X d (G * ), called the Stein-Farley complex for the d-ary cloning system.This is done in a number of steps.
A groupoid: First we consider the set of equivalence classes [F − , g, F + ], where F − is a d-ary forest, say with m leaves (and some number of roots), g is an element of G m , and F + is a d-ary forest with m leaves (and some number of roots).The equivalence relation on such triples is given by the expansion and reduction moves, as with elements of T d (G * ).This set is a groupoid; two elements [F − , g, F + ] and [E − , h, E + ] can be multiplied whenever the number of roots of F + equals the number of roots of E − .In this case, up to expansions we can assume F + = E − , and the multiplication in this groupoid works analogously to the multiplication in T d (G * ).Multiplication is well defined in the groupoid for all the same reasons that it is well defined in T d (G * ).Denote this groupoid by G d (G * ).
A poset: Now we restrict to equivalence classes of triples of the form [T − , g, F + ] for T − a d-ary tree, and mod out an additional equivalence relation given by right multiplication by elements of the form [1, g ′ , 1], for 1 a trivial forest with some number of roots, m, and g ′ ∈ G m .Denote the resulting equivalence classes by [T − , g, F + ] G , and write P d (G * ) for the set of all of them.Given [T − , g, F + ] G ∈ P d (G * ), say with F + having m roots, and a groupoid element of the form [F, 1, 1] for F a d-ary forest with m roots, it makes sense to consider the product [T − , g, F + ][F, 1, 1] and the equivalence class [T − , g, F + ][F, 1, 1] G .We define a partial order ≤ on P d (G * ) by declaring (Note that thanks to the equivalence relation, in fact we have for any relevant g ′ .)It is easy to see that ≤ is reflexive, transitive, and antisymmetric, hence really is a partial order.It is also clear that More generally, if E is any elementary d-ary forest with the same number of roots as F + , then all the vertices of the form [T − , g, F + ][E ′ , 1, 1] G , for E ′ obtained from E by replacing some number of d-carets with trivial trees, span the 1-skeleton of a cube in X d (G * ), and we declare that there is a cube in X d (G * ) with this 1-skeleton.All of this is well defined up to the equivalence relation.Any non-empty intersection of cubes is a common face of each of them, so X d (G * ) really is a cube complex.Within a given cube, the geometric realization of the finite subposet of P d (G * ) given by the vertices of the cube is naturally a subdivision of the cube.Hence there is a natural subdivision of X d (G * ) that is identifiable with a subcomplex of |P d (G * )|.
A Morse function: Let h : X d (G * ) (0) → N be the function sending [T − , g, F + ] G to the number of roots of F + , and call this the number of feet of this vertex.Note that adjacent vertices have distinct h values.By the construction of X d (G * ), it is clear that h can be extended to a map h : X d (G * ) → R that restricts to an affine map on each cube.Hence, h satisfies all the requirements to be a discrete Morse function, in the sense of Bestvina-Brady [BB97].In particular we will be allowed to use discrete Morse theory when it comes up later.The function h also comes into play when proving that X d (G * ) is contractible, which we do shortly.
Upward-local finiteness: The main advantage of X d (G * ) over |P d (G * )| is that the former is what we will call "upward-locally finite", as we now explain.Note that there are only finitely many elementary d-ary forests with a given number of roots.Also note that for any In particular, given any vertex x = [T − , g, F + ] G of X d (G * ), every vertex y with x y is of the form y = [T − , g, F + ][E, 1, 1] G for some elementary d-ary forest E. (Indeed, a priori y is of the form [T − , g, F + ][1, h, 1][E, 1, 1] G , but the above shows that we can ignore the [1, h, 1] factor for the purposes of characterizing y.)We conclude that for any x there exist only finitely many y with x y.We refer to this property by saying that X d (G * ) is upward-locally finite.
Contractibility: To see that X d (G * ) is contractible, we will show that the inclusion   Y, ⊑) is called conically contractible if there is a y 0 in Y and a poset map g : Y → Y such that z ⊑ g(z) ⊒ y 0 for all z in Y .A consequence of a poset being conically contractible is that its geometric realization is contractible.Since a poset and its opposite poset have isomorphic geometric realizations, we can also use the criterion z ⊒ g(z) ⊑ y 0 .See the discussion in [Qui78, Section 1.5] for more details.Now given any z ∈ (x, y], define g(z) to be the largest element of [x, z] such that x g(z) (the idea is to replace any d-ary forest with its unique largest elementary subforest).By our hypothesis, g(z) is in [x, y) and it is also clearly in (x, y] so we have g(z) ∈ (x, y).Let y 0 = g(y).Note that for any z ∈ (x, y), we have g(z) ≤ y 0 .Therefore, z ≥ g(z) ≤ y 0 and (x, y) is conically contractible.
Action and stabilizers: The group T d (G * ) acts on X d (G * ) by left multiplication, which is well defined since the equivalence relation defining vertices of X d (G * ) and the partial order dictating which vertices span cubes are both given by right multiplication.Note too that h is invariant under this action.We claim that the stabilizer of a vertex with h value m is isomorphic to G m .Given such a vertex [T − , g, F + ] G and an ele- has m roots, the "1" here is the trivial forest with m roots, and h ′ ∈ G m ).Thus [U − , h, U + ] → h ′ provides the desired isomorphism from the vertex stabilizer to G m .Now we claim that any cube stabilizer is a finite index subgroup of a vertex stabilizer.Consider a cube in X d (G * ), say with x its unique vertex with minimum h value and y its unique vertex with maximal h value.Since the action preserves h, the cube stabilizer lies in the stabilizer of the vertex x (and that of y).Since X d (G * ) is upward-locally finite, Symm({z | x z}) is finite, so the kernel of Stab(x) → Symm({z | x z}) has finite index in Stab(x).This kernel clearly fixes our cube pointwise, so we conclude that the stabilizer of the cube has finite index in the stabilizer of x.Let us summarize all of the above: Proposition 3.2.The group T d (G * ) acts on the contractible cube complex X d (G * ) with cube stabilizers isomorphic to finite index subgroups of the G m .The action on each X d (G * ) h≤m is cocompact.
Remark 3.3.In [SZ21] there is a more general construction given for a self-similar group G, called the H-Stein-Farley complex for H ≤ G, with the H = G case recovering the original Stein-Farley complex.One could also fully generalize the H-Stein-Farley complexes from [SZ21] as we have just done in the H = G case, to some sort of (H * )-Stein-Farley complexes for H m ≤ G m .This would be quite technical and tedious in general, and besides getting the braided Röver group to be F ∞ it is unclear what this would buy us at the moment.Hence we will do this (in the following subsection) just for the braided Röver group, where we can follow the comparatively easier roadmap from [BM16].
3.2.Descending links.In this subsection and the next, we prove Theorem 3.1.In a nowstandard approach, we will combine Proposition 3.2 with Brown's Criterion and discrete Morse theory to reduce the problem to an analysis of descending links.First let us recall some background on discrete Morse theory and descending links in general.Let Y be an affine cell complex, in the sense of [BB97].Let h : Y → R be a map such that the image of the vertex set of Y is a closed, discrete subset of R. If the restriction of h to every positive-dimensional cell is a non-constant affine map, then we call h a Morse function.These conditions ensure that for every cell there is a unique vertex at which h achieves its maximum value on that cell.The descending star st ↓ v of a vertex v is the subcomplex of Y consisting of all cells for which v is this vertex with maximum h value.The descending link lk ↓ v of v is the link of v in st ↓ v, i.e., the space of directions out of v along which h strictly decreases.(One could analogously define ascending stars and links, but here we will only use the descending version.) The point of Morse theory is that an understanding of the descending links can translate to an understanding of the whole complex.The following essentially combines the Morse Lemma from [BB97] with Brown's Criterion from [Bro87], to produce a sufficient condition for a group to be of type F n .See [SZ21, Lemma 3.1] for an F ∞ version of the following, which works exactly analogously for F n .
Citation 3.4 (Brown's Criterion plus discrete Morse theory).Let Γ be a group acting cellularly on an (n − 1)-connected CW complex X.Suppose the stabilizer of any p-cell is of type F n−p .Let h : X → R be a Γ-invariant Morse function such that the sublevel complexes X h≤m are Γ-cocompact for each m ∈ R. If there exists t ∈ R such that for all x ∈ X (0) with h(x) ≥ t we have that lk ↓ x is (n − 1)-connected, then Γ is of type F n .Now let us discuss descending links in X d (G * ).Since X d (G * ) is a cube complex, the link of a vertex v is a simplicial complex, with a k-simplex for each (k + 1)-cube containing v. The descending link is the subcomplex whose simplices correspond to cubes for which the vertex is the one with maximum h value, i.e., the most feet.Thus, a k-simplex in lk ↓ v, say with h(v) = m, is represented by v[1, g, E] G , for g some element of G m and E some elementary d-ary forest with m leaves and k + 1 carets.The face relation is given by removing carets from E. Note that the barycentric subdivision of lk ↓ v is naturally a subcomplex of |P d (G * )|, namely the full subcomplex spanned by all the v[1, g, E] G .
There is a convenient model for the descending links.Note that, up to the action of T d (G * ), lk ↓ v only depends on h(v).Thus the following complex is isomorphic to every descending link of a vertex with m feet: Definition 3.5 (Model for descending link).Let L m d (G * ) be the simplicial complex with a k-simplex for each [1, g, E] G for g ∈ G m and E an elementary d-ary forest with m leaves and k + 1 carets, with face relation given by removing carets from E.
The culmination of Subsections 3.1 and 3.2 is the following, which holds for any d-ary cloning system: Proposition 3.6.Suppose G m is of type F n for all m, and that L m d (G * ) is (n − 1)connected for all but finitely many m.Then T d (G * ) is of type F n .
Proof.We look at T d (G * ) acting on X d (G * ), with the Morse function h, and verify the requirements from Citation 3.4.By Proposition 3.2, X d (G * ) is contractible (hence (n − 1)connected), the stabilizer of any p-cube is isomorphic to a finite index subgroup of some G m , so is of type F n (hence F n−p ) by assumption, and the sublevel complexes are all cocompact.Since L m d (G * ) is (n − 1)-connected for all but finitely many m, the statement about descending links holds, and so we are done.
3.3.Descending links in the braided case.Now we return to the special case from Subsection 2.3.We have a braided self-similar group G ≤ brAut(T d ) of type F n , and need to prove that brV d (G) = T d (B * ≀ G) is of type F n .As indicated by Proposition 3.6, the key thing to show is that L m d (B * ≀ G) is (n − 1)-connected for all but finitely many m.To analyze the higher connectivity of L m d (B * ≀ G), we will use a strategy that essentially comes from [BFM + 16] in the case when G = {1} and d = 2, and more generally from [SW] in the case when G is braided self-identical.
The idea is to map L m d (B * ≀ G) to a complex that is easier to understand.We will use the following complex, considered in [SW].
Definition 3.7 (d-marked point disk complex).Let S g b,m be a surface with b boundary components, m marked points, and genus g.The d-marked-point-disk complex D d (S g b,m ) is the simplicial complex defined as follows.A k-simplex is an isotopy class of k + 1 disjointly embedded disks such that each disk encloses precisely d marked points in its interior and has no marked points in its boundary.(Here whenever we say "isotopy" it is implicit that all the intermediate maps in the isotopy must satisfy these rules as well, e.g., marked points cannot drift out of the interior of the disk and then back in.)The face relation is given by taking subsets.
Remark 3.8.This complex is related to the curve complex first defined by Harvey in [Har81], namely, outside some low-complexity cases, D d (S g b,m ) can be viewed as a full subcomplex of the curve complex.Indeed, given a disk enclosing d marked points we can take its boundary curve, which "usually" gives a vertex in the curve complex.This fails if the boundary curve bounds a disk, a punctured sphere, or an annulus on the other side, which can only happen if m ≤ d + 1.It might also happen that two disks are disjoint up to isotopy but their boundary curves are isotopic, which can happen when m = 2d.
) in a certain way.First we describe a useful alternate viewpoint of elementary d-ary forests.Let L m−1 be the linear graph with m vertices, that is the graph with m vertices labeled 1 through m, and m − 1 edges, one connecting i to i + 1 for each 1 ≤ i < m.Call a subgraph of L m−1 a d-matching on L m−1 if each of its connected components is a subgraph of length d − 1.The set of d-matchings forms a simplicial complex called the d-matching complex, denoted by M d (L m−1 ), where a matching forms a k-simplex whenever it consists of k+1 disjoint paths, and the face relation is given by inclusion.Observe that there is a bijection between the set of elementary dary forests with m leaves and the set of d-matchings on L m−1 .Under the identification, d-carets correspond to paths of length d − 1. See Figure 5 for an example.Let S m = S 0 1,m be the unit disk with m marked points given by fixing an embedding L m−1 ֒→ S m of the linear graph with m − 1 edges into S 0 1,m (so the marked points are the images of the vertices).The braid group B m on m strands is isomorphic to the mapping class group of the disk with m marked points [Bir75], so we have an action of B m on D d (S m ), which will be convenient to take to be a right action.
Define a map µ : , first view the elementary d-ary forest E as a d-matching in M d (L m−1 ) as above.Then take a disk tubular neighborhood of the d-matching, call it D E , to obtain a simplex in D d (S m ).Forget the labels (f 1 , . . ., f m ), and then act on D E by applying β −1 on the right.In this way we obtain a simplicial map Lemma 3.9.The map µ is well defined.
Proof.Say E has q roots.Let γ(g 1 , . . ., g q ) ∈ B q ≀ G, so Note that γ ′ is obtained by taking γ, turning each strand corresponding to a root of E with a d-caret on it into d parallel strands (call this intermediate braid γ ′′ ), and then on each such collection of d parallel strands applying some φ(g i ) ∈ B d to it (where φ is as in Subsection 1.1).When acting on D E though, since each of these local copies of the φ(g i ) are supported in the interior of one of the disks in the disk system, they do not change the (equivalence class of the) disk system.It is clear that (D E )γ ′′ = D E ′ , so we conclude that also One can visualize µ as taking [1, β(f 1 , . . ., f n ), E] G , viewing it as the braid β with strands labeled by the f i at the bottom and with E serving to "merge" strands together, and then forgetting the labels f i , considering the merges as d-matchings, enlarging them to disks, "combing straight" the braid, and seeing where the disks are taken.See Figure 6 for an example.Note that the resulting simplex (D , so in particular µ is simplexwise injective.Also note that if d > 2 then the φ(g i ) from the proof of Lemma 3.9 could change the dmatchings, but cannot change their corresponding disks, hence why we use disk complexes instead of, say, arc complexes.
).The successive pictures show the process of flattening to a 3-matching, expanding the matching to disks, forgetting the labels, and "combing straight" the braid.
In the following proofs, we will need a useful tool introduced by Hatcher and Wahl called the complete join [HW10].Definition 3.10 (Complete join (complex)).A surjective simplicial map ν : Y → X is called a complete join if it satisfies the following properties: (1) ν is simplexwise injective.
(2) For each k-simplex σ of X, say with vertices v 0 , . . ., v k , the fiber ν −1 (σ) equals the join In this case we call Y a complete join complex over X. Definition 3.11 (Weakly Cohen-Macaulay (wCM)).A simplicial complex X is called weakly Cohen-Macaulay (wCM) of dimension n if X is (n − 1)-connected and the link of each k-simplex of X is (n − k − 2)-connected.(Note that X need not necessarily be n-dimensional.) The main result regarding complete joins that we will use is the following.Citation 3.12.[HW10, Proposition 3.5] If Y is a complete join complex over a complex X that is wCM of dimension n, then Y is also wCM of dimension n.

Now we would like to use the map
, and hence of the descending links in the Stein-Farley complex.First we need the following, which is proved in [SW]: ) is ( m+1 2d−1 − 2)-connected by Citation 3.13, we just need to prove that the link of any k-simplex is ( ).Let S ′ be the surface obtained from S g b,m by removing the interiors of the D i , including the d(k + 1) many marked points in their interiors, leaving k + 1 new boundary components.Since the D i are pairwise disjoint, S ′ is connected, and hence is of the form S g b+(k+1),m−d(k+1) .The link of σ is therefore isomorphic to D d (S g b+(k+1),m−d(k+1) ), which is ( m−d(k+1)+1 2d−1 − 2)-connected by Citation 3.13.Since −d(k+1)  2d−1 ≥ −(k + 1), this is also ( m+1 2d−1 − k − 3)-connected, so we are done.Proposition 3.15.For any d ≥ 2 and any m ∈ N, the complex ) is wCM of dimension ⌊ m+1 2d−1 ⌋ − 1 by Corollary 3.14, it suffices by Citation 3.12 to prove that µ : ) is a complete join.We know that µ is surjective and simplexwise injective.Now we need to show that the fiber under µ of any simplex in D d (S 0 1,m ) is the join of the fibers of its vertices.Clearly the fiber of the simplex lies in the join of the vertex fibers, so we need to prove the reverse inclusion.This means that we need to prove that any collection of k and e some elementary d-ary forest with exactly one d-caret.Since µ(σ) to the elementary d-ary forest obtained as the union of E and e, we therefore have that [1, β(f 1 , . . ., f m ), E ′ ] G is a k-simplex containing both σ and v 0 .Now we can prove Theorem 3.1.
Proof of Theorem 3.1.We have a braided self-similar group G ≤ brAut(T d ) of type F n , and need to prove that brV since a direct product of finitely many type F n groups is of type F n , and an extension of a type F n group (like B d ) by a type F n group is type F n ; see, e.g., [Geo08, Theorem 7.2.21].Hence by Proposition 3.6, we just need to prove that L m d (B * ≀ G) is (n − 1)-connected for all but finitely many m.This follows from Proposition 3.15, since ⌊ m+1 2d−1 ⌋ − 2 goes to ∞ with m.

Finiteness properties of the braided Röver group
This section is entirely about the braided Röver group brV 2 (brGrig).For brevity let us write brR for the group, and we will also introduce other concise notation as we go.The main result of this section is the following: Note that brGrig is not even finitely presented (Lemma 1.22) much less F ∞ , so Theorem 3.1 does not apply.In particular brR shows that the converse of Theorem 3.1 is not true in general, in contrast to the braided self-identical case done in [SW].Our roadmap is Belk and Matucci's proof that the Röver group V 2 (Grig) is of type F ∞ [BM16].We will also make use of the constructions from Section 3.
To begin, we return to the groupoid G :=G 2 (B * ≀brGrig) of elements of the form [F − , g, F + ], for F ± forests with m leaves and g ∈ B m ≀ brGrig.(In this section all trees and forests are binary.)As before, consider elements of the form [T − , g, F + ] (for T − a tree), and mod out an equivalence relation given by right multiplication by elements of the form [1, g ′ , 1], but this time only do so for g = β(f 1 , . . ., f m ) with The reason for doing this is that for the resulting equivalence classes, and write ∼ Z for the equivalence relation.
As before, define a partial order on these equivalence classes [τ ] Z (for τ a triple of the form τ = (T − , g, F + )) by declaring that [τ ] Z ≤ [τ ][F, 1, 1] Z for any forest F with m roots.Note that we must account for changing representatives up to ∼ Z , so we moreover have This is not transitive as defined, since we must account for changing representatives up to ∼ Z , so we actually take the transitive closure.Thus an upper bound of Z for F i some forests and g ′ i elements of the relevant braid groups wreathed with Z (not with all of brGrig, to reiterate).Write P 2 (B * ≀ brGrig) Z for this poset, or P Z for short.Lemma 4.2.For any g ∈ B q ≀ brGrig, there exists a forest F such that [1, g, 1][F, 1, 1] = [F ′ , g ′ , 1] for some F ′ and some g ′ not only in B m ≀brGrig but even in B m ≀Z for appropriate m.
Proof.Intuitively, this means that we can apply successive braided wreath recursions to g until all the "a"s are gone.
First note that if g ∈ B q then the result holds for any F , not just some F , so without loss of generality g has no "braid part", i.e., g ∈ q brGrig (and at this point the desired F ′ will be F ). Now clearly without loss of generality q = 1, so g ∈ brGrig, and we are looking for a tree for z i ∈ Z and k i ∈ Z, as a reduced expression in the sense of Lemma 1.18.We will induct on the length of this expression.If the length is 1 and g ∈ Z, we can just take T to be trivial, and if the length is 1 and g is a power of a then we can take T to be a single caret.Now assume the length is greater than 1.Let ∧ be the tree with one caret, so [1, g, 1] = [∧, (g)κ 1 1 , ∧].We have that (g)κ 1 1 is of the form ζ k (g 1 , g 2 ) for some k ∈ Z and g 1 , g 2 ∈ brGrig, and by Lemma 1.18 the length of each of g 1 and g 2 is less than that of g.By induction we can therefore choose a tree Corollary 4.3.The poset P Z is directed, so its geometric realization is contractible.
Proof.Let [T − , g, F + ] Z and [U − , h, D + ] Z be elements of P Z .Up to taking upper bounds, we can assume F + and D + are trivial.Now observe that thanks to Lemma 4.2 there exist forests F and This shows that, up to taking upper bounds, we can assume g and h are trivial.At this point our elements are [T − , 1, 1] Z and [U − , 1, 1] Z , which clearly have an common upper bound.
Our next goal is to construct an analog of the Stein-Farley complex.It will no longer have a cubical structure, but it will have a polysimplicial structure.First we need some definitions and notation.Definition 4.4 (Direct sum).Given braids β ∈ B m and β ′ ∈ B m ′ , the direct sum β ⊕ β ′ is the element of B m+m ′ obtained by setting β and β ′ next to each other, so the first m strands braid according to β, and the last m ′ strands braid according to β ′ .Given a forest F with q roots and a forest F ′ with q ′ roots, the direct sum F ⊕ F ′ is the forest with q + q ′ roots whose first q trees comprise F and whose last q ′ trees comprise for g i ∈ B m i ≀ Z (for appropriate m i ) a splitting, so in the poset P Z we have [τ ] Z ≤ [τ ]∆ Z for any splitting ∆.Call this a one-head splitting if F 1 is a tree.A simple splitting is one that is ∼ Z -equivalent to a direct sum of finitely many copies of 1 together with a one-head splitting ∆.Intuitively, a splitting is simple if only one "head" actually gets split.Note that every splitting is a product of simple splittings.Definition 4.6 (Weakly elementary).Write ∧ for the tree with one caret.Write ∧ 2 for the tree obtained from ∧ by adding a caret to its left leaf.Call a splitting weakly elementary if it is ∼ Z -equivalent to a direct sum of finitely many splittings, each of which is of one of the following forms: Let us abuse notation and write 1 = [1, 1, 1], ∧(a k , 1) = [∧, (a k , 1), 1], and ∧ 2 = [∧ 2 , 1, 1], so the weakly elementary splittings are those that are ∼ Z -equivalent to direct sums of copies of 1, ∧(a k , 1) (k ∈ Z), and ∧ 2 .
) really is a splitting.Also note that any weakly elementary simple splitting is ∼ Z -equivalent to a direct sum of finitely many copies of 1 together with a single splitting of the form 1, ∧(a k , 1) for some k ∈ Z, or ∧ 2 .
For [τ ] Z ∈ P Z and ∆ a splitting such that the product [τ ]∆ makes sense, so for all i < j.The weakly elementary simplices form a subcomplex of |P Z |.We will denote this subcomplex by X 2 (B * ≀ brGrig) Z , or X Z for short, and call it the Z-Stein-Farley complex for the braided Röver group.(Later we will identify X Z with a polysimplicial complex that is more akin to the Stein-Farley cube complexes constructed earlier for general d-ary cloning systems.)Proposition 4.7.The Z-Stein-Farley complex X Z is contractible.
Proof.We can follow the argument in Subsection 3.1 that the usual Stein-Farley complex for a d-ary cloning system is contractible, in exactly the same way, and reduce the problem to proving that the realization |(x, y)| is contractible, for any x ≤ y in P Z with x y.This in turn will follow by the same argument as in Subsection 3.1, provided we can show that for any x ≤ y with x y there exists a unique largest y 0 ∈ (x, y) such that x y 0 .Without loss of generality x = 1.Analogously to the proofs of Lemma 4.7 and Proposition 4.8 of [BM16] (for the Röver group), it suffices to prove that if we have both ∧(a k , 1) Z ≤ y and ∧(a ℓ , 1) Z ≤ y for some k = ℓ then ∧ 2 Z ≤ y.Let ∆ and ∆ ′ be splittings such that ∧(a k , 1)∆ Z = y and ∧(a ℓ , 1) for some z, z ′ ∈ Z and some splittings ∆ and ∆ ′ (that is, neither ∆ nor ∆ ′ can involve "splitting the first head").But then ∆ −1 (a ℓ−k , 1)∆ ′ is the direct sum of z −1 a ℓ−k z ′ with some element of B m−1 ≀ Z, which implies z −1 a ℓ−k z ′ ∈ Z, a contradiction since a ℓ−k ∈ Z.We conclude that ∧ 2 Z ≤ y.
4.1.Polysimplicial structure.Now let us describe the polysimplicial structure on X Z .A polysimplex is a euclidean polytope that is a product of simplices.A polysimplicial complex is an affine cell complex whose cells are polysimplices, and such that any two cells intersect in a (possibly empty) common face of each.Polysimplicial complexes are a simultaneous generalization of simplicial and cubical complexes.The polysimplicial structure on X Z is built out of the following pieces: Definition 4.8 (Basic polysimplex, bottom vertex).Let [τ ] Z be a vertex in X Z , say with h([τ ] Z ) = m (here h is the "number of feet" function from before).For each 1 ≤ i ≤ m let S i be one of the following sets: {1}, {1, ∧(a k , 1)} for some k ∈ Z, {1, ∧ 2 }, or {1, ∧(a k , 1), ∧ 2 } for some k ∈ Z.
Then the corresponding basic polysimplex poly([τ ]; S 1 , . . ., S m ) is the full subcomplex of X Z spanned by the vertex set The bottom vertex of this basic polysimplex is [τ ] Z .
Note that poly([τ ]; S 1 , . . ., S m ) is a subdivision of a product of simplices, one for each S i , where the dimension of the simplex corresponding to S i is |S i | − 1.In particular it makes sense to view this as a polysimplex.
It is clear that every weakly elementary simplex lies in some basic polysimplex, so the basic polysimplices cover X Z .To see that the basic polysimplices form a polysimplicial complex with X Z as a simplicial subdivision, it remains to show that any intersection of two basic polysimplices is a common face of each.Before proving this, we need a definition.Definition 4.9 (Depth, non-expanding).For a forest F , the depth of a leaf is the distance from the leaf to the root of the tree in F containing the leaf.Let [F − , β(g 1 , . . ., g m ), F + ] ∈ G .Call this groupoid element non-expanding at the jth foot if for every leaf of the jth tree of F + , say it is the ith leaf of F + , we have that the depth of the ith leaf in F + is at most the depth of the π(β)(i)th leaf of F − .(Note that this property is invariant under expansions and reductions, so is well defined on elements of G .)If an element is non-expanding at the jth foot for all j, call it non-expanding.
The terminology "non-expanding" is inspired by the non-braided case, as in [BM16], where groupoid elements are homeomorphisms between disjoint unions of copies of the Cantor set.
Lemma 4.10.Any intersection of two basic polysimplices is a common face of each.
Proof.The proof of Lemma 5.3 of [BM16] for the Röver group can almost be copied verbatim for the braided case (up to changing notation and some left/right conventions), with just one step requiring justification, which we will point out when we reach it.Let P = poly([τ ]; S 1 , . . ., S m ) and Q = poly([ω]; T 1 , . . ., T q ) be basic polysimplices.Each S i has a natural total order, consistent with ≤ in P Z when considered up to the "mod Z" Note that B m ≀ Z ∼ = Stab brR ([τ ] Z ), and analogously to the argument in Subsection 3.1, this isomorphism can be realized as Hence the restriction of η to P B m lands in Stab 0 brR (P ).The standard projection B m ≀ Z → B m induces, via η, an epimorphism θ : Stab brR ([τ ] Z ) → B m .We have shown that the image of Stab 0 brR (P ) under θ contains P B m , and so has finite index in B m .The kernel of θ is isomorphic to Z m .Since any finite index subgroup of B m is of type F ∞ , and since any subgroup of Z m is finitely generated free abelian, hence type F ∞ , we conclude that Stab 0 brR (P ) is of type F ∞ , being an extension of a type F ∞ group by a type F ∞ group.Since Stab 0 brR (P ) has finite index in Stab brR (P ), we are done.The failure of X Z to be upward-locally finite not only makes the stabilizer argument harder, but also makes the cocompactness argument harder.Let X h≤m Z be the full subcomplex of X Z spanned by all vertices with at most m feet.
Lemma 4.12.For each m ∈ N, the sublevel complex X h≤m Z is cocompact under the action of brR.
Proof.By the same argument as in Subsection 3.1 for X d (G * ), the action is transitive on vertices with a given number of feet, so in X h≤m Z there are finitely many (in fact exactly m) vertex orbits.However, since we no longer have upward-local finiteness, we need to do more work to see that there are finitely many polysimplex orbits.It suffices to prove that for any vertex [τ ] Z , there are finitely many Stab brR ([τ ] Z )-orbits of polysimplices with [τ ] Z as their bottom vertex.Let P = poly([τ ]; S 1 , . . ., S m ) be a polysimplex with [τ ] Z as its bottom vertex.As in the proof of Lemma 4.11, we have (Recall that ζ is our chosen generator of B 2 ∼ = Z, with a = ζ(1, 1).)Define the signature ||S i || of S i to be 1 if S i = {1}, 2 if S i = {1, ∧(a k , 1)} for some k ∈ Z, 3 if S i = {1, ∧ 2 }, and 4 if S i = {1, ∧(a k , 1), ∧ 2 } for some k ∈ Z. Extrapolating using direct sums, the above calculations show that the Stab brR ([τ ] Z )-orbit of P includes every poly([τ ]; T 1 , . . ., T m ) with ||T i || = ||S i || for each 1 ≤ i ≤ m.Since there are only finitely many (four) possibilities for each ||S i ||, we are done.
Combining Proposition 4.7, Lemma 4.11, and Lemma 4.12, we get the following: Corollary 4.13.The group brR acts on the contractible complex X Z with cell stabilizers of type F ∞ , and with cocompact sublevel complexes X h≤m Z .4.2.Descending links.By Citation 3.4 and Corollary 4.13, to get brR to be of type F ∞ it remains to prove that descending links get arbitrarily highly connected.(Note that h is affine on polysimplices, so it really is a Morse function.)Much of the work in this subsection will be inspired by [BM16, Section 6] and [SZ21, Subsection 4.3].
Since X Z is a polysimplicial complex, the link of a vertex v is a simplicial complex, with a k-simplex for each (k + 1)-dimensional polysimplex containing v. If the polysimplex achieves its maximum h value at v, then the corresponding simplex in the link of v is even in the descending link.Note that vertices with the same number of feet have isomorphic descending links, so just like the complexes L m d (B * ≀ G) from Subsection 3.3, we can denote by L m Z the simplicial complex that is isomorphic to the descending link of any vertex with m feet.Definition 4.14 (Merging).Call an element Υ of G a merging if Υ −1 is a splitting.Call it simple or weakly elementary if its inverse is, as a splitting.If v = [τ ] Z is a vertex in X Z and Υ is a merging such that the product [τ ]Υ makes sense, then we call [τ ]Υ Z a merging of v.
For Υ a merging, write Υ (i) for the merging 1 ⊕ where Υ is the ith direct summand.We see that the vertices of the descending link lk ↓ v of v are precisely the non-trivial, weakly elementary, simple mergings of v. Writing ∨ := ∧ −1 , this means that to obtain a vertex of lk ↓ v, we choose a representative [τ ] of v = [τ ] Z , take Υ to be either (a k , 1)∨ for some k ∈ Z or ∨ 2 , and then take [τ ]Υ (i) Z for some i.If we already have a fixed representative [τ ] of v, then in addition to all of the above we first multiply [τ ] on the right by an element of B m ≀ Z, where m = h(v) (to account for potentially changing representatives).In all that follows, we will often identify B m ≀ Z with its image in G under We can denote vertices of L m Z by gΥ which is a non-trivial, weakly elementary, simple merging of [τ ] Z , so one of the form [τ ]gΥ (i) Z , for g = β(z 1 , . . ., z m ) ∈ B m ≀ Z, Υ of the form (a k , 1)∨ for some k ∈ Z or ∨ 2 , and some i.Define the type of this merging to be Υ, so the type is either (a k , 1)∨ for some k ∈ Z or ∨ 2 .Define the mass of this merging to be 2 if it is of type (a k , 1)∨ for some k ∈ Z, and 3 if it is of type ∨ 2 (so the mass is the "number of feet" that Υ is merging together).
In order to understand L m Z , we will map it to a certain complex of disks, defined as follows.
Definition 4.16 ((2, 5/2)-disk complex).Let S g b,m be a surface with b boundary components, m marked points, and genus g.The (2, 5/2)-marked-point-disk complex D 2,5/2 (S g b,m ) is the simplicial complex defined as follows.A vertex is an isotopy class of an embedded disk enclosing precisely 2 marked points in its interior and either 0 or 1 marked points in its boundary.If a disk has 0 marked points in its boundary call it a 2-disk and if it has 1 marked point in its boundary call it a 5/2-disk (two points inside plus one point "halfway inside" equals two and a half points inside, hence the name 5/2-disk).A k-simplex in D 2,5/2 (S g b,m ) is an isotopy class of k + 1 (pairwise non-isotopic) embedded disks such that each one is either a 2-disk or a 5/2-disk, and any two of them are either disjoint or nested.The face relation is given by taking subsets.
Here when we call two isotopy classes "disjoint" or "nested" we of course mean that they admit disjoint or nested representatives.If one disk is nested in a (non-isotopic) second disk then necessarily the former is a 2-disk and the latter is a 5/2-disk.Similar to how the usual disk complex can be viewed as a subcomplex of the curve complex (outside some pathological cases), this (2, 5/2)-marked-point-disk complex can usually be viewed as a subcomplex of the arc-and-curve complex: the boundary of a 2-disk is a curve and the boundary of a 5/2-disk is an arc.See Figure 7 for an example.(The astute reader may wonder why we are using 5/2-disks instead of 3-disks; the answer is that the analog of Proposition 4.19 would not hold if we used 3-disks.) Figure 7.An example of a 1-simplex in D 2,5/2 (S 0 1,5 ).The disk bounded in red is a 2-disk, the disk bounded in blue is a 5/2-disk, and they are nested.

Now let us map L m
Z to D 2,5/2 (S m ), where S m = S 0 1,m .To start, we will just define the map on the vertices.A vertex of L m Z is of the form β(z 1 , . . ., z m )Υ Z , where β(z 1 , . . ., z m ) ∈ B m ≀ Z, Υ is of the form (a k , 1)∨ for some k ∈ Z or ∨ 2 , and i is some number.Define µ : (L m Z ) (0) → D 2,5/2 (S m ) (0) as follows.If Υ = (a k , 1)∨ for some k then define D(Υ (i) ) to be a 2-disk that is a tubular neighborhood of the 2-matching {i, i + 1} (recall from before that we fix an embedding of the linear graph into the surface, and so matchings make sense).If Υ = ∨ 2 then define D(Υ (i) ) to be a 5/2-disk that is obtained by taking a tubular neighborhood of the subset obtained from the 3-matching {i, i + 1, i + 2} by removing a small disk centered at i + 2, in such a way that i + 2 lies precisely on the boundary of the neighborhood.For example, in Figure 7 if we label the marked points 1 through 5 from left to right, then (up to isotopy) the disk bounded in blue is D (∨ 2 ) (2) .Now define µ via Lemma 4.17.The map µ is well defined on vertices.
Proof.The proof is similar to that of Lemma 3.9.Let γ(y 1 , . . ., y q ) ∈ B q ≀ Z for appropriate q, so . Note that the y ′ j might not lie in Z, but the only way this could happen is when j = i ′ , and then only if Υ has mass 2 so y ′ i ′ is a power of a.In this case, we can let Υ ′ be Υ = (a k , 1)∨ with k changed appropriately, and (changing the definition of y Since all the z j and y ′ j are in Z, this maps under µ to (D((Υ ′ ) (i ′ ) ))(βγ ′ ) −1 .We need to show this equals (D(Υ (i) ))β −1 , or equivalently that (D(Υ (i) ))γ ′ = D((Υ ′ ) (i ′ ) ).If Υ (and hence Υ ′ ) has mass 2 then this follows by the same argument as in the proof of Lemma 3.9.Now suppose Υ = Υ ′ = ∨ 2 .Then γ ′ is obtained from γ by replacing the ith strand (counting from the top) with 3 parallel strands -call this intermediate braid γ ′′ -and possibly braiding the first two of these around each other some number of times (depending on the braided wreath recursion of y i ′ , which has some power of a in its left entry and some element of Z in its right entry).When acting on D(Υ (i) ), this braiding of the first 2 strands does not affect the (equivalence class of the) 5/2-disk, so (D(Υ ), so we are done.Now we want to extend µ to all simplices of L m Z .We need to show that if vertices w 0 , . . ., w k span a simplex in L m Z then their images under µ span a simplex in D 2,5/2 (S m ).Since D 2,5/2 (S m ) is a flag complex by construction, it suffices to do this for k = 1, i.e., to show the following: Lemma 4.18 (Extends to simplices).If two vertices w and u span an edge in L m Z then their images under µ span an edge in D 2,5/2 (S m ).
Proof.View L m Z as lk ↓ v for some vertex v = [τ ] Z of X Z with h(v) = m, so w and u are adjacent vertices to v with h(w), h(u) < m.The fact that w and u span an edge in lk ↓ v means that there is a 2-dimensional polysimplex, i.e., a square or a triangle, in X Z containing v, w, and u.First suppose it is a square.Then there is a merging of v of the form [τ ]β(z 1 , . . ., z m )Υ Z for β(z 1 , . . ., z m ) ∈ B m ≀ Z and say with Υ 1 in the i 1 th spot and Υ 2 in the i 2 th spot, such that the following holds: If Ψ i is Υ with Υ i replaced by an appropriate number of copies of 1, then w = [τ ]β(z 1 , . . ., z m )(Ψ 1 ) Z and u = [τ ]β(z 1 , . . ., z m )(Ψ 2 ) Z .Clearly D(Ψ 1 ) and D(Ψ 2 ) are disjoint, hence so are µ(w) = (D(Ψ 1 ))β −1 and µ(u) = (D(Ψ 2 ))β −1 .Now suppose the 2-dimensional polysimplex containing v, w, and u is a triangle.This means there we can choose [τ ′ ], k, and i such that v, w, and u are the vertices of the polysimplex poly([τ ′ ]; S 1 , . . ., S m−2 ), where S j = {1} for all j = i and S i = {1, ∧(a k , 1), ∧ 2 }.Say w has mass 3 relative to v (and u has mass 2), so w = [τ ′ ] Z , u = [τ ′ ](∧(a k , 1)) ) and µ(w) = D (∨ 2 ) (i) , and the former is nested in the latter as desired.
At this point we have a simplicial map µ : L m Z → D 2,5/2 (S m ).Our next goal is to prove that it is a surjective complete join.It is clearly surjective on vertices, and is simplexwise injective, so it suffices to show the following: Proposition 4.19.Let w 0 , . . ., w k be vertices of L m Z whose images under µ span a ksimplex in D 2,5/2 (S m ).Then w 0 , . . ., w k span a k-simplex in L m Z .Hence µ is a complete join.
Proof.If k = 0 then there is nothing to show, so assume k > 0. By induction, w 1 , . . ., w k span a simplex in L m Z , call it σ.The image µ(σ) is represented by k disks that are pairwise disjoint or nested, and such that the disk µ(w 0 ) is disjoint or nested with each of them.If µ(w 0 ) is disjoint from all the disks in µ(σ), then the argument in the proof of Proposition 3.15 shows that w 0 , . . ., w k span a simplex in L m Z .Now assume this is not the case, so without loss of generality w 0 has mass 2, w 1 has mass 3, µ(w 0 ) is nested in µ(w 1 ), and both µ(w 0 ) and µ(w 1 ) are disjoint from µ(w i ) for all 2 ≤ i ≤ k.Now view L m Z as lk ↓ v for a vertex v = [τ ] Z with h(v) = m, so σ is represented by a polysimplex containing v, w 1 , . . ., w k , with v as its vertex maximizing h.Write this polysimplex as poly([τ ′ ]; S 1 , . . ., S r ), so v = [τ ′ ](max(S 1 ) ⊕ • • • ⊕ max(S r )) Z .We can assume [τ ] = [τ ′ ](max(S 1 ) ⊕ • • • ⊕ max(S r )).Without loss of generality S 1 = {1, ∧ 2 } and Z .Now say w 0 = [τ ]β(z 1 , . . ., z m )((a ℓ , 1)∨) Z for some β(z 1 , . . ., z m ) ∈ B m ≀ Z, some ℓ, and some i.Up to ∼ Z we can actually assume ℓ = 0, e.g, right multiply by (b −ℓ ) (i) .Then µ(w 0 ) = D(∨ (i) ) β −1 , and this is disjoint from µ(w 2 ), . . ., µ(w k ) and contained in µ(w 1 ).By the above equation for w 1 we have µ(w 1 ) = D (∨ 2 ) (1) , so µ(w 0 ) = D ∨ (1) , hence under homotopy equivalence, we have more work to do before we can conclude that D 2,5/2 (S g b,m ) is wCM of dimension m+1 3 − 1.Let σ = {D 0 , . . ., D k } be a k-simplex in D 2,5/2 (S g b,m ), and consider its link L := lk σ in D 2,5/2 (S g b,m ).Working with the barycentric subdivision as in the first paragraph, we can view L as the subcomplex spanned by all proper cofaces τ of σ.If some D i is a 5/2-disk such that δ(D i ) ∈ σ, then the map τ → τ ∪ {δ(D i )} induces a homotopy equivalence from L to the star of the proper coface σ ∪ {δ(D i )} in L, hence L is contractible.Now assume whenever D i is a 5/2-disk, δ(D i ) ∈ σ.Call D i and δ(D i ) paired in this case.If D i is a vertex of σ that is not paired, call it solitary (and note that the solitary vertices must be 2-disks).Say 2p is the number of paired vertices in σ, so k − 2p + 1 is the number of solitary vertices.Consider the surface S g b+p,m−3p obtained by cutting along the boundary and removing the interior (and un-marking the marked point on the boundary) of each 5/2-disk in σ.Let σ be the (possibly empty) (k − 2p)-simplex in D 2,5/2 (S g b+p,m−3p ) whose vertices are the solitary vertices of σ, now viewed as disks in S g b+p,m−3p .It is clear that L is isomorphic to the link of σ in D 2,5/2 (S g b+p,m−3p ) (which if σ is empty means the whole complex).If the desired result holds for σ and S g b+p,m−3p , then the link of σ in D 2,5/2 (S g b+p,m−3p ) (and hence also L) is .Thus it remains only to prove the result in the case when all the vertices of σ are solitary.
Since we have reduced to a case where all the vertices of σ are 2-disks, we can consider the subcomplex L 2 of L that is the link of σ in the subcomplex D 2 (S g b,m ) of D 2,5/2 (S g b,m ).Since D 2 (S g b,m ) is wCM of dimension m+1 3 − 1 by Corollary 3.14, we know L 2 is ( m+1 3 − k − 3)connected.Now we will build up from L 2 to L by gluing in the missing simplices τ .We can again use the Morse function (n 5/2 , − dim), now restricted to L, since L 2 is precisely the sublevel complex of L defined by (n 5/2 , − dim) ≤ (0, 0).If we can show that the descending link of any simplex in L \ L 2 is ( m+1 3 − k − 4)-connected then discrete Morse theory (see, e.g., [BB97, Corollary 2.6]) will tell us that L is ( m+1 3 − k − 3)-connected and we will be done.The argument from the first paragraph works in exactly the same way to show that the descending link in L of a simplex τ in L \ L 2 is contractible, except in one case, namely when every disk in τ \ σ is a 5/2-disk that is paired with a 2-disk in σ; see Figure 8 for a visualization of this situation.In this case the descending face link of τ in L is the entire boundary of τ (since removing any proper subset of disks in τ \ σ is a descending move), so if τ is an ℓ-simplex in L (i.e., a (k + ℓ + 1)-simplex in D 2,5/2 (S g b,m ) containing the k-simplex σ), then the descending face link of τ in L is an (ℓ − 1)-sphere, hence (ℓ − 2)-connected.In this case we can also understand the descending coface link of τ in L: it is isomorphic to the 2-disk complex on the surface obtained by cutting out all the disks in τ .Since each disk in τ \ σ contains a disk in σ, this produces k + 1 new boundary components and eliminates 2(k + 1) + (ℓ + 1) = 2k + ℓ + 3 marked points, so this surface is S g b+k+1,m−2k−ℓ−3 .The 2-disk complex of this surface, and hence the descending coface link of τ , is (m−2k−ℓ−3)+1 3 − 2connected.Joining this with the descending face link, which is (ℓ − 2)-connected, we get that the descending link of τ is Now we can prove the main result of this section, that brR is of type F ∞ .
Proof of Theorem 4.1.By Citation 3.4 and Corollary 4.13, it suffices to prove that the descending links of vertices in X Z get arbitrarily highly connected as their number of feet goes to ∞.This follows from Citation 3.12, Proposition 4.19, and Proposition 4.20.

1. 2 .
The braided Grigorchuk group.Now we construct a braided version of Grig.Denote by a the element of brAut(T 2 ) defined by the braided wreath recursion a = ζ(1, 1).Now define b, c, and d via the braided wreath recursions b = (a, c), c = (a −1 , d), and d = (1, b).Definition 1.14 (Braided Grigorchuk group).The braided Grigorchuk group brGrig is the subgroup of brAut(T 2 ) defined by brGrig := a, b, c, d .The reason for using c = (a −1 , d) rather than c = (a, d) is so that we get the pleasantlooking relation bcd = 1 that holds analogously in the Grigorchuk group, as the proof of the next result shows.Lemma 1.15.The subgroup b, c, d of brGrig is isomorphic to Z 2 .Proof.First we claim that bcd = 1.Applying braided wreath recursions to bcd produces (1, cdb), then (1, (1, dbc)), and so forth, which shows that indeed bcd = 1.A similar argument shows cbd = 1.In particular b and c commute and d = (bc) −1 .It remains to show that b and c admit no non-trivial relations of the form b k c ℓ = 1.Applying braided wreath recursions we get b k c ℓ = (a k+ℓ , (a k , d k b ℓ )), which equals 1 only if k + ℓ = 0 and k = 0, so indeed no non-trivial such relations hold.
(i) Determine if |w| a = 0. (a) If |w| a = 0, then w = 1 (b) If |w| a = 0 and the length of w is 0, then w = 1.(c) If |w| a = 0 and the length of w is at least 1, then apply ψ to obtain ψ(w) = (w 1 , w 2 ) and go to (ii).(ii) Compute w red 1 and w red 2 −1 is obtained by replacing the arrow from k to σ(k) by d parallel arrows, and relabeling everything appropriately.For a (complicated) rigorous formula, see [SZ21, Example 2.2].It turns out that this defines a d-ary cloning system, with d-ary cloning maps ς n k .The Thompson-like group T d (S * ) that arises from this d-ary cloning system is (isomorphic to) the Higman-Thompson group V d .
n+d−1 induced by adding k − 1 new unbraided strands on the left and n − k new unbraided strands on the right.Now we can define κ n k as follows:

Figure 3 .
Figure 3.An example of the last step of the verification of (C1) in the proof of Proposition 2.9.Here d = 3, k = 3, and n = 5.

Figure 4 .
Figure 4.An element of the braided Röver group.Here we draw a triple (T − , β(f 1 , . . ., f m ), T + ) with T + upside down so that β is a braid from the leaves of T − to the leaves of T + , and the f i label the strands.The element equals [∧, (a, b), ∧], for ∧ the tree with one caret.As indicated in the picture, after expansions this is the same element as [T, β(1, 1, a, c), T ] for T the result of adding a caret to each leaf of ∧ and β ∈ B 4 the braid crossing the first strand over the second.
and any two [T − , 1, 1] G and [T ′ − , 1, 1] G have an upper bound.Hence the geometric realization |P d (G * )| is contractible.A cube complex: Now we construct the Stein-Farley complex X d (G * ), which is a cube complex having a natural subdivision identifiable with a certain subcomplex of |P d (G * )|.The vertex set of X d (G * ) is the whole vertex set of |P d (G * )|, namely P d (G * ).Let E be a d-ary forest whose trees each have at most one d-caret; call such a d-ary forest elementary.If E is an elementary d-ary forest with one non-trivial tree and with the same number of roots as F + , we can consider the product [T a homotopy equivalence.Using the usual notation of open and closed intervals in posets, every simplex of |P d elementary d-ary forest.Hence it suffices to show that we can build up from X d (G * ) to |P d (G * )| by gluing in the realizations of such closed intervals in some way that never changes the homotopy type.Using the above notation, the order we will use is in increasing order of the quantity h(y) − h(x).Thus when we glue in |[x, y]|, we do so along |[x, y)| ∪ |(x, y]|.This is the suspension of |(x, y)|, so it suffices to see that |(x, y)| is contractible.For this we can mimic the proof of [WZ18, Lemma 4.7], which is the d = 2 case.Recall that a poset ( Cocompactness: Let X d (G * ) h≤m be the full subcomplex of X d (G * ) spanned by vertices with at most m feet.Since h is invariant under the action of T d (G * ), all the X d (G * ) h≤m are stabilized by this action.Given vertices [T − , g, F + ] G and [U − , h, E + ] G with the same h value, the product [U − , h, E + ][F + , g −1 , T − ] exists, lies in T d (G * ), and takes [T − , g, F + ] G to [U − , h, E + ] G .Hence T d (G * ) is transitive on vertices of a given h value.Since X d (G * ) is upward-locally finite, and since the vertices of any given X d (G * ) h≤m only have finitely many h values, this shows that the action of T d (G * ) on any X d (G * ) h≤m is cocompact.

→Figure 5 .
Figure 5.An example of the bijective correspondence between elementary 3-ary forests with 9 leaves and simplices of M 3 (L 8 ).

Figure 8 .
Figure 8.An example of the last case in the proof of Proposition 4.20 (for the surface S 8 ).The disks bounded in red comprise σ and the disks bounded in blue comprise τ \ σ.Hence σ is a 2-simplex and τ is a 4-simplex in D 2,5/2 (S 8 ) containing σ, so τ represents a 1-simplex in L = lk σ.
note that the kernel of π : B d → S d is the pure braid group P B d .The action of P B d on X is trivial, so P B d ≀ n X P B d is simply a direct product of copies of P B d , namely 1 + d + d 2 + • • • + d n many copies.This equals the kernel of the natural map B d ≀ n X B d → S d ≀ n X S d .Now we get the following: which is a direct product of infinitely many copies of P B d .Proof.Viewing the projective limit B d ≀ ∞ X B d as a subgroup of the direct product of the factors B d ≀ n X B d in the projective system, and similarly S d ≀ ∞ X S d as a subgroup of the direct product of the S d ≀ n