Related papers: Permute and conjugate: the conjugacy problem in re…
In this note we investigate the conjugacy problem in lamplighter groups with particular interest in the role of their geometry. In particular we show that the conjugacy length function is linear.
We prove a formula connecting the number of unipotent conjugacy classes in a maximal parabolic subgroup of a finite general linear group with the numbers of unipotent conjugacy classes in various parabolic subgroups in smaller dimensions.…
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,…
For $\Gamma$ a cocompact or cofinite Fuchsian group, we study the hyperbolic lattice point problem in conjugacy classes, which is a modification of the classical hyperbolic lattice point problem. We use large sieve inequalities for the…
Weanalyzethecomputationalcomplexityofanalgorithmtosolve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most…
The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…
The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…
We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…
We study the conjugacy problem in cyclic extensions of free groups. It is shown that the conjugacy problem is solvable in split extensions of finitely generated free groups by virtually inner automorphisms. An algorithm for construction of…
Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…
In this paper, we consider the conjugacy growth function of a group, which counts the number of conjugacy classes which intersect a ball of radius $n$ centered at the identity. We prove that in the case of virtually polycyclic groups, this…
Let $n\in \mathbb{N}$. Houghton's group $H_n$ is the group of permutations of $\{1,\dots, n\}\times \mathbb{N}$, that eventually act as a translation in each copy of $\mathbb{N}$. We prove the solvability of the conjugacy problem and…
We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…
There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.
We investigate which free constructions (amalgamated products and HNN-extensions) over word hyperbolic groups produce groups that are again word hyperbolic. A complete answer is obtained for the case when the amalgamated subgroups are…
We consider the conjugation-action of an arbitrary upper-block parabolic subgroup of the general linear group on the variety of nilpotent matrices in its Lie algebra. Lie-theoretically, it is natural to wonder about the number of orbits of…
A finitely generated subgroup H of a torsion-free hyperbolic group G is called immutable if there are only finitely many conjugacy classes of injections of H into G. We show that there is no uniform algorithm to recognize immutability,…
We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the…
The goal of this survey is to present combinatorial modulus that have been recently used to study quasi-conformal properties of boundaries of hyperbolic groups. First, we will recall well known rigidity results and questions that motivated…
We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several common permutation statistics, including the number of…