Related papers: Dead end words in lamplighter groups and other wre…

We present two explicit combinatorial constructions of finitely summable reduced "Gamma"-elements $\gamma_r\,\in\,KK(C^*_r(\Gamma),{\mathbb C})$ for any word-hyperbolic group $(\Gamma,S)$ and obtain summability bounds for them in terms of…

Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$.…

Every word $w$ in the free group $F_r$ of rank $r$ induces a probability measure (the $w$-measure) on every compact group $G$, by substitution of Haar-random $G$-elements in the letters. This measure is determined by its Fourier…

Bartholdi, Neuhauser and Woess proved that a family of metabelian groups including lamplighters have a striking geometric manifestation as 1-skeleta of horocyclic products of trees. The purpose of this article is to give an elementary…

This paper deals with the Cayley graph $\Cay,$ where the generating set consists of all block transpositions. A motivation for the study of these particular Cayley graphs comes from current research in Bioinformatics. We prove that…

This paper investigates the enumeration of Cayley digraphs, focusing on counting Cayley digraphs on dihedral groups up to CI-isomorphism. By leveraging the Cauchy-Frobenius Lemma and properties of automorphisms, we derive an explicit…

Let $R$ be a commutative ring and let $U(R)$ be multiplicative group of unit elements of $R$. In 2012, Khashyarmanesh et al. defined generalized unit and unitary Cayley graph, $\Gamma(R, G, S)$, corresponding to a multiplicative subgroup…

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$,…

For an infinite Coxeter system, one can extend the weak right order to the set of infinite reduced words. This is called limit weak order. In [Transformation Groups 18(1), 2013, 179-231], Lam and Pylyavskyy showed that for affine Weyl…

A word in a group is called a test element if any endomorphism fixing it is necessarily an automorphism. In this note, we give a sufficient condition in geometry to construct test elements for monomorphisms of a free group, by using the…

Motivated by issues arising in computer science, we investigate the loop-free paths from the identity transformation and corresponding straight words in the Cayley graph of a finite transformation semigroup with a fixed generator set. Of…

We characterize the set of planar locally finite Cayley graphs, and give a finite representation of these graphs by a special kind of finite state automata called labeling schemes. As a result, we are able to enumerate and describe all…

An infinite graph G is minor excluded if there is a finite graph that is not a minor of G. We prove that minor excluded graphs have finite Assouad-Nagata dimension and study minor exclusion for Cayley graphs of finitely generated groups.…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

We introduce and study a strong "thin triangle"' condition for directed graphs, which generalises the usual notion of hyperbolicity for a metric space. We prove that finitely generated left cancellative monoids whose right Cayley graphs…

Killing forms on finite groups arise as examples of braided Killing forms on braided Lie algebras. For a finite group $G$ and a $G$-stable subset $\mathcal{C}$, the Killing form associated with $\mathbb{C}[\mathcal{C}]$ is given by…

We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two…

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex of $\Gamma$ is at distance no more than $1$ to exactly one vertex of $C$. A subset $C$ of a group $G$ is called a perfect code of $G$ if…

This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…