Related papers: The conjugacy problem for Thompson-like groups

Let $f$ be an automorphism of a group $G$. Two elements $x, y$ in $G$ are said to be in the same $f$-twisted conjugacy class if there exists an element $z$ in $G$ such that $y=z x f(z^{-1})$. This is an equivalence relation known as…

In this paper we formulate and study the problem of representing groups on graphs. We show that with respect to polynomial time turing reducibility, both abelian and solvable group representability are all equivalent to graph isomorphism,…

We apply the method of Arzhantseva-Ol'shanskii to prove that for an exponentially generic (in the sense of Ol'shanskii) class of one-relator groups the isomorphism problem is solvable in at most exponential time. This is obtained as a…

The Thompson group V is a subgroup of the homeomorphism group of the Cantor set. Brin defined higher dimensional Thompson groups nV as generalizations of V. We prove that nV has Serre's property FA, for every n. This is a generalization of…

We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…

We give a combinatorial criterion that implies both the non-strong relative hyperbolicity and the one-endedness of a finitely generated group. We use this to show that many important classes of groups do not admit a strong relatively…

We investigate fixed-point properties of automorphisms of groups similar to R. Thompson's group $F$. Revisiting work of Gon\c{c}alves-Kochloukova, we deduce a cohomological criterion to detect infinite fixed-point sets in the…

The multiplicative Horn problem is the following question: given three conjugacy classes $\mathcal{C}_1, \mathcal{C}_2, \mathcal{C}_3$ in a Lie group $G$, do there exist elements…

The definition and properties of the Euler-Lagrange cohomology groups $H^{2k-1}$, $1 \leqslant k \leqslant n$, on a symplectic manifold $({\cal M}^{2n},\omega)$ are given and studied. For $k = 1$ and $k = n$, they are isomorphic to the…

Classical simplicial cohomology on a simplicial complex G deals with functions on simplices x in G. Quadratic cohomology deals with functions on pairs of simplices (x,y) in G x G that intersect. If K,U is a closed-open pair in G, we prove…

Let VB$_n$ be the virtual braid group on $n$ strands and let $\mathfrak{S}_n$ be the symmetric group on $n$ letters. Let $n,m \in \mathbb{N}$ such that $n \ge 5$, $m \ge 2$ and $n \ge m$. We determine all possible homomorphisms from VB$_n$…

A semigroup conjugacy is an equivalence relation that equals group conjugacy when the semigroup is a group. In this note, we answer five open problems related to semigroup conjugacy. (Problem One) We say a conjugacy ~ is partition-covering…

In a group $G$, elements $a$ and $b$ are conjugate if there exists $g\in G$ such that $g^{-1} ag=b$. This conjugacy relation, which plays an important role in group theory, can be extended in a natural way to inverse semigroups: for…

We prove that Thompson's groups $F$ and $V$ are the geometry groups of associativity, and of associativity together with commutativity, respectively. We deduce new presentations of $F$ and $V$. These presentations lead to considering a…

We solve Dehn's isomorphism problem for virtually torsion-free relatively hyperbolic groups with nilpotent parabolic subgroups. We do so by reducing the isomorphism problem to three algorithmic problems in the parabolic subgroups, namely…

Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…

We find an algorithmic procedure that enables to compute and to describe the structure of the isotropy subgroups of the group of complex orthogonal matrices with respect to the action of similarity on complex symmetric matrices. A key step…

Let $G$ be a toral relatively hyperbolic group, and let $\varphi\in\mathrm{Aut}(G)$. We prove that, under iteration of $\varphi$, the conjugacy length $||\varphi^n(g)||$ of every element $g\in G$ grows like $n^d\lambda^n$ for some…

Let $\mathcal{H}$ be a separable complex Hilbert space. A conjugate-linear map $C:\mathcal{H}\to \mathcal{H}$ is called a conjugation if it is an involutive isometry. In this paper, we focus on the following interpolation problems: Let…

The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…