相关论文: Unusual Geodesics in generalizations of Thompson's…

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…

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 study languages of geodesics in lamplighter groups and Thompson's group F. We show that the lamplighter groups $L_n$ have infinitely many cone types, have no regular geodesic languages, and have 1-counter, context-free and counter…

We study some combinatorial properties of the word metric of Thompson's group F in the standard two generator finite presentation. We explore connections between the tree pair diagram representing an element w of F, its normal form in the…

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…

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…

In this paper, we give a complete description of the language of geodesic words for the discrete Heisenberg group $H(\mathbb{Z})$ with respect to the standard two-element generating set. More precisely, we prove that the only dead end…

This note constructs a finitely generated group $W$ whose word-growth is exponential, but for which the infimum of the growth rates over all finite generating sets is 1 -- in other words, of non-uniformly exponential growth. This answers a…

The width $\wid(G,W)$ of the verbal subgroup $v(G,W)$ of a group $G$ defined by a collection of group words $W$ is the smallest number $m$ in $\mathbb N \cup {+\infty}$ such that every element of $v(G,W)$ is can be represented as the…

We continue the study of the geometry of infinite geodesics in first passage percolation (FPP) on Gromov-hyperbolic groups G, initiated by Benjamini-Tessera and developed further by the authors. It was shown earlier by the authors that,…

Let $w\in\mathbf F_k$ be a non-trivial word and denote by $w(G)\subseteq G$ the image of the associated word map $w\colon G^k\to G$. Let $G$ be one of the finite groups ${\rm S}_n,{\rm GL}_n(q),{\rm Sp}_{2m}(q),{\rm GO}_{2m}^\pm(q),{\rm…

We investigate intersections of geodesic lines in $H^2$ and in an associated tree T, proving the following result. Let M be a punctured hyperbolic torus and let $\gamma$ be a closed geodesic in M. Any edge of any triangle formed by distinct…

Let $G$ be a group generated by a finite set $A$. An element $g\in G$ is a strict dead end of depth $k$ (with respect to $A$) if $|g|>|ga_1|>|ga_1a_2|>...>|ga_1a_2... a_k|$ for any $a_1,a_2, ..., a_k\in A^{\pm1}$ such that the word…

In this paper we introduce a new notion of a sequence of symmetry groups of an infinite word. Given a subgroup $G_n$ of the symmetric group $S_n$, it acts on the set of finite words of length $n$ by permutation. We associate to an infinite…

We extend the concept of two-way forest diagrams, introduced by Belk and Brown in 2003, to represent elements of $F(n)$ as a pair of infinite, bounded $n$-ary forests together with an order-preserving bijection of the leaves. This…

We introduce a new method for computing the word length of an element of Thompson's group F with respect to a "consecutive" generating set of the form X_n={x_0,x_1,...,x_n}, which is a subset of the standard infinite generating set for F.…

We show that Thompson's group F does not satisfy Cannon's almost convexity condition AC(n) for any integer n in the standard finite two generator presentation. To accomplish this, we construct a family of pairs of elements at distance n…

The factor complexity function $C_w(n)$ of a finite or infinite word $w$ counts the number of distinct factors of $w$ of length $n$ for each $n \ge 0$. A finite word $w$ of length $|w|$ is said to be trapezoidal if the graph of its factor…

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…

We show that, if $w_1, \ldots , w_6$ are words which are not an identity of any (non-abelian) finite simple group, then $w_1(G)w_2(G) \cdots w_6(G) = G$ for all (non-abelian) finite simple groups $G$. In particular, for every word $w$,…