Extending the Synchronous Fellow Traveler Property
Abstract
We introduce an extension of the fellow traveler property which allows fellow travelers to be at distance bounded from above by a function growing slower than any linear function. We study normal forms satisfying this extended fellow traveler property and certain geometric constraints that naturally generalize two fundamental properties of an automatic normal form – the regularity of its language and the bounded length difference property. We show examples of such normal forms and prove some non–existence theorems.
Keywords: fellow traveler property, normal form, quasigeodesic, prefix–closed, Baumslag–Solitar group, wreath product
1 Introduction
The fellow traveler property is a cornerstone of the theory of automatic groups introduced by Thurston and others [8]. A normal form of a group satisfies the fellow traveler property if every two normal forms of group elements which are at distance one (with respect to some fixed set of generators) are –fellow travelers for some positive integer . The latter, informally speaking, means that when two fellow travelers are synchronously moving with the same speed along the paths labeled by such normal forms they are always at distance at most from each other. Each automatic group admits an automatic structure that includes a normal form which satisfies the fellow traveler property [8, § 2.3]. If a normal form of a group satisfies the fellow traveler property and its language is regular, then the group must be automatic.
The idea of extending automatic groups while retaining the fellow traveler property or its natural relaxations is not new. Requiring the fellow traveler property for a normal form but dropping the regularity condition for its language leads to the notions of a combing and a combable group. Bridson showed that there exist combable groups which are not automatic [4]111Note that the notion of a combable group used by Bridson is different from the one originally introduced by Epstein and Thurston [8, § 3.6].. A more general approach is to allow fellow travelers moving with different speeds. This leads to the notion of the asynchronous fellow traveler property. Thurston showed that the Baumslag–Solitar group for admits a normal form which satisfies the asynchronous fellow traveler and the language of this normal form is regular [8, § 7.4]. Bridson and Gilman showed that the fundamental group of a compact –manifold admits a normal form which satisfies the asynchronous fellow traveler property and its language is indexed [5].
In this paper we consider a relaxation of the fellow traveler property requiring fellow travelers to move with the same speed (synchronously) but allowing them to be at distance bounded from above by , where is a function growing slower than any linear function, e.g., for or , and is the distance that fellow travelers traversed starting from the origin, see Definition 5. In this case we say that a normal form satisfies the –fellow traveler property. First in the subsection 3.1 we notice that such normal forms can be trivially constructed. So then in the subsection 3.2 we introduce two types of geometric constraints each of which makes constructing such normal forms nontrivial. The first geometric constraint requires a normal form to be quasigeodesic. It is a relaxation of the bounded length difference property222Note the bounded length difference property is referred to as the comparable length property in [4]. Also, the bounded length difference property is incorporated in the notion of a combable group introduced by Epstein and Thurston. It is an open question whether there exists a combable group in the sense of Epstein and Thurston which is not automatic. [8, Lemma 2.3.9] which requires the geodesic length of a group element and the length of its normal form to be linearly comparable, see Definition 6. The second geometric constraint requires a normal form to be quasiregular. It is a relaxation of the regularity condition for the language of a normal form which requires that for each prefix of a normal form of a group element there exists a word of length at most for which is a normal form of some group element, see Definition 7. Alternatively, quasiregularity can be considered as a relaxation of prefix–closedness; see also Definition 8 and Theorem 9.
The main results of the paper are as follows. In Theorems 14 and 15 we show that there exists no quasigeodesic normal form which satisfies the –fellow traveler property in a finitely presented group with the strongly–super–polynomial Dehn function and a non–finitely presented group, respectively; see Definition 12 for the notion of a strongly–super–polynomial function. In Theorem 16 we show relation between the notion of a Cayley distance function studied by Elder, Taback, Trakuldit and the second author [1, 2, 3] and quasigeodesic normal forms satisfying the –fellow traveler property. Namely, Theorem 16 shows that if a non–automatic group has a Cayley automatic representation for which the Cayley distance function grows slower than a linear function333The existence of such Cayley automatic representations is an open question., then this group admits a quasigeodesic normal form satisfying the –fellow traveler property. Theorem 17 shows that for the Baumslag–Solitar group admits a prefix–closed (so quasiregular) normal form satisfying the –fellow traveler property. Theorem 20 shows that the wreath product admits a prefix–closed normal form satisfying the –fellow traveler property444Note that by Theorems 14 and 15 the groups for and do not admit quasigeodesic normal forms satisfying the –fellow traveler property..
The rest of the paper is organized as follows. In Section 2 we recall the notions of a group, a normal form, an automatic group, the fellow traveler property and the relations and for nondecreasing functions appeared in this paper. In Section 3 we introduce the –fellow traveler property, quasigeodesic and quasiregular normal forms. In Section 4 for quasigeodesic normal forms satisfying the –fellow traveler property we prove the non–existence theorems in groups with the strongly–super–polynomial Dehn function and non–finitely presented groups and show relation with the notion of a Cayley distance function. In Section 5 we show examples of quasiregular normal forms satisfying the –fellow traveler property. Section 6 concludes the paper.
2 Preliminaries
In this section we introduce necessary notations and recall some definitions.
Groups and normal forms. Let be a finitely generated infinite group and , where for , be a finite set generating : each element of can be written as a product of elements from and their inverses. We allow different , , to be equal in and some elements in to be equal the identity . We denote by the set of formal inverses for elements in : and by the union of and : . We denote by the word metric in relative to : for the distance is the length of a shortest word equal to in . For a given we denote by the distance between and the identity with respect to : . For a given , we denote by the length of : and by the group element , where refers to the canonical projection map .
A normal form of is a rule for assigning a word to a group element such that . The word is referred to as a normal form of . In this paper we always assume that a normal form is one–to–one: for each exactly one word is assigned. A normal form defines a language . Similarly, a language for which the restriction is surjective and one–to–one defines a normal form of .
The fellow traveler property and automatic groups. Let be a word and be a nonnegative integer. We define to be the prefix of of a length if and if . Let be a normal form of . We denote by a function defined as:
(1) |
The function is the maximum distance between fellow travelers moving with the same speed along the paths in labeled by words and for which for some .
Definition 1 (the fellow traveler property).
It is said that the normal form satisfies the fellow traveler property if the function given by (1) is bounded from above by a constant.
Recall that the group is called automatic if it admits a normal form for which the language is regular and for each the binary relation is recognized by a two–tape synchronous automaton [8]. In this case the normal form satisfies the fellow traveler property. Equivalently, if admits a normal form which satisfies the fellow traveler property and is regular, then must be automatic [8, Theorem 2.3.5]. In this paper we focus on groups which are not automatic (non–automatic groups).
The relations and for nondecreasing functions. We denote by a set of all natural numbers which includes zero. For a given we denote by the set . Let be the set of all nondecreasing functions , where .
Definition 2 ( relation).
For given we say that if there exist positive integers and a nonnegative such that for all . We say that if and . If and , we say that .
Definition 3 ( relation).
For given we say that if there exists an unbounded function such that .
We denote by the identity function: . Note that is stronger than , that is, implies . Indeed, implies . Now suppose that and . The inequality implies that there exist positive integers and a nonnegative integer such that for all . The inequality implies that there exist positive integers and a nonnegative integer such that for all , where is some unbounded function. Therefore, for all , which implies that also for all . Since is unbounded, we get a contradiction. Therefore, we have that , so . The reverse ( implies ) in general is not true as it is shown in Example 4.
Example 4.
Let be an infinite sequence defined recursively by the identities: , and for . Let be a function for which for . Clearly, . Let us show that . The inequality implies that there exist positive integers and such that for all . Therefore, if , then . By the definition of , if , then . Therefore, if and , then . The latter inequality is true only if and false, otherwise. Thus, . Therefore, . Let us show now that . The inequality implies that there exist positive integers and a nonnegative integer such that for some unbounded and all . Since is unbounded, there exists such that for all , which implies that for all . The latter is impossible for .
3 The –Fellow Traveler Property
We extend the fellow traveler property by allowing the distance between fellow travelers to be bounded from above by a nondecreasing function . If is bounded from above by a constant, then one simply gets the fellow traveler property, see Definition 1. We will allow the function to be unbounded.
Definition 5 (the –fellow traveler property).
Let be a function for which . We say that a given normal form of a group satisfies the –fellow traveller property if for the function given by (1) the inequality holds.
In Definition 5 the function is an upper bound for the distance between fellow travelers in coarse sense. It can be verified that Definition 5 does not depend on the choice of the set of generators . By the triangle inequality, for every normal form in we always have that for all . From Example 4 we see that there exists a function for which at infinitely many points. If , then, informally speaking, genuinely grows slower than . This explains the choice of the inequality over the inequality in Definition 5. For illustration of the –fellow traveler property see Fig. 1.

3.1 Normal forms satisfying the –fellow traveler property
We now show two ways of modifying a given normal form so the modified normal form satisfies the –fellow traveler property for some . Let us be given a normal form of a group defined by a language .
First way. Let be a word defining a loop in : . We define a language as . That is, for every we attach a prefix to the word , where . See Figure 2 for illustration. For a normal form given by a language the function is bounded from above by : . Indeed, let us consider two words and for which . Let , and . Without loss of generality we assume that . We denote by a number of steps traversed by fellow travelers along the paths labeled by and . There are three different cases to consider:
-
•
If , then the distance between fellow travelers is bounded from above by .
-
•
If , then the distance between fellow travelers is bounded from above by , so it is strictly less than .
-
•
If , then the distance between fellow travelers is bounded from above by +, so it is strictly less than .
From these three cases it can be seen that for the normal form defined by the language .

Second way. Let be a nonempty word in the language . For each integer , let us choose a loop for which for some fixed constants . These loops , can be chosen arbitrarily for each and , where . Let . If , then we put . We define a language as . See Figure 3 for illustration.
For a normal form given by a language the function is bounded from above by : . Indeed, let us consider two words and for which . For the words and , let and , respectively. Let be a number of steps traversed by fellow travelers along the paths labeled by and . We denote by the integer for which , where either and or is a proper prefix of . Similarly, we denote by the integer for which , where either and or is a proper prefix of . Now the distance between fellow travelers is bounded from above by . On the other hand, we have that and for some constant . Therefore, for the normal form defined by the language .

3.2 Quasigeodesic and quasiregular normal forms
We introduce two kinds of geometric constraints for a normal form which originate from two basic properties of an automatic normal form: the bounded length difference property [8, Lemma 2.3.9] and the regularity of its language. These geometric constraints in general are an obstacle for trivial constructions of normal forms satisfying the –fellow traveler property shown in the subsection 3.1. In this paper normal forms satisfying these geometric constraints are referred to as quasigeodesic and quasiregular.
Quasigeodesic normal forms. Recall that the bounded length difference property for the normal form defined by a language means that there exists a constant such that for every for which for some the inequality holds. Let , where is the normal form of the identity . Then the bounded length difference property implies that for every we have . The latter is the notion of a quasigeodesic normal form introduced by Elder and Taback [7], see Definition 6. Note that for a normal form being quasigeodesic, in general, does not imply having the bounded length difference property.
Definition 6 (quasigeodesic normal form).
A normal form defined by a language is said to be quasigeodesic if there is a constant such that for every the inequality holds.
Note that if is a quasigeodesic normal form in the sense of Definition 6, the paths labeled by elements of might not be quasigeodesics in the standard sense, i.e., not every subword of needs to satisfy the inequality . We notice that normal forms constructed in the subsection 3.1 are not quasigeodesic. Indeed, for the first way we have that the normal form of a group element is , where . Since and , the inequality cannot hold for all and some constant . For the second way we have that the normal form of a group element is . Since and , the inequality cannot not hold for all and some constant .
Quasiregular normal forms. In Definition 7 we introduce the notion of a quasiregular normal form. We consider it as a geometric version of the regularity of the language defining a normal form. Indeed, if a language is regular, then the normal form it defines is quasiregular. Note that a quasiregular normal form does not necessarily define a regular language .
Definition 7 (quasiregular normal form).
We say that a normal form defined by a language is quasiregular if there exists a constant such that for each prefix of a word there is a word of length for which .
We notice that a normal form constructed using the first way in the subsection 3.1 is not quasiregular. Indeed, there are infinitely many words , where is a fixed loop and , that represent group elements for which the distances to are bounded by some constant from above. The number of such group elements is finite. Since we consider only one–to–one normal forms, the latter is impossible. Also, there does not seem to be any trivial construction of quasiregular normal forms using the second way in the subsection 3.1.
One can consider a more restricted version of the notion of a quasiregular normal forms by additionally requiring in Definition 7 that is a prefix of . This leads to the notion of a quasiprefix–closed normal form introduced in Definition 8.
Definition 8 (quasiprefix–closed normal form).
We say that a normal form defined by a language is quasiprefix–closed if there exists a constant such that for every prefix of a word there is a prefix of length of the word for which .
Prefix–closed normal forms are exactly quasiprefix–closed normal forms with the constant . A quasiprefix–closed normal form is quasiregular. The reverse in general is not true. However, Theorem 9 shows that if a quasiregular normal form satisfies the –fellow traveler property, then one can construct a quasiprefix–closed normal form which also satisfies the –fellow traveler property. So in the context of the –fellow traveler property the notions of a quasiregular normal form and a quasiprefix–closed normal form are equivalent.
Theorem 9.
Suppose defines a quasiregular normal form for some constant which satisfies the –fellow traveler property. Then one can construct a quasiprefix–closed normal form for the constant which also satisfies the –fellow traveler property.
Proof.
First we note that if , then the normal form defined by the language is prefix–closed. So we further assume that . Now let be a prefix of length of a word for an integer . Since is a quasiregular normal form, there exists of length for which . Let be any word of length . We define to be the word , where and are the inverses of and , respectively. The word depends on only.
A word can be always written as a concatenation of words and , where and . For each word we construct a word as follows:
(2) |
We define a language as . Let us show that is a quasiprefix–closed normal form for the constant . We denote by the words for which . Let be a prefix of . There are the following three possibilities.
-
•
The prefix is of the form , where and is a prefix of . By the definition of , we have that . Let . It can be seen that , is a prefix of and is a prefix of . Let . Then , so .
-
•
The prefix is of the form , where and is a prefix of . If is a prefix of , then we put . If is not a prefix of , then we put , where if and if . It can be seen that , is a prefix of and is a prefix of . In the first case when is a prefix of , we have that . In the second case when is not a prefix of , we have that .
-
•
The prefix is of the form , where is a prefix of . Let . Then , is a prefix of and is a prefix of . We have that .
It is straightforward from (2) that if satisfies the –fellow traveler property, then also satisfies the –fellow traveler property. ∎
4 Quasigeodesic Normal Forms
This section discusses quasigeodesic normal forms in the context of the –fellow traveler property. In the subsection 4.1 we show that groups with the strongly–super–polynomial Dehn function and non–finitely presented groups do not admit quasigeodesic normal forms satisfying the –fellow traveler property. In the subsection 4.2 we show relation with the notion of a Cayley distance function.
4.1 Non–existence theorems
This subsection presents non–existence theorems for quasigeodesic normal forms satisfying the –fellow traveler property. First we consider finitely presented groups. We show that if the Dehn function of a group is strongly–super–polynomial (see Definition 12), then it does not admit a quasigeodesic normal form satisfying the –fellow traveler property (see Theorem 14). Then we consider non–finitely presented groups. We show that they do not admit quasigeodesic normal forms satisfying the –fellow traveler property (see Theorem 15).
Finitely presented groups. Let be a group. We assume first that is finitely presented. Let be a finite presentation of . We denote by a free group on . Let be a reduced word for which in the group . Let us recall the definitions of a combinatorial area and the Dehn function.
Definition 10 (combinatorial area).
The area with respect to the presentation is the minimum for which in , where and .
Definition 11 (Dehn function).
The Dehn function of with respect to the presentation is the function such that .
Now we recall the notion of a strongly–super–polynomial function introduced in [1].
Definition 12 (strongly–super–polynomial function).
A non–zero function is said to be strongly–super–polynomial if .
Note that for every , one has that if and only if [1]. Strongly–super–polynomial functions include, for example, exponential functions.
The following lemma is a key ingredient in the proof of Theorem 14.
Lemma 13.
If a group admits a quasigeodesic normal form satisfying the –fellow traveler property, then there exist constants and such that for the Dehn function of with respect to the presentation the inequality holds for all .
Proof.
Suppose that admits a quasigeodesic normal form satisfying the –fellow traveler property. Let be a language defining such normal form in . Now let be a word for which in the group , where . For each , let be the normal form of the group element . We first divide a loop into subloops: , , .
For a given and we denote by the th symbol in the normal form , if , and , if . In particular, a prefix of of length is . For a given and , let be a shortest path connecting and : . For illustration see Figure 4.

For a given , let . Now we divide each subloop into smaller subloops : if , then , if , then and if , then . Therefore, for the area we have: .
Let be the function defined by the equation (1) for the normal form and the set of generators . We have: for and for . Since the normal form is quasigeodesic, there exists a positive integer such that for all .
If is an unbounded function we may assume that ; in particular, . The total number of terms in the expression is at most and each term is bounded from above by . Therefore, which implies that for all . Since the normal form satisfies the –fellow traveler property, we have that which implies that there exists a constant and such that for all . Therefore, . Let . Then we have that for all .
If the function is bounded from above by a constant, then we immediately obtain that . In particular, one can always get that for all for some integer constants and . ∎
Theorem 14.
If the Dehn function of a group with respect to the presentation is strongly–super–polynomial, then does not admit a quasigeodesic normal form that satisfies the –fellow traveler property.
Proof.
Let be the Dehn function of a group with respect to a presentation . Since the Dehn function is strongly–super–polynomial, . Therefore, there exist an unbounded function and constants such that for all :
(3) |
We prove the theorem by contradiction. Assume that admits a quasigeodesic normal form satisfying the –fellow traveller property for some function . By Lemma 13 there exist integer constants and such that for all :
(4) |
Let . By the inequalities (3) and (4) we obtain that for all :
Therefore, for all . Let and . Then, for all .
Let and . Then, for all as if, otherwise, for some , then which leads to a contradiction with the inequality . Since , there exists an unbounded function and constants such that for all . Let . From the inequalities and we conclude that for all . As the function is unbounded, we get a contradiction. ∎
Non–finitely presented groups. Now we assume that is a non–finitely presented group. In this case no additional assumptions are needed to show non–existence Theorem 15. Equivalently, Theorem 15 claims that if is a finitely generated group admitting a quasigeodesic normal form with the –fellow traveler property, then is finitely presented.
Theorem 15.
If is a non–finitely presented group, then does not admit a quasigeodesic normal form that satisfies the –fellow traveller property.
Proof.
First we notice that there exist infinitely many words for which such that for every decomposition of as the product , where and for , for some the length of is greater than or equal to the length of : . Indeed, if such infinitely many words did not exist, the group would be finitely presented. We denote the set of such words by .
We prove the theorem by contradiction. Assume that admits a quasigeodesic normal form satisfying the –fellow traveller property for some function . Let be a language defining such normal form in . Let be a word from the set . For each , let be the normal form of the group element . Similarly to Lemma 13, we divide a loop into subloops: , , …, , . For a given and we denote by the th symbol in the normal form , if , and , if . For a given and , we denote by a shortest path connecting and .
For a given , let . Similarly to the proof of Lemma 13, let us divide each subloop , into smaller subloops : if , then , if , then and if , then .
Let be the function defined by the equation (1) for the normal form and the set of generators . Let . Then, for all and , where we assume that is big enough so . Since the normal form is quasigeodesic, there exists an integer constant for which for all , so .
As for some , there exists an unbounded function for which . In particular, for all for some . Therefore, if , then for all and . Furthermore, we may assume that is big enough so . Since and , we get a contradiction. ∎
4.2 Relation with a Cayley distance function
We find relation with the notion of a Cayley distance function studied in [1, 2, 3]. A Cayley distance function is defined for an arbitrary bijection between a language and a group by the following identity:
where is the set of words in of length less than or equal to , and if .
Cayley automatic groups were introduced by Kharlampovich, Khoussainov and Miasnikov [10]. We recall that a group is called Cayley automatic if there exists a bijection for which is a regular language and for each the relation is recognized by a two–tape synchronous automaton. The bijection is referred to as a Cayley automatic representation of . Cayley automatic groups extend automatic groups retaining exactly the same computational model but allowing an arbitrary bijection , not only a canonical mapping like in the notion of an automatic group.
In [3] it is asked if there exists a Cayley automatic representation of a non–automatic group such that for the Cayley distance function the inequality holds. This problem can be slightly narrowed by requiring that . Theorem 16 shows that if such Cayley automatic representation exists, then admits a quasigeodesic normal form satisfying the –fellow traveler property.
Theorem 16.
If a non–automatic group has a Cayley automatic representation with the Cayley distance function , then there exists a quasigeodesic normal form that satisfies the –fellow traveler property.
Proof.
First we describe how to construct a normal form from a given Cayley automatic representation . For a given let be a word corresponding to a shortest path between and in the Cayley graph for which . We define the language as . Below we prove that defines a quasigeodesic normal form that satisfies the –fellow traveler property.
We now show that the normal form defined by is quasigeodesic. Let for some and be the normal form of . We need to show that for some constant . Since is a Cayley automatic representation, there exists a constant for which . Let . Then . Therefore, . Since , then for some constant and all . Let . Then we have that for all . Therefore, there exists a constant such that for all .

Let us show that defines a normal form in that satisfies the –fellow traveler property. Let and be the normal forms of the group elements and for which for some . See Figure 5 for illustration. We denote by the minimum . Let be the function defined by the equation (1) for the normal form and the set of generators . It can be shown that for all and some constant ; this is proved in details for all in [2, Theorem 2.1]. If , then by the triangle inequality . Since the representation is Cayley automatic, for some constant . Let . Therefore, for all :
Let . Then, for all , we have that . Let . Since , we get that . Therefore, defines a normal form of satisfying the –fellow traveler property. ∎
5 Quasiregular Normal Forms
This section discusses quasiregular normal forms in the context of the –fellow traveler property. By Theorems 14 and 15 for groups with the strongly–super–polynomial Dehn function and non–finitely presented groups there exist no quasigeodesic normal forms satisfying the –fellow traveler property. In this section we show examples of quasiregular normal forms satisfying the –fellow traveler property for such groups.
5.1 Baumslag–Solitar groups
We consider a family of the Baumslag–Solitar groups for . Each group of this family has the exponential Dehn function, so by Theorem 14 it does not admit a quasigeodesic normal form satisfying the –fellow traveler property. In Theorem 17 we will show that each group of this family admits a quasiregular normal form satisfying the –fellow traveler property.
Theorem 17.
Each group for admits a quasiregular normal form satisfying the –fellow traveler property.
Proof.
Every group element for can be uniquely written as a freely reduced word over the alphabet of the form:
(5) |
where , if , if and . So the identity (5) defines a normal form in . This normal form is prefix–closed, so it is quasiregular. Below we show that it satisfies the –fellow traveler property.
Let and be the word metric in with respect to the generators and . Burillo and Elder [6] showed that there exist constants such that for all :
(6) |
We first consider a pair of group elements and . Let be the normal form of . Then . Clearly, for all .
Now we consider a pair of group elements and . We denote by the normal form of . Let , where and . We have three different cases:
-
•
Suppose . Then . Let . If , then . If , then . If , then , where and . By (6), and . Therefore, .
-
•
Suppose and either or . Then . Let . If , then . If , then , where and . By (6), and . Therefore, .
-
•
Suppose , and . Then . Let . If , then . If , then , where and . By (6), and . Therefore, .
From these three cases we can see that . Therefore, the normal form given by the identity (5) satisfies the –fellow traveler property. ∎
Remark 18.
Remark 19.
Let us be given a normal form of for satisfying the –fellow traveler property. We denote by and the functions which send the normal form of a group element to the normal form of a group element and , respectively. One can notice that the functions and cannot be all computed in time on a one–tape Turing machine. Indeed, suppose each of the functions and is computed on a one–tape Turing machine in time. Hartmanis [9] and, independently, Trachtenbrot [12] showed that a language recognized on a one–tape Turing machine in time must be regular. This fact and the pumping lemma imply that if each of the functions and is computed on a one–tape Turing machine in time, then the normal form satisfies the bounded length difference property, so it is quasigeodesic; for the proof see [11, Theorem 4]. Thus, by Theorem 14, we arrive at a contradiction. However, it can be verified that for the normal form given by the identity (5) the functions and can be computed in time using a more powerful computational model – a two–tape Turing machine. Though this verification is not difficult we omit it as it is out of scope of this paper.
5.2 Wreath product
We consider the wreath product . This group is non–finitely presented, so by Theorem 15 it does not admit a quasigeodesic normal form satisfying the –fellow traveler property. In Theorem 20 we will show that admits a quasiregular normal form satisfying the –fellow traveler property.
Every group element of can be written as a pair , where is a function such that is not equal to the identity for at most finitely many and . For the group we denote by and the generators and . The group is canonically embedded in by mapping to , where sends every element of to the identity . We denote by the nontrivial element of . The group is canonically embedded in by mapping to , where is a function such that if and . We will identify and with the group elements , and in , respectively. The set generates the group .
Theorem 20.
The wreath product admits a quasiregular normal form satisfying the –fellow traveler property.
Proof.
Let be the infinite directed graph shown in Fig. 6 which is isomorphic to , where is the successor function . The vertices of are identified with elements of , each vertex in has exactly one ingoing and one outgoing edges and the vertex has one outgoing edge and no ingoing edges. Let be the mapping such that and, for , is the end vertex of a directed path in of length which starts in the vertex .

Now we define a normal form in the group as follows. Let , where and . Let if and if . We denote by the maximum ; if for all then we put . For a given integer , let and if is equal to , , and , respectively, and let if and if . Let for and be the concatenation .
Let be the integer for which . If , for a given let and if is equal to , , and , respectively. If , for a given let and if is equal to , , and , respectively. If , let . If , let , where .
Finally we define a normal form of the element as a concatenation of and : . Informally speaking, the normal form is obtained as follows. Imagine the lamplighter who moves along the graph starting from writing and depending whether it moves right, left, up and down, respectively. The lamplighter writes if the lamp at the current position is lit: . After the lamplighter reaches the position it either moves further along , if , or goes back along , if , until it reaches the position ; while moving it writes and depending whether it moves right, left, up and down, respectively. For illustration let us consider the group element shown in Fig. 6: a black square means that the lamp at the current position is lit, i.e., , a white square means that the lamp at the current position is unlit, i.e., , and a black circle shows the position of the lamplighter and that the lamp at this position is lit, i.e., . For this group element the word is as follows:
and the word is as follows:
and the normal form of is a concatenation of and . The described normal form of is prefix–closed, so it is quasiregular. Let us show that it satisfies the –fellow traveler property.
We start with a pair of group elements and , where . Let be the integer for which . Let be the normal form of . We first notice that can be bounded from above by for every :
(7) |
For a given , let and be an integer for which . One can notice the following lower and upper bounds for :
(8) |
In particular, (8) implies that and . Therefore, . Since , we obtain that . Therefore, by (7) we obtain that for every :
(9) |
Now we notice that . Therefore, if , then . For we consider the following three cases:
- •
- •
- •
From these three cases we can see that .
Now let us consider a pair of group elements and , where if and if . There are two different cases to consider: and . Let be the normal form of . The case is straightforward: for all .
Now let us consider the case . We denote by the following prefix of : . If , then . Suppose now that . We assume that . Let be the suffix of which follows : .
Let and be a position of the lamplighter for a group element . We denote by and the coordinates of and , respectively. There are two different cases: or , where . Let us analyze these two cases:
- •
-
•
Suppose . Then , so we have that:
Therefore, . By exactly the same argument as in the previous case we have that .
Therefore, if , we have that . If , then swapping the role of and in the argument above yields . Thus we finally proved that . ∎
Remark 21.
We note that for the normal form in the proof of Theorem 20 the upper bound is sharp. A proof of this is as follows. For a given let be a function for which and for . We denote by the group element . Let and be the normal forms of and , respectively. Let and . Then and . Let . The distance is equal to . Indeed, in order to obtain from the lamplighter moves from the position to the position choosing a shortest route, switch on a lamp, moves back to the position and switch off a lamp. In particular, . By (8), we have that . Therefore, . This implies that .
6 Discussion and Open Questions
Theorems 14 and 15 show that for a finitely presented group with the strongly–super–polynomial Dehn function or a non–finitely presented group there exists no quasigeodesic normal form satisfying the –fellow traveler property. The following question is apparent from these results.
-
1.
Is there a quasigeodesic normal form satisfying the –fellow traveler property for some finitely presented non–automatic group with the Dehn function which is not strongly–super–polynomial? Some interesting candidates to consider this question include, for example, the Heisenberg group and the higher Heisenberg groups , .
Theorems 17 and 20 show the existence of a quasiregular normal form satisfying the –fellow traveler property for Baumslag–Solitar groups , , and the wreath product . We leave the following question for future consideration.
-
2.
Is there a quasiregular normal form satisfying the –fellow traveler property for the fundamental group of a torus bundle over a circle , where has two real eigenvalues not equal to ? Recall that the latter guarantees that has at least exponential Dehn function, so no quasigeodesic normal form satisfying the –fellow traveler property exists in this case.
In addition to that there are other questions that might be worth considering. Is there a quasiregular normal form satisfying the –fellow traveler proper for , , for some ? Is there a quasiregular normal form satisfying the –fellow traveler proper for , , for some ? What are the other examples of groups which admit quasiregular normal forms satisfying the –fellow traveler property?
Acknowledgments
The authors thank the anonymous reviewer for useful comments.
References
- [1] Berdinsky, D., Elder, M., Taback, J.: On the geometry of Cayley automatic groups. International Journal of Algebra and Computation 32, 383–409 (2022)
- [2] Berdinsky, D., Trakuldit, P.: Towards quantitative classification of Cayley automatic groups. East–West J. of Mathematics 20(2), 107–124 (2018)
- [3] Berdinsky, D., Trakuldit, P.: Measuring closeness between Cayley automatic groups and automatic groups. In: Klein, S., Martín-Vide, C., Shapira, D. (eds.) Language and Automata Theory and Applications, vol. 10792, pp. 245–257. Springer International Publishing (2018)
- [4] Bridson, M.R.: Combings of groups and the grammar of reparameterization. Comment. Math. Helv. 78, 752–771 (2003)
- [5] Bridson, M.R., Gilman, R.H.: Formal language theory and the geometry of 3–manifolds. Commentarii Mathematici Helvetici 71(1), 525–555 (1996)
- [6] Burillo, J., Elder, M.: Metric properties of Baumslag–Solitar groups. International Journal of Algebra and Computation 25(5), 799–811 (2015)
- [7] Elder, M., Taback, J.: –graph automatic groups. Journal of Algebra 413, 289–319 (2014)
- [8] Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word Processing in Groups. Jones and Barlett Publishers. Boston, MA (1992)
- [9] Hartmanis, J.: Computational complexity of one–tape Turing machine computations. Journal of the Association of Computing Machinery 15, 411–418 (1968)
- [10] Kharlampovich, O., Khoussainov, B., Miasnikov, A.: From automatic structures to automatic groups. Groups, Geometry and Dynamics 8(1), 157–198 (2014)
- [11] Kruengthomya, P., Berdinsky, D.: Cayley Linear–Time Computable Groups. journal of Groups, Complexity, Cryptology Volume 15, Issue 2, 1–22 (Apr 2024)
- [12] Trachtenbrot, B.: Turing computations with logarithmic delay. Algebra i Logica 3 (1964), (In Russian) English translation in U. of California Computing Center, Tech. Rep. No. 5, Berkeley, Calif., 1966.