Related papers: Algorithms for twisted conjugacy classes of polycy…

The finite orbits of the braid group action on Stokes matrices are studied and are shown to be the orbits on ordered sets of reflections, generating finite groups. All invariants of a reflection arrangement are determined. Determination of…

Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…

In this paper we consider finite 2-groups with odd number of real conjugacy classes. On one hand we show that if $k$ is an odd natural number less than 24, then there are only finitely many finite 2-groups with exactly $k$ real conjugacy…

We show that the outer automorphism group of a polycyclic-by-finite group is an arithmetic group. This result follows from a detailed structural analysis of the automorphism groups of such groups. We use an extended version of the theory of…

It is proved for Abelian groups that the Reidemeister coincidence number of two endomorphisms $\phi$ and $\psi$ is equal to the number of coincidence points of $\wh\phi$ and $\wh\psi$ on the unitary dual, if the Reidemeister number is…

This thesis deals with the conjugacy problem in groups and its twisted variants. We analyze recent results by Bogopolski, Martino, Maslakova and Ventura on the twisted conjugacy problem in free groups and its implication for the conjugacy…

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…

For a restricted wreath product $G\wr \mathbb{Z}^k$, where $G$ is a finite abelian group, we determine (almost in all cases) whether this product has the $R_\infty$ property (i.e., each its automorphism has infinite Reidemeister number).

Suppose, $G$ is a residually finite group of finite upper rank admitting an automorphism $\varphi$ with finite Reidemeister number $R(\varphi)$ (the number of $\varphi$-twisted conjugacy classes). We prove that such $G$ is soluble-by-finite…

We give a complete description of finite braid group orbits in Aff(C)-character varieties of the punctured Riemann sphere. This is performed thanks to a coalescence procedure and to the theory of finite complex reflection groups. We then…

Let A be a \C-algebra with an action of a finite group G, let $\natural$ be a 2-cocycle on $G$ and consider the twisted crossed product $A \rtimes \C [G,\natural]$. We determine the Hochschild homology of $A \rtimes \C [G,\natural]$ for two…

This contains a new version of the so-called non-commutative Gauss algorithm for polycyclic groups. Its results allow to read off the order and the index of a subgroup in an (possibly infinite) polycyclic group.

We show that all finitely generated free-by-cyclic groups are conjugacy separable: if a finitely generated group $G$ surjects onto $\mathbb{Z}$ with free kernel, then for every pair of non-conjugate elements $g,h\in G$, there exists a…

The article demonstrates the procedure how to compute the Zariski closure of an orbit by an algebraic action of finitely generated group on the affine plane. First half of the algorithm is about deciding whether given finitely generated…

We compute the number of orbits of pairs in a finitely generated torsion module (more generally, a module of bounded order) over a discrete valuation ring. The answer is found to be a polynomial in the cardinality of the residue field whose…

We obtain a criterion for the automorphism group of an affine toric variety to be connected in combinatorial terms and in terms of the divisor class group of the variety. The component group of the automorphism group of a non-degenerate…

In \cite{CK2005} and \cite{Hubery2005}, the authors proved the cluster multiplication theorems for finite type and affine type. We generalize their results and prove the cluster multiplication theorem for arbitrary type by using the…

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

We begin with a review of the notion of a braid group. We then discuss some known solutions to decision problems in braid groups. We then move on to proving new results in braid group algorithmics. We offer a quick solution to the…

We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…