Related papers: Computing centralizers in [f.g. free]-by-cyclic gr…
We study centralizers in certain algebras with valuation in order to generalize results by Hellstr\"{o}m and Silvestrov on centralizers in graded algebras. We prove that the centralizer of an element in the studied algebras is a free module…
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,…
This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…
We give an easily checkable algebraic condition which implies that two elements of a finitely generated free group are members of distinct doubly-twisted conjugacy classes with respect to a pair of homomorphisms. We further show that this…
We analyse the geometry and complexity of the conjugacy problem in a family of free-by-cyclic groups $H_m=F_m\rtimes\mathbb{Z}$ where the defining free-group automorphism is positive and polynomially growing. We prove that the conjugator…
For a CSA group $G$ and a wide class of abelian groups $A$ we give an explicit construction for the tensor $A$-completion of $G$ using free products with amalgamations. We apply the obtained results to the study of basic properties of…
We generalize the enhanced power graph by replacing elements with conjugacy classes. The main result of this paper is to determine when this graph is triangle-free.
In this paper, we consider covers of finite groups by centralizers of elements. We show that the set of centralizers that are maximal under the partial ordering form a cover of the group. We also show that the set of centralizers that are…
The theory of nilpotent orbits of simple Lie algebras has seen tremendous developments over the past decades. In this context an important role is played by the component group of the stabilizer of a nilpotent element. In this work, the aim…
How far can the elementary description of centralizers of parabolic subalgebras of Hecke algebras of finite real reflection groups be generalized to the complex reflection group case? In this paper we begin to answer this question by…
A group G is almost cyclic if there is an element x in G, such that for all g in G, there is an element y in G and an integer n with ygy^{-1} = x^n (that is, every element is conjugate to some power of x). W. Ziller asked whether there are…
We prove that the set of limit groups is recursive, answering a question of Delzant. One ingredient of the proof is the observation that a finitely presented group with local retractions (a la Long and Reid) is coherent and, furthermore,…
Let n be bigger than 1 and let A be an element in the Higman-Thompson group V_n. We study the structure of the centralizer of a in V_n through a careful analysis of the action of the group generated by A on the Cantor set C. We make use of…
A free-by-cyclic group $F_N\rtimes_\phi\mathbb{Z}$ has non-trivial centre if and only if $[\phi]$ has finite order in ${\rm{Out}}(F_N)$. We establish a profinite ridigity result for such groups: if $\Gamma_1$ is a free-by-cyclic group with…
Let $G$ be a group. Two elements $x,y \in G$ are said to be in the same $z$-class if their centralizers in $G$ are conjugate within $G$. Consider $\mathbb F$ a perfect field of characteristic $\neq 2$, which has a non-trivial Galois…
It was proved that for any finite set of elements of a free product of residually finite groups such that no two of them belong to conjugate cyclic subgroups and each of them do not belong to a subgroup which is conjugate a to free factor…
This paper is devoted to the proof of the property of order separability for free product of free groups with maximal cyclic amalgamated subgroups.
We design new deterministic and randomized algorithms for computational problems in free solvable groups. In particular, we prove that the word problem and the power problem can be solved in quasi-linear time and the conjugacy problem can…
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…
This paper is concerned with the completion of the proof of the Bergman centralizer theorem by using generic matrices based on our previous quantization proof \cite{KBRZh}. Additionally, we establish that the algebra of generic matrices…