Related papers: Conjugacy classes of polyspinal groups

The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective…

Relative smoothness and strong convexity have recently gained considerable attention in optimization. These notions are generalizations of the classical Euclidean notions of smoothness and strong convexity that are known to be dual to each…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

We prove that two angle-compatible Coxeter generating sets of a given finitely generated Coxeter group are conjugate provided one of them does not admit any elementary twist. This confirms a basic case of a general conjecture which…

We construct a class of finitely generated groups which have arbitrarily large conjugacy separability function, but in which the conjugacy problem can be solved in polynomial time, demonstrating that the McKinsey algorithm for the conjugacy…

In this paper, we study the structure of finite groups with a large number of conjugacy classes of $p$-elements for some prime $p$. As consequences, we obtain some new criteria for the existence of normal $p$-complements in finite groups.

We prove that finite index subgroups of right angled Artin groups are conjugacy separable. We then apply this result to establish various properties of other classes of groups. In particular, we show that any word hyperbolic Coxeter group…

We first show that every group-theoretical category is graded by a certain double coset ring. As a consequence, we obtain a necessary and sufficient condition for a group-theoretical category to be nilpotent. We then give an explicit…

Many non-locally compact second countable groups admit a comeagre conjugacy class. For example, this is the case for the automorphism group of the rational order and the automorphism group of the random graph [Truss]. A. Kechris and C.…

A number of properties of spherical Artin groups extend to Garside groups, defined as the groups of fractions of monoids where least common multiples exist, there is no nontrivial unit, and some additional finiteness conditions are…

We prove that fundamental groups of orientable (geometrizable) 3-manifolds have a solvable conjugacy problem.

We find the branching laws for the classical pairs $\mathrm{GL}(m, \mathbb{C}) \subset \mathrm{GL}(n, \mathbb{C})$, $\mathrm{Sp}(2m, \mathbb{C}) \subset \mathrm{Sp}(2n, \mathbb{C})$, $\mathrm{SO}(q, \mathbb{C}) \subset \mathrm{SO}(p,…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

The Grassmannian admits an action by a finite cyclic group via the cyclic shift map. We give a simple description of the points fixed by each element of this cyclic group, extending Karp's description of the points fixed by the cyclic shift…

We obtain explicit formulas for the rational homotopy groups of generalised symmetric spaces, i.e., the homogeneous spaces for which the isotropy subgroup appears as the fixed point group of some finite order automorphism of the group. In…

In this short note, we describe the finite groups $G$ having $|G|-1$ cyclic subgroups. This leads to a nice characterization of the symmetric group $S_3$.

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

It is well known that weakly continuous semigroups defined over $\mathbb{R}_{+}$ are automatically strongly continuous. We extend this result to more generally defined semigroups, including multiparameter semigroups.

We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.

Let $R(\phi)$ be the number of $\phi$-conjugacy (or Reidemeister) classes of an endomorphism $\phi$ of a group $G$. We prove for several classes of groups (including polycyclic) that the number $R(\phi)$ is equal to the number of fixed…