Related papers: Cone types and geodesic languages for lamplighter …

We prove that seesaw words exist in Thompson's Group F(N) for N=2,3,4,... with respect to the standard finite generating set X. A seesaw word w with swing k has only geodesic representatives ending in g^k or g^{-k} (for given g\in X) and at…

We show that non-positively curved $k$-fold triangle groups have finitely many cone types, and hence a regular language of all geodesics. Further, we prove that the language of lexicographically first geodesics is both regular and satisfies…

We describe a family of words in Thompson's group F which present a challenge to the question of finding canonical minimal length representatives, and which show that F is not combable by geodesics. These words have the property that there…

In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions $C'(1/6)$ and $C'(1/4)-T(4)$ has the property that the set of all geodesics (over the same generating set) is a…

We show that a large class of languages in the standard finite generating set X = {$x_0, x_1, x_0^{-1}, x_1^{-1}$} cannot be part of an automatic structure for Thompson's Group F. These languages are ones that accept at least one…

We give a language of unique geodesic normal forms for the Baumslag-Solitar group BS(1,2) that is context-free and 1-counter. We discuss the classes of context-free, 1-counter and counter languages, and explain how they are inter-related.

We furnish an example of a finite generating set for a group that does not enjoy the falsification by fellow traveler property, while the full language of geodesics is regular.

In this work, we give a complete description of the language of geodesic words for a central extension of the fundamental group of the Klein Bottle with respect to the standard two-element generating set. Besides, we prove that there are no…

Let $G$ be a finitely generated group. We show that for any finite generating set $A$, the language consisting of all geodesics in $Cay(G,A)$ with a contracting property is a regular language. As an application, we show that any finitely…

In this paper we investigate metric properties of the groups $\Gamma_d(q)$ whose Cayley graphs are the Diestel-Leader graphs $DL_d(q)$ with respect to a given generating set $S_{d,q}$. These groups provide a geometric generalization of the…

We explore the geometry of the Cayley graphs of the lamplighter groups and a wide range of wreath products. We show that these groups have dead end elements of arbitrary depth with respect to their natural generating sets. An element $w$ in…

We prove that a subset of a virtually free group is rational if and only if the language of geodesic words representing its elements (in any generating set) is rational and that the language of geodesics representing conjugates of elements…

We study the full language of quasigeodesics in Cayley graphs, with fixed error constants. We show that, given a non-virtually-cyclic nilpotent group or Baumslag--Solitar group, and any finite generating set, such languages fail to be…

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…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

Cannon has given an example of a virtually abelian group and a generating set where the full language of geodesics is not regular. We describe a virtually abelian group and a generating set so that no regular language of geodesics surjects…

Let $G$ be a group, and let $S$ be a finite subset of $G$ that generates $G$ as a monoid. The co-word problem is the collection of words in the free monoid $S^{\ast}$ that represent non-trivial elements of $G$. A current conjecture, based…

Let $G$ be a finitely generated group, and let $\Sigma$ be a finite subset that generates $G$ as a monoid. The \emph{word problem of $G$ with respect to $\Sigma$} consists of all words in the free monoid $\Sigma^{\ast}$ that are equal to…

In this paper we study rewriting systems for groups and monoids, focusing on situations where finite convergent systems may be difficult to find or do not exist. We consider systems which have no length increasing rules and are confluent…

A finitely generated group $G$ is called poly-context-free if its word problem $\mathrm{WP}(G)$ is an intersection of finitely many context-free languages. We consider the quaternionic lattices $\Gamma_\tau$ over the field…