Related papers: Conjugacy growth series and languages in groups
The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conjugate (or cyclic shifts of each other). The notion of…
Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems…
We study the conjugacy class growth function in finitely generated virtually abelian groups. That is, the number of elements in the ball of radius $n$ in the Cayley graph which intersect a fixed conjugacy class. In the class of virtually…
Groups with the falsification by fellow traveler property are known to have solvable word problem, but they are not known to be automatic or to have finite convergent rewriting systems. In this paper, we show that these groups admit a…
In this article, we propose a geometric framework dedicated to the study of van Kampen diagrams of graph products of groups. As an application, we find information on the word and the conjugacy problems. The main new result of the paper…
This is a survey of way that the sizes of conjugacy classes influence the structure of finite groups
In this paper we show that a geodesic flow of a compact surface without conjugate points of genus greater than one is time-preserving semi-conjugate to a continuous expansive flow which is topologically mixing and has a local product…
A key task in the study of networked systems is to derive local and global properties that impact connectivity, synchronizability, and robustness; computing shortest paths or geodesics yields measures of network connectivity that can…
We examine the conjugacy growth series of all wreath products of the finitary permutation groups $\text{Sym}(X)$ and $\text{Alt}(X)$ for an infinite set $X$. We determine their asymptotics, and we characterize the limiting behavior between…
The article defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, a FSA can be seen as a graph for which the notion of genus arises. At the same time, a FSA has a semantics via its…
Given a group $G$ and a family of subgroups $\mathcal{F}$, we consider its classifying space $E_{\mathcal F}G$ with respect to $\mathcal{F}$. When $\mathcal F = \mathcal{VC}yc$ is the family of virtually cyclic subgroups, Juan-Pineda and…
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…
Let ${\rm cs}(G)$ denote the set of conjugacy class sizes of a group $G$, and let ${\rm cs}^*(G)={\rm cs}(G)\setminus\{1\}$ be the sizes of non-central classes. We prove three results. We classify all finite groups $G$ with ${\rm…
Let $G$ be an infinite group and let $X$ be a finite generating set for $G$ such that the growth series of $G$ with respect to $X$ is a rational function; in this case $G$ is said to have rational growth with respect to $X$. In this paper a…
We continue the investigation, that began in [3] and [4], into finite groups whose set of nontrivial conjugacy class sizes form an arithmetic progression. Let $G$ be a finite group and denote the set of conjugacy class sizes of $G$ by ${\rm…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
We consider a particular class of Garside groups, which we call circular groups. We mainly prove that roots are unique up to conjugacy in circular groups. This allows us to completely classify these groups up to isomorphism. As a…
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 investigate the complexity of the conjugacy problem for fibre products in torsion-free hyperbolic groups. Let $G$ be a torsion-free hyperbolic group and let $P<G\times G$ be the fibre product associated to an epimorphism…
A connected graph is called \emph{geodetic} if there is a unique shortest path between each pair of vertices. We introduce a systematic method for constructing new presentations of free products that give rise to previously unknown geodetic…