Related papers: Word and Conjugacy Problems in Groups $G_{k+1}^{k}…
We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…
We show that the word problem of the Brin-Higman-Thompson group $n G_{k,1}$ is {\sf coNP}-complete for all $n \ge 2$ and all $k \ge 2$. For this we prove that $n G_{k,1}$ is finitely generated, and that $n G_{k,1}$ contains a subgroup of $2…
An element in Artin's braid group B_n is said to be periodic if some power of it lies in the center of B_n. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in B_n are exponential in the…
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…
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 prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable group. For a finitely generated group we study the so-called power word problem (does a given…
We present a new algorithm that, given two matrices in $GL(n,Q)$, decides if they are conjugate in $GL(n,Z)$ and, if so, determines a conjugating matrix. We also give an algorithm to construct a generating set for the centraliser in…
If $G_1$ and $G_2$ are torsion-free hyperbolic groups and $P<G_1\times G_2$ is a finitely generated subdirect product, then the conjugacy problem in $P$ is solvable if and only if there is a uniform algorithm to decide membership of the…
It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed…
Recent advances in neural algorithmic reasoning with graph neural networks (GNNs) are propped up by the notion of algorithmic alignment. Broadly, a neural network will be better at learning to execute a reasoning task (in terms of sample…
The quotients $G_k/G_{k+1}$ of the lower central series of a finitely presented group $G$ are an important invariant of this group. In this work we investigate the ranks of these quotients in the case of a certain class of conjugation-free…
We prove that a subset of a virtually free group is rational if and only if the language of geodesic words representing its elements (in any generating set) is rational and that the language of geodesics representing conjugates of elements…
For a group $G$ first order definable in a structure $M$, we continue the study of the "definable topological dynamics" of $G$. The special case when all subsets of $G$ are definable in the given structure $M$ is simply the usual…
The extensive analysis of the dynamics of relativistic spinning particles is presented. Using the coadjoint orbits method the Hamiltonian dynamics is explicitly described. The main technical tool is the factorization of general Lorentz…
We give a precise definition of ``generic-case complexity'' and show that for a very large class of finitely generated groups the classical decision problems of group theory - the word, conjugacy and membership problems - all have…
Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…
We define invariants of words in arbitrary groups, measuring how letters in a word are interleaving, perfectly detecting the dimension series of a group. These are the letter-braiding invariants. On free groups, braiding invariants coincide…
We establish several new bounds for the number of conjugacy classes of a finite group, all of which involve the maximal number c of conjugacy classes of a normal subgroup fixed by some element of a suitable subset of the group. To apply…
We consider the homology theory of \'etale groupoids introduced by Crainic and Moerdijk, with particular interest to groupoids arising from topological dynamical systems. We prove a K\"unneth formula for products of groupoids and a…
The goal of this paper is to show that fundamental concepts in higher-order Fourier analysis can be nauturally extended to the non-commutative setting. We generalize Gowers norms to arbitrary compact non-commutative groups. On the…