Do you want to publish a course? Click here

Magnus pairs in, and free conjugacy separability of, limit groups

146   0   0.0 ( 0 )
 Added by Nicholas Touikan
 Publication date 2016
  fields
and research's language is English




Ask ChatGPT about the research

There are limit groups having non-conjugate elements whose images are conjugate in every free quotient. Towers over free groups are freely conjugacy separable.



rate research

Read More

We prove that the finitely presentable subgroups of residually free groups are separable and that the subgroups of type $mathrm{FP}_infty$ are virtual retracts. We describe a uniform solution to the membership problem for finitely presentable subgroups of residually free groups.
224 - E. A. Ivanova 2004
It is proved that for any prime $p$ a finitely generated nilpotent group is conjugacy separable in the class of finite $p$-groups if and only if the torsion subgroup of it is a finite $p$-group and the quotient group by the torsion subgroup is abelian.
151 - Henry Wilton 2008
We use wreath products to provide criteria for a group to be conjugacy separable or omnipotent. These criteria are in terms of virtual retractions onto cyclic subgroups. We give two applications: a straightforward topological proof of the theorem of Stebe that infinite-order elements of Fuchsian groups (of the first type) are conjugacy distinguished, and a proof that surface groups are omnipotent.
Given a group $G$ and a subset $X subset G$, an element $g in G$ is called quasi-positive if it is equal to a product of conjugates of elements in the semigroup generated by $X$. This notion is important in the context of braid groups, where it has been shown that the closure of quasi-positive braids coincides with the geometrically defined class of $mathbb{C}$-transverse links. We describe an algorithm that recognizes whether or not an element of a free group is quasi-positive with respect to a basis. Spherical cancellation diagrams over free groups are used to establish the validity of the algorithm and to determine the worst-case runtime.
We give a unified solution to the conjugacy problem for Thompsons groups F, T, and V. The solution uses strand diagrams, which are similar in spirit to braids and generalize tree-pair diagrams for elements of Thompsons groups. Strand diagrams are closely related to piecewise-linear functions for elements of Thompsons groups, and we use this correspondence to investigate the dynamics of elements of F. Though many of the results in this paper are known, our approach is new, and it yields elegant proofs of several old results.
comments
Fetching comments Fetching comments
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا