Lower bounds on cubical dimension of $C'(1/6)$ groups
Kasia Jankiewicz

TL;DR
This paper constructs specific finitely presented small cancellation groups that cannot act properly on any finite-dimensional CAT(0) cube complex, highlighting limitations in their geometric actions.
Contribution
It introduces explicit examples of $C'(1/6)$ groups with bounded cubical dimension, advancing understanding of their geometric and combinatorial properties.
Findings
Constructed finitely presented $C'(1/6)$ groups with no proper action on any $n$-dimensional CAT(0) cube complex.
Demonstrated limitations of small cancellation groups in acting on low-dimensional cube complexes.
Provided new insights into the geometric group theory of small cancellation groups.
Abstract
For each we construct examples of finitely presented small cancellation groups that do not act properly on any -dimensional CAT(0) cube complex.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Lower bounds on cubical dimension of groups
Kasia Jankiewicz
Department of Mathematics, University of Chicago, Chicago, Illinois, 60637
Abstract.
For each we construct examples of finitely presented small cancellation groups that do not act properly on any -dimensional CAT(0) cube complex.
1. Introduction
Groups that satisfy the small cancellation condition were shown to act properly and cocompactly on CAT(0) cube complexes in [Wis04]. In this note we are interested in the minimal dimension of a CAT(0) cube complex that such groups act properly on.
Definition 1.1**.**
The cubical dimension of is the infimum of the values such that acts properly on an -dimensional CAT(0) cube complex.
Wise’s complex is obtained from Sageev’s construction [Sag95] with walls joining the opposite sides in each relator (after subdividing each edge into two if necessary). However, its dimension is not in general optimal. For example, the dimension of the CAT(0) cube complex associated to the usual presentation for the fundamental group of the surface of genus is , while its cubical dimension equals as it acts on the hyperbolic plane with a CAT(0) square complex structure.
We prove the following:
Theorem 1.2**.**
For each and each there exists a finitely presented small cancellation group such that the cubical dimension of is greater than .
For , the stronger form of Theorem 1.2 was proved by Pride in [Pri83]. He gives an explicit example of an infinite group with property FA. Pride’s construction has been revisited in [JW17]. We observe that the case can be deduced from the work of Kar and Sageev who study uniform exponential growth of groups acting freely on CAT(0) square complexes [KS16]. See Remark 4.1.
The groups in our construction can be chosen to be uniformly , i.e. where the length of each piece is less than of the minimum of the lengths of relators. The presentation complex of a uniform presentation can be “folded” to a complex that admits a CAT(-1) (so also CAT(0)) metric [Gro01, Bro16] (see also [Mar17] for the CAT(0) metric). In particular, if the groups we construct have finite cubical dimension strictly greater than their CAT(0) and geometric dimensions which both equal . Let us remind that the CAT(0) dimension of a group is the infimum dimension of a complete CAT(0) space with a proper -action by semi-simple isometries. The groups we construct join the list of examples of groups with “dimension gaps”. Brady-Crisp showed that certain Artin groups of geometric dimension have CAT(0) dimension [BC02]. We note that by [HJP16] none of these groups act properly and cocompactly on CAT(0) cube complexes, but it is unknown whether they admit proper non-cocompact actions on CAT(0) cube complexes. Bridson constructed a finitely presented torsion-free group of geometric dimension and of CAT(0) and cubical dimension which has an index subgroup of cubical dimension [Bri01]. Crisp gave examples of Bestvina-Brady kernels with CAT(0) dimension and geometric dimensions [Cri02]. The CAT(0) dimension of these groups does not drop as we pass to finite index subgroups.
The groups we construct can be also viewed as examples of hyperbolic groups “non-acting” on CAT(0) cube complexes (of given dimension). On the far side of the spectrum there are hyperbolic groups with property (T), such as uniform lattices in and random groups at density [Żuk03][KK13].
This note is organized as follows. In Section 2 we recall the classification of isometries of a CAT(0) cube complex with respect to hyperplanes. We refer to [LS77] for the background on small cancellation theory. The very basic notions of small cancellation theory are also recalled in Section 3. In that section we also describe how to build a presentations where relators are positive products of given words. This technical result is applied in Section 4, which is the heart of the paper and contains the proof of Theorem 1.2. The argument heavily utilizes hyperplanes to create a dichotomy between free subsemigroups and subgroups having polynomial growth. The main ingredient of the proof of Theorem 1.2 is Lemma 4.2 which states that for any two hyperbolic isometries of an -dimensional CAT(0) cube complex one of the following holds: is virtually abelian for some , or there is a hyperplane stabilized by certain conjugates of some powers of or , or there is a pair of words in of uniformly bounded length that generates a free semigroup.
Acknowledgements
I would like to thank my PhD advisors Piotr Przytycki and Daniel Wise. I would also like to thank Carolyn Abbott, Yen Duong, Teddy Einstein, Justin Lanier, Thomas Ng and Radhika Gupta for helpful discussion on [KS16]. Finally, I am grateful to the referees for all their comments and suggestions. The author was partially supported by (Polish) Narodowe Centrum Nauki, grant no. UMO-2015/18/M/ST1/00050.
2. Isometries and hyperplanes in CAT(0) cube complexes
In this section we recall relevant facts about isometries of CAT(0) cube complexes and collect some lemmas that will be used in the proof of Theorem 1.2. For general background on CAT(0) cube complexes and groups acting on them we refer the reader to [Sag14].
Throughout the paper will be a finite dimensional CAT(0) cube complex. The set of all hyperplanes of is denoted by . We use letters to denote the halfspaces of a hyperplane , and to denote the closed carrier of , i.e. the convex subcomplex of that is the union of all the cubes intersecting . We say that a hyperplane separates subsets , if and . The metric d is the -metric on . All the paths we consider are combinatorial (i.e. concatenations of edges), all the geodesics are with respect to d, and all axes of hyperbolic isometries are combinatorial axes. The combinatorial translation length of an isometry is defined as . If acts without hyperplane inversions then the infimum is realized and [Hag07] (see also [Woo16]). In particular, has an axis and any axis of is also an axis of . The combinatorial minset of is
[TABLE]
where is the [math]-skeleton of . Every [math]-cube of lies on an axis of of the form where is any geodesic joining and . Let . Let be a hyperbolic isometry of and let be a hyperplane. We recall the classification of isometries of a CAT(0) cube complex. More details can be found in [CS11, Sec 2.4 and 4.2].
- •
skewers if for one of the halfspaces of and some . Equivalently, if some (equivalently, any) axis of intersects exactly once.
- •
is parallel to if some (equivalently, any) axis of is in a finite neighbourhood of .
- •
is peripheral to if does not skewer and is not parallel to . Equivalently, for some .
Note that the type of behaviour of with respect to is commensurability invariant, i.e. has the same type as with respect to . The set of all hyperplanes in skewered by is denoted by . The constant in the above definitions can be chosen to be at most . Indeed, the hyperplanes cannot all intersect in since . In particular, if then for one of the halfspaces since for an appropriate we have and so . Similarly, we have the following:
Lemma 2.1**.**
There exists a constant such that for each hyperplane in and an isometry there exist such that the hyperplanes pairwise are disjoint or equal.
The constant in the lemma is the Ramsey number . Recall that the Ramsey number is the least integer such that the complete graph with all edges colored blue or red either contains a blue -clique, or a red -clique. For the existence of Ramsey number for any integers see e.g. [GRS80].
Proof.
Consider the graph whose vertices correspond to integers, and two integers are joined by an edge if and only if and are distinct and intersect. Cliques in correspond to collections of distinct pairwise intersecting hyperplanes. Let be the Ramsey constant for numbers and . Since is -dimensional, there are no -cliques in . The induced subgraph of on vertices must contain a -anticlique. This corresponds to a triple of hyperplanes where that pairwise are disjoint or equal. Hence the hyperplanes are pairwise disjoint or equal. ∎
In the above Lemma the hyperplanes are pairwise disjoint, or stabilizes (and the two cases are not mutually exclusive).
Lemma 2.2**.**
[KS16, Lem 12] Suppose and are hyperbolic isometries of and there exists a hyperplane such that , and . Then freely generate a free semigroup. See Figure 1.
The triple as in Lemma 2.2 is called a ping-pong triple. The following Lemma is a higher dimensional version of the All-Or-Nothing Lemma [KS16, Lem 13]. Our proof is based on the proof of Kar–Sageev but it differs slightly.
Lemma 2.3**.**
Let and be hyperbolic isometries and let . Then one of the following holds
- •
skewers all for , or
- •
skewers none of for , or
- •
one of the following pairs of words freely generate a free semigroup for some :
[TABLE]
Proof.
Let be the halfspace of such that . Suppose that skewers some hyperplane in but not all of them. Without loss of generality we can assume that skewers exactly one of . First suppose skewers but not i.e. the axis . Since goes arbitrarily deep in we have that is peripheral to . We either have or . Let be such that and are disjoint. Either or and thus or is a ping-pong triple. Similarly, if skewers but not , then one of or is a ping-pong triple. ∎
The combinatorial convex hull of a subset is the intersection of all convex subcomplexes containing , i.e. is the maximal subcomplex contained in . Every convex subcomplex in is a CAT(0) cube complex dual to the collection of hyperplanes that intersect . In particular, is a CAT(0) cube complex dual to the collection of hyperplanes .
The first part of the lemma below, in the stronger version where but under the assumption that and are disjoint, can be found in [FFT19, Proposition 5.4]. The second part of the below lemma also follows from [Hae17, Theorem 2.1]. Related results can be also found in [Gen19].
Lemma 2.4**.**
- (1)
The combinatorial convex hull of an axis of isometrically embeds in for some . 2. (2)
The [math]-skeleton of is contained in .
Proof.
Let be some [math]-cube of . Let denote all the hyperplanes separating and (in particular, ). Since for all and appropriate choice of halfspace of , the partition of the set of all hyperplanes skewered by into gives an isometric embedding of into a product of trees by [CH13] where each tree is the cube complex dual to the collection of pairwise disjoint hyperplanes . Since all these hyperplanes are intersected by a single bi-infinite geodesic (an axis of ), all the trees are in fact lines, i.e. isometrically embeds in with the standard cubical structure. The action of extends to the action to as a translation by the vector . Thus every [math]-cube of the combinatorial convex hull is translated by and therefore the [math]-skeleton of is contained in .
The subcomplex is dual to . If , and are separated by , i.e. and , then is parallel to . Indeed, and for all and since the axis through is contained in where . Thus the set consists of hyperplanes skewered by or parallel to . It follows that decomposes as a product where is dual to and is dual to the set of all the hyperplanes of that are parallel to (see also [KS16]). For each the complex is the combinatorial convex hull of an axis of . It follows that is the union of the complexes of the form and so the [math]-skeleton of is contained in .
∎
Lemma 2.5**.**
Let be a CAT(0) cube complex that is a subcomplex of a CAT(0) cube complex that is quasi-isometric to . Then any finitely generated group for which there is a bound on the size of its finite subgroups, that acts properly on , is virtually abelian.
Proof.
The growth of is a polynomial of degree at most and so is the growth of . Hence is virtually nilpotent, and by [BH99, Thm 7.16] is virtually abelian. ∎
3. Constructing small cancellation presentations
The main goal of this section is the following.
Proposition 3.1**.**
Let . Let be a finite collection of pairs where for each the elements are not powers of the same element. There exists a small cancellation presentation
[TABLE]
where is a positive word in that is not a proper power for .
By in the above Lemma and throughout the section we denote the free group on generators and . The length of a word with respect to is denoted by . A spelling of a nontrivial element is a concatenation where each syllable is a nontrivial element of . The cancellation in the spelling is the value , i.e. the length of the common prefix of the reduced words representing and . A spelling is reduced if for ; in other words . A spelling is cyclically reduced if additionally . For we say are virtually conjugate and write if some powers of and are conjugate. We denote a free semigroup on by . Let denote an element for some .
A piece in and is a syllable such that and are reduced spellings of some cyclic permutation of and respectively. We emphasize that all the pieces considered throughout the section are words in . A presentation is small cancellation if for every piece in and we have . For more background on small cancellation theory, see [LS77].
Lemma 3.2**.**
Let be a finitely generated subgroup of . There exists a constant such that the map between the conjugacy classes of maximal -subgroups induced by the the inclusion is at most -to-.
Proof.
Let be an immersion of graphs where is a wedge of circles, where the induced map on the fundamental groups is the inclusion .
For any graph , the conjugacy class of a -subgroup in can be represented by an immersion of a line that factors as where is a circle, taken modulo the orientation. Thus different conjugacy classes of -subgroups in that map into the same conjugacy class in are different lifts
[TABLE]
The number of such lifts is bounded by the number of vertices in . ∎
Lemma 3.3**.**
Let be such that and are not powers of the same element. There are infinitely many pairwise non virtually conjugate elements of the form .
Proof.
Two elements of are virtually conjugate if and only if they have the following reduced spellings
[TABLE]
[TABLE]
where are reduced words in , is cyclically reduced and is a cyclic permutation of [LS77, Prop 2.17]. In particular the elements of the set are not virtually conjugate, i.e. they are contained in distinct conjugacy classes of maximal -subgroups. Since are not powers of the same element, the group is a rank free group. By Lemma 3.2 there exists a constant such that the map between the conjugacy classes of maximal -subgroups induced by the inclusion is at most -to-. The lemma follows. ∎
We say that elements are non-cancellable, if
[TABLE]
[TABLE]
Equivalently, for any we have . In particular, . The equivalence is obvious in one of the direction. For the other direction, note that the cancellation between consecutive syllables of are separated by at least one letter. We remark that if are non-cancellable then so are any two elements in .
Lemma 3.4**.**
Let not be powers of the same element. Then there exist elements that are non-cancellable and are not powers of the same element.
Proof.
If replace the pair with if , and with otherwise. If replace the pair with if , and with otherwise. Repeat these steps until . Since at each step the value strictly decreases, the procedure terminates in finitely many steps. The fact that are not powers of the same element is equivalent to . Since we conclude that are not powers of the same element either. We argue the same way in all the above cases.
Note that for any nontrivial element we have , i.e. . Let and . Since and so and have the same common prefix with (and also with ) we have as wanted. Similarly, . It follows that for every . ∎
Lemma 3.5**.**
Let be two cyclically reduced elements in such that such that is a prefix of . Then are powers of the same element.
Proof.
Suppose that and are not powers of the same element. In particular, is not a power of , so there exists a nonempty prefix of that is both some prefix of and some suffix of . See Figure 2.
If , then has a reduced spelling for some , and has a reduced spelling for some . Then has a prefix which thus must also be a prefix of , and so it must coincide with . In particular, , which means that are powers of the same element. That is a contradiction.
If , then has reduced spellings and for some such that , and has a reduced spelling for some . The prefix of must coincide with the prefix of . In particular , which again is a contradiction. ∎
Lemma 3.6**.**
Let for where for each the elements are non-cancellable and are not powers of the same element. Then for each there exist such that
- •
are non-cancellable and are not virtually conjugate,
- •
, i.e. there exists such that and are reduced spellings where , are cyclically reduced and have no cancellation,
- •
for every piece between a word in and a word in we have for .
Proof.
Since are non-cancellable, the consecutive cancellations between syllables in any word are separated from each other. For set and where are chosen so that are pairwise non virtually conjugate. This can be done by Lemma 3.3. Note that for we have . Any positive word in has the reduced spelling .
Let and set and . Let be a piece between a word in and a word in and suppose that . Note that the length of is short in comparison to the length of syllables of the form , and that the initial or final subwords of the form are shorter than . In particular, can overlap at most two syllables of the form . Thus there exists a subword of of length that is a subword of or of . For the same reason, there exists an even shorter subword of of length that is also a subword of either or of . Thus one of , say and one of , say have a common subword of length . In particular, some cyclic permutation of is a subword of (and vice-versa) and by Lemma 3.5 are virtually conjugate. This is a contradiction. Thus . We clearly also have , and for , and thus we get .
∎
Lemma 3.7**.**
Let be cyclically reduced elements that are not proper powers in such that are not virtually conjugate. Let for some . If are all different and greater than , then for every piece in we have .
Proof.
Consider two subwords of : and where such that and are maximal words in syllables entirely contained in , i.e. each of these words is equal to after adding some prefix and suffix that are proper subwords of . We say that two syllables and are aligned if and they entirely overlap in , i.e. they are the same subword of .
Suppose two syllables overlap in and . If they are not aligned, say a proper suffix of equals a proper prefix of then and (since or would imply that is equal to its conjugates which is not the case by Lemma 3.5 and the assumption that are not proper powers). See Figure 3.
Since are not conjugate by Lemma 3.5 we get that and . That together with the fact that the prefixes and suffixes of that are excluded in and both have lengths less than implies that in which case we are done. From now on, assume that any two copies of or that overlap are aligned.
Suppose and are aligned where and . If , then . Indeed, consider three cases:
- •
: Then necessarily and .
- •
: If , then because otherwise was a subword of (more specifically a subword of ). If then and are two overlapping not aligned copies of so .
- •
: If , then because otherwise was a subword of . If , then and are two overlapping not aligned copies of so ( overlaps with because otherwise was a subword of ).
Similarly, if instead , then . Similarly we can switch and . We are looking for an upper bound of . Suppose contains whole syllable as a subword for some . There exists such that for and and . Since there must be a syllable contained in the subword spelled by , and since and are not virtually conjugate . By the previous consideration and are aligned for some . Since are all different, we can find where such that and are aligned, and either or are different syllables (i.e. one of them is and the other is ). By the consideration above, we get that either , or , which implies that the beginning or the end of the subword is less than two syllables away from to the beginning or from the end of , respectively. The same happens with a syllable contained in . We conclude that is always contained in a word of the form or for some and , and in particular .
∎
Proof of Proposition 3.1.
First by Lemma 3.4 we can assume that for the elements are non-cancellable. Replace the pair and by and respectively as in Lemma 3.6, and continue replacing for each pair of indices . Note that the small cancellation properties of the replaced pairs from Lemma 3.6 are preserved when we replace a pair of elements by a pair of its positive subwords. After steps we have a collection where for every piece between a word in and a word in where we have and where for any the elements and are not virtually conjugate.
Let where are all distinct. Then for each piece between and where we clearly have . Moreover, if then also for any piece that lies in in two different ways we also have . Indeed, by Lemma 3.6 has the reduced form where are reduced spellings of respectively with cyclically reduced. Let be the words that are not proper powers such that and , i.e. neither or is equal to any of its nontrivial cyclic permutations. Also, by Lemma 3.6 are not conjugate.
Suppose the piece is disjoint from . Then is a subword of a word in and by Lemma 3.7
[TABLE]
It follows that
[TABLE]
Finally if overlaps with the prefix or suffix then is a subword of or . If we choose sufficiently large so then we have
[TABLE]
∎
4. Proof of Theorem 1.2
Remark 4.1**.**
The case of Theorem 1.2 can be deduced from the work of Kar and Sageev who study uniform exponential growth of groups acting freely on CAT(0) square complexes [KS16]. They prove that for any two elements there exists a pair of words of length at most in that freely generates a free semigroup, unless is virtually abelian. One can construct a small cancellation presentation by applying Proposition 3.1 to . The resulting group cannot act properly on a CAT(0) square complex, since for each pair there is a relator which is a positive word in .
Let be the union of the following pairs for all and (where is the constant defined in Lemma 2.1):
[TABLE]
Let . Let
[TABLE]
where .
Lemma 4.2** (The Main Lemma).**
Suppose acts freely on an -dimensional CAT(0) cube complex. Then one of the following holds:
- •
one of the pairs in freely generates a free semigroup, or
- •
either and , or and stabilize a hyperplane, or
- •
the group is virtually abelian.
Proof.
Without loss of generality we may assume that the action of is without hyperplane inversions, as we can always subdivide to have this property of the action. Let be axes of respectively.
Suppose there exists a hyperplane . By Lemma 2.3, does not skewer for any unless one of the pairs in freely generates a free semigroup. Without loss of generality (by possibly renaming some as ) we can assume that .
If and then the subgroup preserves . We are now assuming that this is not the case, i.e. at least one of and is not preserved by .
Suppose that does not stabilize . Let be minimal such that and are disjoint or equal and let such that are pairwise disjoint (no two can be equal since does not stabilize ). If , then we have , and thus also . Since and there is a ping-pong triple . See Figure 4.
Now suppose . We have because , and thus is a ping-pong triple. Analogously, if does not stabilize then one of and is a ping-pong triple for some and .
Similarly, if there exists a hyperplane , then one of the pairs in freely generates a free semigroup or stabilizes a hyperplane. Otherwise , which we now assume is the case.
Suppose there exists a hyperplane separating that is not stabilized by either or . Let be minimal such that for appropriate choice of halfspace of . Let such that are pairwise disjoint. The triple is a ping-pong triple.
We can now assume that every hyperplane separating any two axes of and is stabilized by or . If a hyperplane is stabilized by then there are axes of in both halfspaces . In particular, no hyperplane separates and , hence . Let be a [math]-cube in the intersection . By Lemma 2.4, lies on axes of both and . The subcomplexes and both contain and are dual to the same set of hyperplanes , and therefore are equal. That subcomplex is invariant under the action of and and so it is a minimal -invariant convex subcomplex, and acts freely on it. By Lemma 2.4 embeds in and by Lemma 2.5 the group is virtually abelian. ∎
In the following proof denotes the minimal number of syllables of the form in a spelling of .
Proof of Theorem 1.2.
Let be a group given by the presentation from Proposition 3.1 with where . In particular, is an infinite, torsion-free, non-elementary hyperbolic group [LS77, Thm 4.4],[Gro87]. In particular, any nontrivial virtually abelian subgroup is isomorphic to . Since the group is . Suppose that acts properly (and hence freely) on an -dimensional CAT(0) cube complex.
By definition of none of the pairs in can freely generate a free semigroup since there is a relator in the presentation of associated to each pair. Since the presentation of is it can be concluded from the Greendlinger’s Lemma [LS77, Thm 4.4] that the subgroup is not isomorphic to and hence not virtually abelian, so by Lemma 4.2 one of the pairs or stabilizes a hyperplane and thus these two elements act on an -dimensional CAT(0) cube complex. Since and we can apply Lemma 4.2 again and we conclude that either one of and is a subgroup, or an appropriate pair of elements stabilizes a hyperplane. We can keep applying Lemma 4.2. As long as the pair of elements stabilizes a hyperplanes, then by Lemma 4.2 one of the pairs or generates a subgroup or stabilizes a hyperplane. Since the elements that Lemma 4.2 provides are both conjugates of or , we conclude that and at each step are some conjugates of one of the original generators and . In particular, and for any . Also,
[TABLE]
and similarly . By applying Lemma 4.2 up to times, we eventually get a pair of elements that generates a subgroup and we have . In particular, for some and we have . By Greendlinger’s Lemma [LS77] some subword of must be also a subword of some relator with . On one hand . On the other hand, the length of each syllable of the form or in is at most because if is a subword of then is a piece in and the same for . Thus for any subword of of length at most we have . Since we get a contradiction. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BC 02] Noel Brady and John Crisp. Two-dimensional Artin groups with CAT ( 0 ) CAT 0 {\rm CAT}(0) dimension three. In Proceedings of the Conference on Geometric and Combinatorial Group Theory, Part I (Haifa, 2000) , volume 94, pages 185–214, 2002.
- 2[BH 99] Martin R. Bridson and André Haefliger. Metric spaces of non-positive curvature . Springer-Verlag, Berlin, 1999.
- 3[Bri 01] Martin R. Bridson. Length functions, curvature and the dimension of discrete groups. Math. Res. Lett. , 8(4):557–567, 2001.
- 4[Bro 16] Samuel Brown. CAT ( − 1 ) CAT 1 \rm{CAT(-1)} metrics on small cancellation groups. ar Xiv:1607.02580 , pages 1–12, 2016.
- 5[CH 13] Victor Chepoi and Mark F. Hagen. On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes. J. Combin. Theory Ser. B , 103(4):428–467, 2013.
- 6[Cri 02] John Crisp. On the CAT ( 0 ) CAT 0 {\rm CAT}(0) dimension of 2-dimensional Bestvina-Brady groups. Algebr. Geom. Topol. , 2:921–936, 2002.
- 7[CS 11] Pierre-Emmanuel Caprace and Michah Sageev. Rank rigidity for CAT(0) cube complexes. Geometric And Functional Analysis , 21:851–891, 2011. 10.1007/s 00039-011-0126-7.
- 8[FFT 19] Talia Fernós, Max Forester, and Jing Tao. Effective quasimorphisms on right-angled Artin groups. Ann. Inst. Fourier (Grenoble) , 69(4):1575–1626, 2019.
