Related papers: Conjugacy in Miller's Groups

The study of verbal subgroups within a group is well-known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance.…

For $G$ a finite group, one way to construct irreducible quandle representations over $\mathbb{C}$ of the conjugacy quandle $Conj(G)$ is by taking the product of an irreducible linear group representation of $G$ by what we call a quandle…

It is proved that generalized free product of two finite p-groups is a conjugacy p-separable group if and only if it is residually finite p-groups. This result is then applied to establish some sufficient conditions for conjugacy…

Let $G$ be a group. Write $G^{*}=G\setminus \{1\}$. An element $x$ of $G^{*}$ will be called deficient if $ \langle x\rangle < C_G(x)$ and it will be called non-deficient if $\langle x\rangle = C_G(x).$ If $x\in G$ is deficient…

We propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We first consider groups which have normal form language in the…

We call the family of free-by-cyclic groups defined by $G = \left< a, t, b_1, b_2, \ldots b_k \mid at = ta, b_1^{-1}tb_1 = a^{n_1}t, \ldots b_k^{-1}tb_k = a^{n_k}t \right>$ for $n_1, n_2, \ldots n_k \in \mathbb Z$ linearly mismatched since…

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

Let $G$ be a finite group and $\pi$ be a set of primes. We show that if the number of conjugacy classes of $\pi$-elements in $G$ is larger than $5/8$ times the $\pi$-part of $|G|$ then $G$ possesses an abelian Hall $\pi$-subgroup which…

For an integer $M\geq 2$ and a finite group $G$, an element $\alpha\in G$ is called an $M$-th power if it satisfies $A^M=\alpha$ for some $A\in G$. In this article, we will deal with the case when $G$ is finite symplectic or orthogonal…

The knapsack problem is a classic optimisation problem that has been recently extended in the setting of groups. Its study reveals to be interesting since it provides many different behaviours, depending on the considered class of groups.…

It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed…

In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is…

We developed computer algebra tools for enumerating conjugacy classes of independent subsets and generating sets of symmetric groups up to $n=7$, and carried out an initial analysis of the obtained results.

Let G be a group. Two elements x and y in G are said to be in the same z-class if their centralizers in G are conjugate within G. In this paper, we prove that the number of z-classes in the group of upper triangular matrices is infinite…

The general {\bf surface group conjecture} asks whether a one-relator group where every subgroup of finite index is again one-relator and every subgroup of infinite index is free (property IF) is a surface group. We resolve several related…

We give another proof of an observation of Th\'evenaz \cite{T1989} and present a fusion system version of it. Namely, for a saturated fusion system $\CF$ on a finite $p$-group $S$, we show that the number of the $\CF$-conjugacy classes of…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

Let $R$ be a subset of a group $G$. We call a subgroup $H$ of $G$ the $R$-conjugate-permutable subgroup of $G$, if $HH^{x}=H^{x}H$ for all $x\in R$. This concept is a generalization of conjugate-permutable subgroups introduced by T. Foguel.…

We prove that finitely presented residually free groups are subgroup conjugacy separable. Furthermore, if they are of type $FP_\infty$, then they are also subgroup conjugacy distinguished. Using a connection between conjugacy separability…

We study the language-theoretic aspects of the word problem, in the sense of Duncan & Gilman, of free products of semigroups and monoids. First, we provide algebraic tools for studying classes of languages known as super-AFLs, which…