Related papers: Effective JSJ Decompositions
We give a complete classification of finitely generated virtually free groups up to $\forall\exists$-elementary equivalence. As a corollary, we give an algorithm that takes as input two finite presentations of virtually free groups, and…
It was proved that for any finite set of elements of a free product of residually finite groups such that no two of them belong to conjugate cyclic subgroups and each of them do not belong to a subgroup which is conjugate a to free factor…
An indecomposable decomposition of a torsion-free abelian group $G$ of rank $n$ is a decomposition $G=A_1\oplus\cdots\oplus A_t$ where $A_i$ is indecomposable of rank $r_i$ so that $\sum_i r_i=n$ is a partition of $n$. The group $G$ may…
Let G be a torsion--free abelian group of finite rank. The automorphism group Aut(G) acts on the set of maximal independent subsets of G. The orbits of this action are the isomorphism classes of indecomposable decompositions of G. G…
We say a group is finitely annihilated if it is the set-theoretic union of all its proper normal finite index subgroups. We investigate this new property, and observe that it is independent of several other well known group properties. For…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used by many authors to solve a wide collection of decision problems for free groups and their subgroups. In the present…
We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…
A JSJ decomposition of a group is a splitting that allows one to classify all possible splittings of the group over a certain family of edge groups. Although JSJ decompositions are not unique in general, Guirardel--Levitt have constructed a…
We describe an algorithm that uses Stallings' folding technique to decompose an element of $Aut(F_n)$ as a product of Whitehead automorphisms (and hence as a product of Nielsen transformations.) We use this to give an alternative method of…
The Gauss decompositions of the quantum groups, related to classical Lie groups and supergroups are considered by the elementary algebraic and $R$-matrix methods. The commutation relations between new basis generators (which are introduced…
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…
We define a class $\mathcal{U}$ of solvable groups of finite abelian section rank which includes all such groups that are virtually torsion-free as well as those that are finitely generated. Assume that $G$ is a group in $\mathcal{U}$ and…
Let A denote either the automorphism group of the free group of rank n>=4 or the mapping class group of an orientable surface of genus n>=12 with at most 1 boundary component, and let G be either the subgroup of IA-automorphisms or the…
We discuss the decomposability of torsion-free abelian groups. We show that among computable groups of finite rank this property is $\Sigma^0_3$-complete. However, when we consider groups of infinite rank, it becomes $\Sigma^1_1$-complete,…
For several natural filtrations of a free group S we express the n-th term of the filtration as the intersection of all kernels of homomorphisms from S to certain groups of upper-triangular unipotent matrices. This generalizes a classical…
For a subgroup of a free product of finite groups, we obtain necessary conditions (on its Kurosh decomposition) to be verbally closed.
A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We prove that the multiple conjugacy problem is solvable between two n-tuples A and B of…
We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…
In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…