Related papers: The conjugacy problem for Thompson-like groups

Let $G$ be a group, and let $S$ be a finite subset of $G$ that generates $G$ as a monoid. The co-word problem is the collection of words in the free monoid $S^{\ast}$ that represent non-trivial elements of $G$. A current conjecture, based…

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

We define various monoid versions of the R. Thompson group $V$, and prove connections with monoids of acyclic digital circuits. We show that the monoid $M_{2,1}$ (based on partial functions) is not embeddable into Thompson's monoid ${\sf…

The groups G_{k,1} of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call M_{k,1}, and to inverse monoids, called Inv_{k,1}; this is done by simply generalizing bijections to partial functions or…

In this short article, we prove that any automorphism of the R. Thompson's group $F$ has infinitely many twisted conjugacy classes. The result follows from the work of Matthew Brin, together with a standard facts on R. Thompson's group $F$,…

Thompson's group F is the group of all increasing dyadic piecewise linear homeomorphisms of the closed unit interval. We compute Sigma^m(F) and Sigma^m(F;Z), the homotopical and homological Bieri-Neumann-Strebel-Renz invariants of F, and we…

We produce for each natural number $n \geq 3$ two 1--parameter families of Riemann surfaces admitting automorphism groups with two cyclic subgroups $H_{1}$ and $H_{2}$ of orden $2^{n}$, that are conjugate in the group of…

In this short note, we classify pairs of conjugacy classes of the symmetric group such that any non-linear irreducible character of the symmetric group vanishes on at least one of them.

Cactus groups and their pure subgroups appear in various fields of mathematics and are currently attracting attention from diverse mathematical communities. They share similarities with both right-angled Coxeter groups and braid groups. In…

Given a short exact sequence of groups with certain conditions, $1\to F\to G\to H\to 1$, we prove that $G$ has solvable conjugacy problem if and only if the corresponding action subgroup $A\leqslant Aut(F)$ is orbit decidable. From this, we…

Let $\H^{n+1}$ denote the $n + 1$-dimensional (real) hyperbolic space. Let $\s^{n}$ denote the conformal boundary of the hyperbolic space. The group of conformal diffeomorphisms of $\s^n$ is denoted by $M (n)$. Let $M_o (n)$ be its identity…

In this paper, we prove that if G is a finite simple group with the same-size conjugacy class set U(G) = U(PSL(2, 11)), then G is isomorphic to PSL(2, 11).

We say that $x,y\in \Gamma$ are in the same $\phi$-twisted conjugacy class and write $x\sim_\phi y$ if there exists an element $\gamma\in \Gamma$ such that $y=\gamma x\phi(\gamma^{-1})$. This is an equivalence relation on $\Gamma$ called…

Let $G$ be a simple algebraic group of type $E_n (n=6,7,8)$ defined over an algebraically closed field $k$ of characteristic $2$. We present examples of triples of closed reductive groups $H<M<G$ such that $H$ is $G$-completely reducible,…

Let $G$ be a finite group and $M,N$ be two normal subgroups of $G$. Let $Aut_N^M(G)$ denote the group of all automorphisms of $G$ which fix $N$ element wise and act trivially on $G/M$. Let $n$ be a positive integer. In this article we have…

We provide a direct and elementary proof of the equivalence between the weak asymptotic homomorphism property for the pair of group von Neumann algebras $L(H)\subset L(G)$ and the embedding into $H$ of the one sided quasi-normalizer of the…

The following problem was originally posed by B.H. Neumann and H. Neumann. Suppose that a group $G$ can be generated by $n$ elements and that $H$ is a homomorphic image of $G$. Does there exist, for every generating $n$-tuple $(h_1,\ldots,…

We show a homological result for the class of planar or symmetric operad groups: We show that under certain conditions, group (co)homology of such groups with certain coefficients vanishes in all dimensions, provided it vanishes in…

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…

Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis…