Related papers: Permute and conjugate: the conjugacy problem in re…

For a group G relatively hyperbolic to a family of residually finite groups satisfying the Farrell-Jones conjecture, we reduce the solution of the Farrell-Jones conjecture for G to the case of certain nice cyclic extensions in G.

Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in $G$, is called…

Rivin conjectured that the conjugacy growth series of a hyperbolic group is rational if and only if the group is virtually cyclic. Ciobanu, Hermiller, Holt and Rees proved that the conjugacy growth series of a virtually cyclic group is…

We study the boundaries of relatively hyperbolic HHGs. Using the simplicial structure on the hierarchically hyperbolic boundary, we characterize both relative hyperbolicity and being thick of order 1 among HHGs. In the case of relatively…

We formulate the most general gravitational models with constant negative curvature ("hyperbolic gravity") on an arbitrary orientable two-dimensional surface of genus $g$ with $b$ circle boundaries in terms of a $\text{PSL}(2,\mathbb…

This arXived paper has two independant parts, that are improved and corrected versions of different parts of a single paper once named "On equations in relatively hyperbolic groups". The first part is entitled "Existential questions in…

An old open problem in number theory is whether Chebotarev density theorem holds in short intervals. More precisely, given a Galois extension $E$ of $\mathbb{Q}$ with Galois group $G$, a conjugacy class $C$ in $G$ and an $1\geq…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

We discuss time complexity of The Conjugacy Problem in HNN-extensions of groups, in particular, in Miller's groups. We show that for "almost all", in some explicit sense, elements, the Conjugacy Problem is decidable in cubic time. It is…

The nonsoluble length $\lambda(G)$ of a finite group $G$ is defined as the minimum number of nonsoluble factors in a normal series of $G$ each of whose quotients either is soluble or is a direct product of nonabelian simple groups. The…

A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.

*by a standard (one-tape) Turing machine. It is well-known that the word problem for hyperbolic groups, whence in particular for free groups, can be solved in linear time. However, these algorithms run on machines more complicated than a…

Kitaev, Potapov, and Vajnovszki [On shortening u-cycles and u-words for permutations, Discrete Appl. Math, 2019] described how to shorten universal words for permutations, to length $n!+n-1-i(n-1)$ for any $i \in [(n-2)!]$, by introducing…

Guba and Sapir asked if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give a solution to the latter question using elementary techniques which rely purely on the description of F…

We present explicit upper bounds for the number and size of conjugacy classes in finite Chevalley groups and their variations. These results have been used by many authors to study zeta functions associated to representations of finite…

Word equations are a crucial element in the theoretical foundation of constraint solving over strings, which have received a lot of attention in recent years. A word equation relates two words over string variables and constants. Its…

In this article we study a class of central extensions of $\mathbb{Z}\wr\mathbb{Z}$, as first described by Hall. On the one hand, we consider groups of this type with cyclic centre, our construction yields a rich class of groups. In…

The Diophantine problem for a monoid $M$ is the decision problem to decide whether any given system of equations has a solution in $M$. In this note, we give a simple example of a context-free, word-hyperbolic, finitely presented, special…

This paper is an extended abstract of the dissertation presented by the author for the doctoral degree in physics and mathematics (in Russia). The main characteristic studied in the dissertation is combinatorial complexity, which is a…