Related papers: Algorithms for the Tits alternative and related pr…
In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.
We prove a Tits alternative for topological full groups of minimal actions of finitely generated groups. On the one hand, we show that topological full groups of minimal actions of virtually cyclic groups are amenable. By doing so, we…
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…
We prove an analog of the Tits alternative for rational functions. In particular, we show that if $S$ is a finitely generated semigroup of rational functions over the complex numbers, then either $S$ has polynomially bounded growth or $S$…
This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.
We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also…
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…
We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…
We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
Let $X$ be a surface, possibly with boundary. Suppose it has infinite genus or infinitely many punctures, or a closed subset which is a disk with a Cantor set removed from its interior. For example, $X$ could be any surface of infinite type…
This paper considers finite-automata based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this…
We discuss various types of Tits Alternative for subgroups of graph products of groups, and prove that, under some natural conditions, a graph product of groups satisfies a given form of Tits Alternative if and only if each vertex group…
We present here algorithms for efficient computation of linear algebra problems over finite fields.
Every abelian (and even every nilpotent) group contains a solution of any finite unimodular system of equations over itself. However, this is not true for infinite systems. We deduced a criterion for a periodic abelian group to contain a…
We show that a finite group $G$ admitting an automorphism $\alpha$ such that the function $G\rightarrow G$, $g\mapsto g\alpha(g)$, is bijective is necessarily solvable.
We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…
A theorem of Cantat and Urech says that an analog of the classical Tits alternative holds for the group of birational automorphisms of a compact complex Kaehler surface. We established in our previous paper the following Tits-type…
We describe an algorithm for deciding whether or not a given finitely generated torsion-free nilpotent group is decomposable as the direct product of nontrivial subgroups.