Related papers: Algorithms for the Tits alternative and related pr…
The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…
Given a group action on a finite-dimensional CAT(0) cube complex, we give a simple criterion phrased purely in terms of cube stabilisers that ensures that the group satisfies the strong Tits alternative, provided that each vertex stabiliser…
It is known that a group shift on a polycyclic group is necessarily of finite type. We show that, for trivial reasons, if a group does not satisfy the maximal condition on subgroups, then it admits non-SFT abelian group shifts. In…
The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…
A group is metabelian if its commutator subgroup is abelian. For finitely generated metabelian groups, classical commutative algebra, algebraic geometry and geometric group theory, especially the latter two subjects, can be brought to bear…
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a…
We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…
We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups…
Semigroups generated by topological operations such as closure, interior or boundary are considered. It is noted that some of these semigroups are in general finite and noncommutative. The problem is formulated whether they are always…
We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…
This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…
We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of matrix units in each simple epimorphic image of a finite group…
Under reasonable assumptions, a group action on a module extends to the minimal free resolutions of the module. Explicit descriptions of these actions can lead to a better understanding of free resolutions by providing, for example,…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…
Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…
We show that the generation problem in Thompson group $F$ is decidable, i.e., there is an algorithm which decides if a finite set of elements of $F$ generates the whole $F$. The algorithm makes use of the Stallings $2$-core of subgroups of…
In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…
Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of a finite group $G$. We prove that the finite groups with $\lambda(G)=|G|-t$, where $t\leq 5$, are solvable, and classify such groups.