PIECEWISE EXCLUDING GEODESIC LANGUAGES
MARANDA FRANKE
Abstract. The complexity of a geodesic language has connections to algebraic properties of the group. Gilman, Hermiller, Holt, and Rees show that a finitely generated group is virtually free if and only if its geodesic language is locally excluding for some finite inverse-closed generating set. The existence of such a correspondence and the result of Hermiller, Holt, and Rees that finitely generated abelian groups have piecewise excluding geodesic language for all finite inverse-closed generating sets motivated our work. We show that a finitely generated group with piecewise excluding geodesic language need not be abelian and give a class of infinite non-abelian groups which have piecewise excluding geodesic languages for certain generating sets. The quaternion group is shown to be the only non-abelian 2-generator group with piecewise excluding geodesic language for all finite inverse-closed generating sets. We also show that there are virtually abelian groups with geodesic languages which are not piecewise excluding for any finite inverse-closed generating set.
1. Introduction
For a group G generated by a finite set X, Dehn’s word problem asks if there exists an algorithm which determines whether or not a given word over X∪X−1 represents the trival element in G [4]. Dehn’s word problem is known to be unsolvable in general [2]. But for certain classes of groups, such as groups with a computable geodesic language for some generating set, there are solutions to the word problem. There are two known classes of groups with regular geodesic language for all finite generating sets: word hyperbolic groups [5] and abelian groups [14, Theorems 4.4 and 4.1]. There are many known types of groups with regular geodesic language for some finite generating set: these include Coxeter groups [12], virtually abelian groups and geometically finite hyperbolic groups [14], Artin groups of finite type and more generally Garside groups [3], Artin groups of large type [10], and groups hyperbolic relative to virtually abelian subgroups [1]. The class of groups with regular geodesic language for some generating set is moreover closed under graph products [13].
By considering more restrictive language classes than regular, it is possible to discover more properties of the underlying groups. In some cases, a characterization can be found. Gilman, Hermiller, Holt, and Rees show that a finitely generated group is virtually free if and only if its geodesic language is locally excluding for some finite symmetric (that is, inverse-closed) generating set [7, Theorem 1]. Hermiller, Holt, and Rees show that a finitely generated group is free abelian if and only if, for some finite symmetric generating set, it has piecewise excluding geodesic language where the excluded piecewise subwords all have length one [9, Theorem 3.2]. Our research is motivated by the existence of these correspondences and by the following implications.
Theorem 1.1**.**
[8, Proposition 6.2]**
Finitely generated abelian groups have piecewise excluding geodesic language for all finite symmetric generating sets.
Theorem 1.2**.**
[8, Proposition 6.3]**
Finitely generated virtually abelian groups have piecewise testable geodesic language for some finite symmetric generating set.
Cannon gives an example showing that a finitely generated virtually abelian group can have a non-regular geodesic language for some finite symmetric generating set [14]. A natural question to investigate is if Theorem 1.1 is a correspondence; that is, if groups with a piecewise excluding geodesic language for some generating set must be abelian. In Chapter 3, we show that a finitely generated group having piecewise excluding geodesic language does not imply that the group is abelian, even if the condition is strengthened to having piecewise excluding geodesic language for all finite symmetric generating sets.
{restatable*}
propositionFbyA
Let K be a finitely generated abelian group, H a finite group, and G an extension of H by K: 1→H→G→K→1. Then G has a piecewise excluding geodesic language for some finite symmetric generating set.
{restatable*}
propositionQ
The quaternion group, Q8=<i,j,k∣ijk−1,jki−1,kij−1,i4>, has piecewise excluding geodesic language for all finite symmetric generating sets.
We show that the group Q8 is a somewhat special 2-generator group and that the class of groups with piecewise excluding geodesic languages for all finite symmetric generating sets does not have nice closure properties.
{restatable*}
theoremOnlyQ
The quaternion group, Q8, is the only non-abelian 2-generator group with piecewise excluding geodesic language for all finite symmetric generating sets.
{restatable*}
propositionQxQ
The class of groups which have piecewise excluding geodesic languages for all finite symmetric generating sets is not closed under direct products.
Recall that Theorem 1.2 shows that virtually abelian groups have piecewise testable geodesic language, a class which contains piecewise excluding geodesic languages. We show that the group property ‘virtually abelain’ also does not correspond to piecewise excluding geodesic language by exhibiting a family of virtually abelian groups which have, for any finite symmetric generating set A, a geodesic word containing both a generator and its inverse. By the proposition below, groups with a quotient isomorphic to a group in this family have, for any finite symmetric generating set, geodesic language which is not piecewise excluding.
{restatable*}
corollaryVA
There are finitely generated virtually abelian groups whose geodesic language is not piecewise excluding for any finite symmetric generating set.
{restatable*}
propositionExtns
Let G be an extension 1→H→G→πK→1 of finitely generated groups H and K and let A be a finite symmetric generating set for G. If awa−1 is geodesic in K over the generating set π(A) for some a∈π(A) and w∈π(A)∗, then the geodesic language of G over A is not piecewise excluding.
2. Background
In this paper, all groups we consider are finitely generated and all generating sets are finite and symmetric (that is, inverse closed). We use the notation [x,y] to mean the word xyx−1y−1. Let G be a group with generating set A. We denote the identity element of G by 1G and use the notation g=Gh to indicate that g and h are the same element of G. The smallest normal subgroup of G containing a set {x1,...,xn} is denoted by <x1,...,xn>N. A set of normal forms for G over A is a set N of words over A such that each element of G has a unique representative in N. The Cayley graph of G over A, denoted Γ(G,A), is the directed graph with a vertex labeled g for each g∈G and an edge labeled by a from g to ga for each a∈A and each g∈G. The graph is endowed with a metric by making each edge isometric to the unit interval and using the induced Euclidean metric. A geodesic word in Γ(G,A) is a word which labels a path of minimal length between two vertices in Γ(G,A). The set of all finite length words over A, including the empty word, is denoted by A∗. A language L over A is a subset of A∗.
Definition 2.1**.**
The geodesic language of G over A, denoted Geo(G,A), is the set of all geodesic words in Γ(G,A).
A language is regular if it can be built out of finite subsets of the alphabet using the operations of concatenation, union, intersection, complementation, and * (Kleene closure); such an expression for a language is called a regular expression. A language L is regular if and only if L can be recognized by a finite state automaton. For a reference on finite state automata and formal language theory, see [11].
Example 2.2**.**
A virtually abelian group need not have regular geodesic language for every finite symmetric generating set. Cannon [14] exhibits the group G=Z2⋊\nicefracZ2Z=<a,b,t∣[a,b],t2,tatb−1>, which has regular geodesic language with the generating set {a,b,t}±1 but not with the generating set {a,d,c,t}±1, where c=a2 and d=ab.
The following three language class definitions can be found in [8]. A language L over an alphabet A is locally excluding if there is a finite set of words F⊂A∗ such that w∈L if and only if w has no (contiguous) subword in F. A language L over an alphabet A is piecewise testable if L is defined by a regular expression combining terms of the form A∗a1A∗a2A∗⋯A∗akA∗, where ai∈A, using the operations of concatenation, union, intersection, complementation, and * (Kleene closure). The string a1a2⋯an∈A∗ is called a piecewise subword of w if w=w0a1w1a2⋯anwn for some wi∈A∗. A language L over an alphabet A is piecewise excluding if there is a finite set of words F⊂A∗ such that w∈L if and only if w contains no piecewise subword in F.
3. Results
The following observation proved to be useful in showing particular geodesic languages were not piecewise excluding.
Lemma 3.1**.**
Let G be a group generated by a finite symmetric generating set A. If Geo(G,A) is piecewise excluding, then aa−1 must be an excluded piecewise subword for every a∈A which does not represent the identity element of G.
Proof.
First note that if a or a−1 is excluded from Geo(G,A), then a must represent the identity of the group. If a=G1G, then a,a−1∈Geo(G,A). For any a∈A, aa−1∈/Geo(G,A) since aa−1=G1G. In a piecewise excluding geodesic language, the only way to exclude the word aa−1 from the language without excluding a or a−1 is by excluding aa−1 as a piecewise subword.
∎
This suggests something strong about commutativity and seems to be evidence in favor of the existence of a correspondence between abelian groups and piecewise excluding geodesic lanugages. But there are non-abelian groups which have piecewise excluding geodesic language for some generating sets.
Lemma 3.2**.**
All finite groups have a generating set whose geodesic language is piecewise excluding.
Proof.
Let G be a finite group and let A=G∖{1G}. Then Geo(G,A) is piecewise excluding. In particular, Geo(G,A)=A∗∖{A∗aA∗bA∗∣a,b∈A}, which is the set of all words over A of length at most one.
∎
Finite groups may also have piecewise excluding geodesic language for smaller generating sets. Consider D8=<a,b,t∣a2,b2,(ab)4,ababt> and A={a,b,t}. Then Geo(D8,A)=A∗∖({A∗xA∗xA∗∣x∈A}∪{A∗xA∗yA∗zA∗∣x,y,z∈A}), the set of all words over A of length at most two which do not contain duplicate letters. Note that with the generating set B={a,b}, however, D8 does not have piecewise excluding geodesic language, as aba∈Geo(D8,B).
\FbyA
Proof.
Let the maps be 1→H→ιG→πK→1 and let A be a finite symmetric generating set for K with 1K∈/A. By Theorem 1.1 Geo(K,A) is piecewise excluding; let F be the finite set of excluded piecewise subwords. For each a∈A, choose a unique preimage under π, denoted aˉ, such that a−1=aˉ−1. Let Aˉ={aˉ∣a∈A} and let Fˉ={a1ˉ⋯anˉ∣a1⋯an∈F}. Then words over Aˉ are geodesic if and only if they have no piecewise subword in Fˉ. Let Hˉ=ι(H∖{1H}). Note that as no generators in Hˉ represent the identity element of G, words of length one over Hˉ are geodesic; because each non-identity element of H has a representative in Hˉ, words of length two over Hˉ are not geodesic. Because ι(H) is a normal subgroup of G, for each h∈H and each a∈A there is an ha∈H such that aˉι(h)aˉ−1=Gι(ha). Suppose that w∈(Aˉ∪Hˉ)∗. Write w=a1h1a2h2⋯anhn where ai∈Aˉ∗ and hi∈Hˉ for all i∈{1,...,n}. Then w=Gh~a1a2⋯an where h~=(h1)a1(h2)a1a2⋯(hn)a1a2⋯an; that is, w is equal in G to a word in (Aˉ∪Hˉ)∗ with at most one element of Hˉ followed by a1a2⋯an, the piecewise subword of w over Aˉ. Therefore any word in (Aˉ∪Hˉ)∗ with more than one letter from Hˉ or containing a piecewise subword over Aˉ which has a piecewise subword in Fˉ is not geodesic. Thus Geo(G,Aˉ∪Hˉ) is the piecewise excluding language whose set of excluded piecewise subwords is Hˉ2∪Fˉ.
∎
\Q
Proof.
Because the center of the group is {1Q8,i2} and all other elements have order four, any set of elements of Q8 containing at most one order four element (not including inverses) generates an abelian group. Hence any generating set for the non-abelian group Q8 includes at least two order four elements which do not commute. Let A be a finite symmetric generating set for Q8, and let a and b be two order four elements in A which do not commute. Then the eight words 1,a,a−1,b,b−1,a2,ba, and b−1a represent distinct elements of Q8. The element 1 has order one, the element a2 has order two, and no two of the remaining (order four) elements can be equal because that would contradict that a and b do not commute and both have order four. Thus, any word of length at least three is not geodesic. The language of geodesics is therefore piecewise excluding: the set of excluded piecewise subwords is the set of words of length three together with all words of length at most two that are not geodesic.
∎
The following two lemmas are used in the proof of Theorem 1.2.
Lemma 3.3**.**
All proper quotients of the group G=\nicefracZ5Z⋊Z=<a,x∣a5,xax−1a2> are either abelian or, for some finite symmetric generating set, have a geodesic language which is not piecewise excluding.
Proof.
First note that a set of normal forms for G over A={a,x}±1 is {aixn∣i∈{0,1,2,3, 4},n∈Z}. Observe that xa=Ga3x, and so xna=Ga3nxn for all n∈Z, and that x4a=Gax4. Any proper quotient H of G is isomorphic to \nicefracG<ai1xn1,ai2xn2,...,aikxnk>N for some {aijxnj}j=1k where for each j∈{1,...,k}, ij∈{0,1,2,3,4}, nj∈Z, and ij,nj are not both zero.
Case A: There is a j∈{1,...,k} such that nj=0.
In this case ij∈{1,2,3,4}, so <aij>=G<a> is trivial in the quotient. Thus H is a quotient of Z, and so H is abelian.
Case B: There is a j∈{1,...,k} such that ij=0 and nj=0(mod4).
In this case a(xnj)a−1=Gaxnja4=Ga1+4⋅3njxnj∈<xnj>N,
which implies that a∈<xnj>N for all possible nj. Thus H is a quotient of \nicefracZnjZ, and so H is abelian.
Case C: There is a j∈{1,...,k} such that ij=0 and nj=0(mod4).
In this case xnj(aijxnj)x−nj=Gxnjaij∈<aijxnj>N, which implies that (xnjaij)−1 =Ga−ijx−nj∈<aijxnj>N. So (aijxnj)(a−ijx−nj)=Gaij+(5−ij)3nj∈<aijxnj>N. Note that aij+(5−ij)3nj is a nontrivial element of \nicefracZ5Z for any ij=0 and nj=0(mod4). Hence we have that a∈<aijxnj>N in all subcases. Thus H is a quotient of \nicefracZnjZ, and so H is abelian.
Case D: There is a j∈{1,...,k} such that ij=0 and nj=0(mod4) is nonzero.
Note that in this case nj−2=2(mod4), so xnj−2aij=Ga4ijxnj−2. Thus
xnj−2 (aijxnj)x−(nj−2)=Ga−ijxnj∈<aijxnj>N. This implies that (a−ijxnj)−1=Gaijx−nj∈ <aijxnj>N. Hence (aijxnj)(aijx−nj)=Ga2ij∈<aijxnj>N. As a2ij is a nontrivial element of \nicefracZ5Z for all ij=0,
in all subcases we have that a∈<aijxnj>N. Thus H is a quotient of \nicefracZnjZ, and so H is abelian.
Case E: For every j∈{1,...,k}, ij=0 and nj=0(mod4) is nonzero.
Note that we can simplify the quotient to \nicefracG<xgcd(n1,...,nk)>N in this case and that gcd(n1, ...,nk)≥4. Consider the generating set B={(ax),(xa)}±1. Observe that (ax)−1=Ga3x−1 and (a3x−1)(xa)=Ga−1 so this is in fact a generating set for G, and thus for H as well. Note that (ax)(xa)(ax)−1=Ga3x. As a has order 5 in H, none of the generators in B are equal in H to a3x. A word w∈B∗ of length two represents a group element h∈G with a normal form w′ over A that has an even power of x. So no words in B∗ of length two can be equal in H to a3x. Hence the word (ax)(xa)(ax)−1 is geodesic in H. Therefore by Lemma 3.1, the geodesic language of H over B is not piecewise excluding.
∎
Lemma 3.4**.**
All proper quotients of the group G=BS(1,2)=<a,t∣tat−1a−2> are either abelian or, for some finite symmetric generating set, have a geodesic language which is not piecewise excluding.
Proof.
First note that a set of normal forms for G over {a,t}±1 is {t−iantj∣i,j∈(N∪0),n∈Z,and 2∤n if both i,j>0}. Any proper quotient H of G is isomorphic to \nicefracG<t−i1an1tj1,t−i2an2tj2,...,t−imanmtjm>N for some {t−ikanktjk}k=1m where for each k∈{1,...,m }, ik,jk∈(N∪0),nk∈Z, ik,jk,nk are not all zero, and ik=jk whenever nk=0. Let H be a non-abelian proper quotient of G. We first show that H is a quotient of one of a specific collection of semi-direct products.
Case 1: Suppose there is an index k such that nk=0.
Note that t−ikanktjk=H1H. If ik=jk then ank=H1H. If ik=jk then tik−jk=Hank, which is equal in G to t−1a2nkt. Hence tik−jk=Ha2nk, and so ank=Ha2nk, which implies that ank=H1H and thus that tik−jk=H1H.
If nk is even, then tank/2=Gankt=Ht, which implies that ank/2=H1H. So we can continue cutting the known order of a in H in half until we are left with an odd number, call it n. Then ta=Ga2t implies the relations tal=Ha2lt for every integer l such that 1≤l<n/2 and tal=Ha2l−nt for every integer l such that n/2<l<n. These relations allow us to move a±1 past t±1 in either direction in any word.
Thus H is a quotient of the semidirect product \nicefracZnZ⋊Z=<a,t∣an,tat−1a−2> (if ik=jk) or of the semidirect product \nicefracZnZ⋊\nicefracZ∣ik−jk∣Z=<a,t∣an,t∣ik−jk∣,tat−1a−2> (if ik=jk), with n odd in either case.
Case 2: Suppose there is an index k such that nk=0.
Then ik−jk=0, so we may replace t−1 with t∣ik−jk∣−1 in the relation tat−1=Ga2 and obtain the relations t−1a=Ha2∣ik−jk∣−1t−1 and at=Hta1−2∣ik−jk∣−1. So a=Gt−1a2t=Ha2∣ik−jk∣, which implies that a2∣ik−jk∣−1=H1H. Hence H is a quotient of the semidirect product \nicefracZ(2∣ik−jk∣−1)Z⋊\nicefracZ∣ik−jk∣Z=<a,t∣a2∣ik−jk∣−1,t∣ik−jk∣,tat−1a−2>.
Because H is non-abelian, Cases 1 and 2 show that H is isomorphic to either a quotient of \nicefracZnZ⋊Z with n odd and at least three or to a quotient of \nicefracZnZ⋊\nicefracZ∣i−j∣Z with n odd and at least three and ∣i−j∣≥2.
Note that if ∣i−j∣=2, then a=Ht2a=Ha4t2=Ha4. So in this case a3=H1H and, moreover, H is isomorphic to a quotient of S3=<x,y∣x2,y2,(xy)3>. This means that either H has a geodesic language which is not piecewise excluding or H is abelian: if H≅S3 then the word xyx−1 is geodesic over the generating set {x,y}±1; if H is a proper quotient of S3 then H is abelian. Note that if ∣i−j∣=3, then a=Ht3a=Ha8t3=Ha8. So in this case a7=H1H and, moreover, H is isomorphic to a quotient of \nicefracZ7Z⋊\nicefracZ3Z= <a,t∣a7,t3,tat−1a−2>. This means that either H has a geodesic language which is not piecewise excluding or H is abelian: if H≅\nicefracZ7Z⋊\nicefracZ3Z then the word (at)t(at)−1 is geodesic over the generating set {(at),t}±1; if H is a proper quotient of \nicefracZ7Z⋊\nicefracZ3Z then H has order 1,3, or 7 and so is abelian.
What remains to be considered is when H is isomorphic to either \nicefracZnZ⋊Z with n odd and at least three or to \nicefracZnZ⋊\nicefracZ∣i−j∣Z, with n odd and at least three and ∣i−j∣>3. Let B={(at),(ta)}±1. Note that (at)−1=Ht−1an−1=G(a2n−1)t−1 and that (a2n−1t−1)(ta)=Ga2n+1. So as (a2n+1)2=Ha, the set B is a generating set for H. Consider the word (at)(ta)(at)−1, which is equal in G to a3t.
Note that a3t cannot be equal in H to a single generator as n∈/{1,2} and ∣i−j∣=2: the element at is equal to in H to a3t only if a2=H1; the element ta is equal in H to a3t only if a=H1; the elements (at)−1,(ta)−1 are equal in H to a3t only if t2=H1. Note also that a3t cannot be equal in H to a word of length two in the generators as ∣i−j∣∈/{1,3}: the words (at)(at),(at)(ta),(at)(ta)−1,(ta)(ta),(ta)(at),(ta)(at)−1, (at)−1(ta),(ta)−1(at) are equal in H to a3t only if t=H1; the words (at)−1(at)−1, (at)−1(ta)−1,(ta)−1(ta)−1,(ta)−1(at)−1 are equal in H to a3t only if t3=H1.
Therefore the word (at)(ta)(at)−1 is geodesic over B. By Lemma 3.1, the geodesic language of H over B is not piecewise excluding.
∎
\OnlyQ
Proof.
Consider a minimal symmetric generating set {a,b}±1 for a two generator non-abelian group G with piecewise excluding geodesic language for all finite symmetric generating sets. Because G is non-abelian, aba−1∈/{1,a,a−1,b}. Note that aba−1 is not geodesic by Lemma 3.1, so it must then be equal in G to either b−1 or to a product of two generators. It can be shown, by straight-forward computations, that ten of the sixteen choices for words of length two over {a,b}±1 also lead to contradictions if they are equal in G to aba−1. For example, aba−1=Gab−1 implies that b2=Ga, which contradicts the assumption that a and b do not commute. Thus a representative of aba−1 must be in the set {b−1,a−1b,a−1b−1,ba,b2,b−1a,b−2}. Similarly, the possibilites for representatives of bab−1 can be reduced to the set {a−1,b−1a,b−1a−1,ab,a2,a−1b,a−2}.
Table 1 shows the group defined by only the two relations in each of the forty-nine possible pairs of choices for representaives of aba−1 (along the first row) and for representatives of bab−1 (along the first column). Note that by symmetry, the upper and lower diagonals are isomorphic groups. Most of the finite groups were found by entering the presentation into the GAP system and referencing the small group information within GAP; some (those listed below) required referencing groupprops.subwiki.org. We refer readers unfamiliar with GAP to [6]. The pairs aba−1=Ga−1b−1 with bab−1=Gb−1a−1 and aba−1=Gb−1a with bab−1=Ga−1b both returned the group [24:3], which is SL2(\nicefracZ3Z). The pair aba−1=Gb−2 with bab−1=Ga−2 returned the group [27,4], which is \nicefracZ9Z⋊\nicefracZ3Z= <x,y∣x9,y3,yxy−1x−4>. Notice that aba−1=a−1b and bab−1=a2 are actually both the same relation, so this pair yields the group BS(1,2). Groups which were reported to be infinite were calculated by hand using Tietze transformations.
[TABLE]
Table 1.
The map α in the entry \nicefracZ5Z⋊αZ is defined by the generator of Z conjugating the generator of \nicefracZ5Z to its square and the map β in the entry \nicefracZ9Z⋊β\nicefracZ3Z is defined by the generator of \nicefracZ3Z conjugating the generator of \nicefracZ9Z to its fourth power. The group \nicefracZ3Z⋊Z is the non-trivial semi-direct product.
The group G must be a quotient of one of the groups in the table. All quotients of abelian groups are abelian, so G cannot be a quotient of an abelian group in the table. The groups which are non-abelian but have a geodesic language which is not piecewise excluding for some finite symmetric generating set, demonstrated below, are denoted by a single dagger. We show below that all proper quotients of each of these groups are either abelian or have a geodesic language which is not piecewise excluding for some finite symmetric generating set. In each case of a geodesic language which is not piecewise excluding, a check of all words of length at most two against a set of normal forms shows that the given length three word is geodesic.
The group S3=<a,b∣a2,b2,(ab)3> with the generating set A={a,b}±1 has aba−1∈Geo(S3,A). So by Lemma 3.1 Geo(S3,A) is not piecewise excluding. The only proper quotients of S3 are abelian. Thus G cannot be a quotient of S3.
The group SL2(\nicefracZ3Z)=<a,b∣a6,b4,ab−1ab−1ab> with the generating set A={a,b}±1 has bab−1∈Geo(SL2(\nicefracZ3Z),A). So by Lemma 3.1 Geo(SL2(\nicefracZ3Z),A) is not piecewise excluding. The only proper quotients of SL2(\nicefracZ3Z) are quotients of A4 and quotients of \nicefracZ3Z (see groupprops.subwiki.org). The group A4=<a,b∣a3,b2,(ab)3> with the generating set B={a,b}±1 has bab−1∈Geo(A4,B). By Lemma 3.1 Geo(A4,B) is not piecewise excluding. The only proper quotients of A4 are abelian. Thus G cannot be a quotient of SL2(\nicefracZ3Z).
The group \nicefracZ9Z⋊β\nicefracZ3Z=<x,y∣x9,y3,yxy−1x−4> with the generating set A={x,y}±1 has xyx−1∈Geo(\nicefracZ9Z⋊β\nicefracZ3Z,A). By Lemma 3.1 Geo(\nicefracZ9Z⋊β\nicefracZ3Z,A) is not piecewise excluding. As nontrivial proper subgroups of \nicefracZ9Z⋊\nicefracZ3Z have order either 3 or 32, proper nontrivial quotients of \nicefracZ9Z⋊\nicefracZ3Z have order either 32 or 3 and thus are abelian. Hence G cannot be a quotient of \nicefracZ9Z⋊β\nicefracZ3Z.
Lemma 3.4 shows that the group \nicefracZ3Z⋊Z=<a,x∣a3,xax−1a>≅\nicefracBS(1,2)<a3>N and all its proper quotients are either abelian or have a finite symmetric generating set with geodesic language which is not piecewise excluding. Thus G cannot be a quotient of \nicefracZ3Z⋊Z.
The group \nicefracZ5Z⋊αZ=<a,x∣a5,xax−1a2> with the generating set A={x,y}±1, where y=Gx3a, has yxy−1∈Geo(\nicefracZ5Z⋊αZ,A). By Lemma 3.1 Geo(\nicefracZ5Z⋊αZ,A) is not piecewise excluding. Lemma 3.3 shows that all proper quotients of \nicefracZ5Z⋊αZ are either abelian or have a finite symmetric generating set with geodesic language which is not piecewise excluding. Thus G cannot be a quotient of \nicefracZ5Z⋊αZ.
The group BS(1,2)=<a,t∣tat−1a−2> with the generating set A={a,t}±1 has t−1at∈Geo(BS(1,2),A). By Lemma 3.1 Geo(BS(1,2),A) is not piecewise excluding. Lemma 3.4 shows that all proper quotients of BS(1,2) are either abelian or have a finite symmetric generating set with geodesic language which is not piecewise excluding. Thus G cannot be a quotient of BS(1,2).
The quaternion group, Q8, denoted by a double dagger, has piecewise excluding geodesic language for all finite symmetric generating sets by Theorem 1.2. The only proper quotients of Q8 are abelian. Therefore, as all other possibilities lead to contradictions of our assumptions, the group G must be isomorphic to Q8.
∎
The class of groups with piecewise excluding geodesic languages for all finite symmetric generating sets does not even have one of the nicest closure properties one might hope for.
\QxQ
Proof.
Consider the generating set A={i1,j1k2,i2,k2}±1 for the group G=Q8×Q8, where i,j,k are as in the generating set for Q8=<i,j,k∣ijk−1,jki−1, kij−1,i4> and the subscripts denote to which copy of Q8 each belongs. Consider the element g=i1(j1k2)i1−1=Gi12j1k2. Note that g∈/A. If g=Gab for some a,b∈A, then exactly one of a,b must be (j1k2)±1 or (k2)±1 and the other must be i1±1 so that the projection into the second copy of Q8 is k2. But that forces the projection into the first copy of Q8 to be one of i1±1,k1±1. Hence g cannot be written with fewer than three generators, and so i1(j1k2)i1−1∈Geo(G,A). Thus Geo(G,A) is not piecewise excluding by Lemma 3.1.
∎
Proposition 3.5**.**
Let Zn=<xi,...xn∣[xi,xj] whenever i=j> and let G=Zn⋊ϕ\nicefracZ2Z for some n∈N with either (1) ϕ(xi)=xi−1 for some i∈{1,...,n} and ϕ(xk)=xk for all k∈{1,...,n}∖{i} or (2) ϕ(xi)=xj for some i,j∈{1,...,n} with i=j and ϕ(xk)=xk for all k∈{1,...,n}∖{i,j}. Then for every finite symmetric generating set of A of G, the geodesic language of G over A is not piecewise excluding. Moreover, there is a geodesic word over A containing both a generator and its inverse.
Proof.
Let B={x1,...,xn,y}±1, where \nicefracZ2Z=<y>, and let N={x1m1⋯xnmnyϵ∣mi ∈Z for all i∈{1,...,n} and ϵ∈{0,1}}, a set of normal forms for G over B. Let A be any finite symmetric generating set for G. For every word w∈A∗, let ρN(w) be the unique word in N such that ρN(w)=Gw.
Case 1: ϕ(xi)=xi−1 for some i∈{1,...,n} and ϕ(xh)=xh for all h∈{1,...,n}∖{i}.
Subcase A: Suppose there is a generator α∈A such that ρN(α)=x1m1⋯xim⋯xnmn for some m∈Z∖{0}.
Let a∈A be the generator with ρN(a)=x1m1⋯xim⋯xnmn such that m is maximal. Note that m>0 because A is symmetric and that there must be at least one generator in β∈A such that ρN(β)=x1k1⋯xnkny. Let b∈A be the generator with ρN(b)=x1k1⋯xik⋯xnkny such that k is maximal. Suppose that aba−1 is not geodesic. Observe that ρN(aba−1)=x1k1⋯xi2m+k⋯xnkny.
subsubcase i: The word aba−1=Gγ for some γ∈A. Because m>0 implies that 2m+k>k, no generator γ∈A with ρN(γ)=x1k1⋯xi2m+k⋯xnkny exists by maximality of k.
subsubcase ii: The word aba−1=Gδζ for some δ,ζ∈A with ρN(δ)=x1m1′⋯xip⋯ xnmn′ and ρN(ζ)=x1k1′⋯xiq⋯xnkn′y. Then p+q=2m+k. But the pair of inequalites p≤m and q≤k imply that p+q≤m+k<2m+k. Thus no such pair of generators δ,ζ∈A exists.
subsubcase iii: The word aba−1=Gζδ for some δ,ζ∈A with ρN(δ)=x1m1′⋯xip⋯ xnmn′ and ρN(ζ)=x1k1′⋯xiq⋯xnkn′y. Then q−p=2m+k. But if p≥0, then q−p≤q≤k<2m+k; if p<0, then ∣p∣≤m implies that q−p≤k+m<2m+k. Thus no such pair of generators δ,ζ∈A exists.
Hence aba−1 is geodesic over A.
Subcase B: Suppose there is no generator α∈A such that ρN(α)=x1m1⋯xim⋯xnmn for some m∈Z∖{0}.
Let a∈A be the generator with ρN(a)=x1m1⋯xim⋯xnmny such that m is maximal. Let b∈A be the generator with ρN(b)=x1k1⋯xik⋯xnkny such that k is minimal. Note that k=m, as otherwise A generates only elements of G with the power of xi in normal form either [math] or m. Suppose that aba−1 is not geodesic. Observe that ρN(aba−1)=x1k1⋯ xi2m−k⋯xnkny. Let δ,ζ∈A where ρN(δ)=x1m1′⋯xip⋯xnmn′yϵ1 and ρN(ζ)=x1k1′⋯xiq⋯xnkn′yϵ2. Note that ρN(δζ)=x1m1′+k1′⋯xip+(−1)ϵ1q⋯xnmn′+kn′yϵ1+ϵ2(mod2) and that if ϵ1=0 [or ϵ2=0], then p=0 [q=0]. So p+(−1)ϵ1q≤m whenever ϵ1+ϵ2(mod2)=0. If aba−1 is equal in G to a generator γ∈A with ρN(γ)=x1k1⋯xi2m−k⋯xnkny or aba−1=Gδζ, we have a contradiction to our choices of a and b since k<m implies that 2m−k>m. Hence aba−1 is geodesic over A.
Case 2: ϕ(xi)=xj for some i,j∈{1,...,n} with i=j and ϕ(xh)=xh for all h∈{1,...,n}∖{i,j}.
Subcase A: Suppose there is a generator α∈A such that ρN(α)=x1m1⋯xim⋯xjk⋯ xnmn for some m=k∈Z.
Let c∈A be the generator with ρN(c)=x1m1⋯xim0⋯xjk0⋯xnmn such that ∣m0−k0∣ maximal. Note that ∣m0−k0∣>0 by the assumption of this subcase and that there must be at least one generator β∈A such that ρN(β)=x1k1⋯xnkny. Let b∈A be the generator with ρN(b)=x1k1⋯xip⋯xjq⋯xnkny such that ∣p−q∣ is maximal. If the signs of m0−k0 and p−q agree or if p=q, let a=c; otherwise, let a=c−1. Let m,k∈Z be such that ρN(a)=Gx1m1⋯xim⋯xjk⋯xnmn. Suppose that aba−1 is not geodesic. Observe that ρN(aba−1)=x1k1⋯xim+p−k⋯xjk+q−m⋯xnkny. Becuase the signs of m−k and p−q do not disagree, the difference in the powers of xi and xj in ρN(aba−1) is ∣(m+p−k)−(k+q−m)∣=∣2(m−k)+(p−q)∣=2∣m−k∣+∣p−q∣.
subsubcase i: The word aba−1=Gγ for some γ∈A. Because ∣m−k∣>0 implies that 2∣m−k∣+∣p−q∣>∣p−q∣, no generator γ∈A with ρN(γ)=x1k1⋯xim+p−k⋯xjk+q−m⋯xnkny exists by our choice of b.
subsubcase ii: The word aba−1=Gδζ for some δ,ζ∈A with ρN(δ)=x1m1′⋯xil⋯ xjr⋯xnmn′ and ρN(ζ)=x1k1′⋯xis⋯xjt⋯xnkn′y. Then l+s=m+p−k and r+t=k+q−m. But the pair of inequalities ∣l−r∣≤∣m−k∣ and ∣s−t∣≤∣p−q∣ imply that ∣(l+s)−(r+t)∣≤∣m−k∣+∣p−q∣<2∣m−k∣+∣p−q∣. Thus no such pair of generators δ,ζ∈A exists.
subsubcase iii: The word aba−1=Gζδ for some δ,ζ∈A with ρN(δ)=x1m1′⋯xil⋯ xjr⋯xnmn′ and ρN(ζ)=x1k1′⋯xis⋯xjt⋯xnkn′y. Then r+s=m+p−k and l+t=k+q−m. But the pair of inequalities ∣l−r∣≤∣m−k∣ and ∣s−t∣≤∣p−q∣ imply that ∣(r+s)−(l+t)∣≤∣m−k∣+∣p−q∣<2∣m−k∣+∣p−q∣. Thus no such pair of generators δ,ζ∈A exists.
Hence aba−1 is geodesic over A.
Subcase B: Suppose there is no generator α∈A such that ρN(α)=x1m1⋯xim⋯xjk⋯ xnmn for some m=k∈Z.
Let a∈A be the generator with ρN(a)=x1m1⋯xim⋯xjk⋯xnmny such that ∣m−k∣ is maximal. Let b∈A be the generator with ρN(b)=x1k1⋯xip⋯xjq⋯xnkny such that ∣p−q∣ is minimal. Note that ∣m−k∣=∣p−q∣ as otherwise A would only generate elements of G with even differences in powers of xi and xj in normal forms without a y: the product (x1m1′⋯xic⋯xjd⋯xnmn′y)(x1k1′⋯xie⋯xjf⋯xnkn′y)=Gx1m1′+k1′⋯xic+f⋯xjd+e⋯xnmn′+kn′; if ∣c−d∣=∣e−f∣ then ∣(c+f)−(d+e)∣=∣(c−d)−(e−f)∣, which is either [math] or 2∣c−d∣. Suppose that aba−1 is not geodesic. Observe that ρN(aba−1)=x1k1⋯xim+q−k⋯xjk+p−m⋯xnkny. Because ∣m−k∣>∣q−p∣ implies that (m−k)+(q−p) has the same sign as that of m−k, the difference in the powers of xi and xj in ρN(aba−1) is ∣(m+q−k)−(k+p−m)∣=∣(m−k)+(q−p)+(m−k)∣=∣(m−k)+(q−p)∣+∣m−k∣>∣m−k∣. The word aba−1 must either be equal in G to a generator γ∈A with ρN(γ)=x1k1⋯xim+q−k⋯xjk+p−m⋯xnkny or to a product of generators δ,ζ∈A with ρN(δ)=x1l1⋯xit⋯xjt⋯xnln and ρN(ζ)=x1l1′⋯xir⋯xjs⋯xnln′y such that t+r=m+q−k and t+s=k+p−m (note that δζ=Gζδ). By our choice of a, the largest possible difference in the powers of xi and xj in ρN(γ), ρN(δζ), or ρN(ζδ) is ∣m−k∣. Therefore neither such a generator γ nor such a pair of generators δ,ζ exists. Hence aba−1 is geodesic over A.
Thus aba−1∈Geo(G,A) for the generators a and b defined in each subcase. By Lemma 3.1 Geo(G,A) cannot be piecewise excluding.
∎
\VA
\Extns
Proof.
Let ab1b2⋯bna−1∈Geo(K,π(A)) for some a∈π(A),b1,...,bn∈π(A). For each x∈π(A), choose a unique preimage under π in A, denoted xˉ, such that x−1=xˉ−1. If aˉb1ˉb2ˉ⋯bnˉaˉ−1∈/Geo(G,A), then there is a word of length at most n+1 over A equal in G to aˉb1ˉb2ˉ⋯bnˉaˉ−1, say it is x1x2⋯xk. Then π(x1x2⋯xk)=Kπ(x1)π(x2)⋯π(xk)=Kab1b2⋯bna−1, which implies that ab1b2⋯bna−1 is not geo- desic, giving a contradiction. Thus aˉb1ˉb2ˉ⋯bnˉaˉ−1 must be geodesic, and so by Lemma 3.1, Geo(G,A) cannot be piecewise excluding.
∎
Corollary 3.6**.**
Let Zn=<xi,...xn∣[xi,xj] whenever i=j> and let G=Zn⋊ϕ\nicefracZ2Z for some n∈N with either ϕ(xi)=xi−1 for some i∈{1,...,n} and ϕ(xk)=xk for all k∈{1,...,n}∖{i} or ϕ(xi)=xj for some i,j∈{1,...,n} with i=j and ϕ(xk)=xk for all k∈{1,...,n}∖{i,j}. Then any group with a quotient isomorphic to G has a geodesic language which is not piecewise excluding for any finite symmetric generating set.