Related papers: Orbit decidability and the conjugacy problem for s…

We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian…

We prove that Thompson's group $F$ has a subgroup $H$ such that the conjugacy problem in $H$ is undecidable and the membership problem in $H$ is easily decidable. The subgroup $H$ of $F$ is a closed subgroup of $F$. That is, every function…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

We consider the following problem stated by Vdovin (2010) in the "Kourovka notebook" (Problem 17.41): Let $H$ be a solvable subgroup of a finite group $G$ that has no nontrivial solvable normal subgroups. Do there always exist five…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this note, we prove that if $\sigma_1(G)<\frac{117}{20}$, then $G$ is solvable. Moreover, we have $\sigma_1(G)=\frac{117}{20}$ if and only if $G\cong A_5$.…

Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for determining whether or not two given elements f, g of G are conjugate, i.e. whether there exists h belonging to G with fh = hg. This paper is…

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…

Let $X = G/\Gamma$ be a quotient of a real Lie group by a non-uniform lattice. Consider a one-parameter subgroup $F$ of $G$ that is $\operatorname{Ad}$-diagonalizable over $\mathbb{C}$ and whose action on $(X,m_X)$ is mixing. In this…

Let K be a fine hyperbolic graph and G be a group acting on K with finite quotient. We prove that G is exact provided that all vertex stabilizers are exact. In particular, a relatively hyperbolic group is exact if all its peripheral groups…

We present a solution to the conjugacy decision problem and the conjugacy search problem in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. This is done by replacing the well known cycling and…

Let G be a torsion-free abelian group of finite rank. The orbits of the action of Aut(G) on the set of maximal independent subsets of G determine the indecomposable decompositions of G. G contains a direct sum of pure strongly…

We show that the twisted conjugacy problem is solvable for large-type Artin groups whose outer automorphism group is finite, generated by graph automorphisms and the global inversion. This includes XXXL Artin groups whose defining graph is…

Building on work of Popa, Ioana, and Epstein--T\"{o}rnquist, we show that, for every nonamenable countable discrete group $\Gamma$, the relations of conjugacy, orbit equivalence, and von Neumann equivalence of free ergodic (or weak mixing)…

Fix a module M over a local ring R and a group action G on M, not necessarily R-linear. To understand how large is the G-orbit of an element z\in M one looks for the large submodules of M lying in Gz. We provide the corresponding…

In 1951, Higman constructed a remarkable group $$H=\left\langle a,b,c,d \, \left| \, b^a = b^2, c^b = c^2, d^c = d^2, a^d = a^2 \right. \right\rangle$$ and used it to produce the first examples of infinite simple groups. By studying fixed…

The study of associativity of the commutator operation in groups goes back to some work of Levi in 1942. In the 1960's Richard J. Thompson created a group F whose elements are representatives of the generalized associative law for an…

The following theorem is proved: Let $G$ be a finite group and $\pi_e(G)$ be the set of element orders in $G$. If $\pi_e(G) \cap \{2\}=\emptyset$; or $\pi_e(G) \cap \{3, 4\}=\emptyset$; or $\pi_e(G) \cap \{3,5\}=\emptyset$, then $G$ is…

Given a group $G$ with bounded torsion that acts properly on a systolic complex, we show that every solvable subgroup of $G$ is finitely generated and virtually abelian of rank at most $2$. In particular this gives a new proof of the above…

We give examples of groups G such that G^00 is different from G^000. We also prove that for groups G definable in an o-minimal structure, G has a "bounded orbit" iff G is definably amenable. These results answer questions of Gismatullin,…