Related papers: A note on test elements for monomorphisms of free …
Every word $w$ in a free group naturally induces a probability measure on every compact group $G$. For example, if $w=\left[x,y\right]$ is the commutator word, a random element sampled by the $w$-measure is given by the commutator…
We associate a finite directed graph with each equivalence class of words in $F_2$ under $\operatorname*{Aut} F_2$, and we completely classify these graphs, giving a structural classification of the automorphic conjugacy classes of $F_2$.…
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…
We show that every finitely generated group G with an element of order at least $(5rank(G))^{12}$ admits a locally finite directed Cayley graph with automorphism group equal to G. If moreover G is not generalized dihedral, then the above…
We generalize the enhanced power graph by replacing elements with classes under automorphisms. We show that the connectivity and diameter of this graph is similar to that of the enhanced power graph. We consider the universal vertices of…
We give a technical result that implies a straightforward necessary and sufficient conditions for a graph of groups with virtually cyclic edge groups to be one ended. For arbitrary graphs of groups, we show that if their fundamental group…
We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…
In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…
We establish new characterizations of primitive elements and free factors in free groups, which are based on the distributions they induce on finite groups. For every finite group $G$, a word $w$ in the free group on $k$ generators induces…
Let $G$ be a finite group. We prove a theorem implying that the orders of elements of the holomorph $\operatorname{Hol}(G)$ are bounded from above by $|G|$, and we discuss an application to bounding automorphism orders of finite groups.
Let G be any finitely generated infinite group. Denote by K(G) the FC-centre of G, i.e., the subgroup of all elements of G whose centralizers are of finite index in G. Let QI(G) denote the group of quasi-isometries of G with respect to word…
We define a free product of connected simple graphs that is equivalent to several existing definitions when the graphs are vertex-transitive but differs otherwise. The new definition is designed for the automorphism group of the free…
A metacyclic group $H$ can be presented as $\langle \alpha,\beta\mid \alpha^{n}=1, \ \beta^{m}=\alpha^{t}, \ \beta\alpha\beta^{-1}=\alpha^{r}\rangle$ for some $n,m,t,r$. Each endomorphism $\sigma$ of $H$ is determined by…
A word $w$ in a free group is {\em achiral} if for every group $G,$ $G_w=G_{w^{-1}},$ where $G_w$ is the image of the word map $w$ on $G.$ We will give few classes of examples of achiral words. Cocke and Ho asked whether Engel words are…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
In this paper, we classify finite categories with two objects such that one of the endomorphism monoids is a group. We prove that having a group on one side affects the structure of the other endomorphism monoid, and we prove that it is…
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
In this work, we explore the following question: If two words in a finitely generated free group have identical images as word maps on every finite group, must they be endomorphic to each other? In this regard, we introduce weak profinite…
We propose an algebraic study of the simple graph isomorphism problem. We define a Hopf algebra from an explicit realization of its elements as formal power series. We show that these series can be evaluated on graphs and count occurrences…
We study the automorphism groups of free-by-cyclic groups and show these are finitely generated in the following cases: (i) when defining automorphism has linear growth and (ii) when the rank of the underlying free group has rank at most 3.…