Related papers: Computing centralizers in [f.g. free]-by-cyclic gr…
We construct two practical algorithms for twisted conjugacy classes of polycyclic-by-finite groups. The first algorithm determines whether two elements of a group are twisted conjugate for two given endomorphisms, under the condition that…
Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…
We study glued tensor and free products of compact matrix quantum groups with cyclic groups -- so-called tensor and free complexifications. We characterize them by studying their representation categories and algebraic relations. In…
We exhibit free-by-cyclic groups containing non-free locally-free subgroups, including some word hyperbolic examples. We also show that these groups are not subgroup separable. We use Bestvina-Brady Morse theory in our arguments.
We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated…
Meta-centralizers of non-locally compact group algebras are studied. Theorems about their representations with the help of families of generalized measures are proved. Isomorphisms of group algebras are investigated in relation with…
Let $G$ be a finite non-abelian group and $m=|G|/|Z(G)|$. In this paper we investigate $m$-centralizer group $G$ with cyclic center and we will prove that if $G$ is a finite non-abelian $m$-centralizer $CA$-group, then there exists an…
We show that a free-by-cyclic group with a polynomially growing monodromy is subgroup separable exactly when it is virtually $F_n \times \mathbb{Z}$. We also prove that random deficiency 1 groups are not subgroup separable with positive…
If F is a free group of finite rank at least two then any group of the form F by Z is large. In this short note we show how this statement follows by combining a very recent theorem of Hagen and Wise (using work of Agol and of Wise) with…
In this paper, we study the action of finite subgroups of the mapping class group of a surface on the curve complex. We prove that if the diameter of the almost fixed point set of a finite subgroup H is big enough, then the centralizer of H…
The article deals with profinite groups in which centralizers are virtually procyclic. Suppose that G is a profinite group such that the centralizer of every nontrivial element is virtually torsion-free while the centralizer of every…
We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…
Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…
We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…
We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of…
A lot of attention has been paid to the investigation of the algebraic properties of linear codes. In most cases, this investigation involves the determination of required code automorphisms, which are useful for decoders, such as the…
We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether…
It is a long-standing open problem raised by Starostin to describe all finite groups with soluble centralizers of involutions. One can observe that if the centralizer fusion system of an involution is nilpotent, then the centralizer of that…
The article gives a ring theoretic perspective on cluster algebras. Gei{\ss}-Leclerc-Schr\"oer prove that all cluster variables in a cluster algebra are irreducible elements. Furthermore, they provide two necessary conditions for a cluster…
In this thesis, we study the combinatorics of cyclically fully commutative elements in Coxeter groups of type $A$ as it relates to conjugacy. In particular, we introduce the notion of cylindrical heaps and ring equivalence in order to state…