Related papers: Revisiting the number of simple $K_4$-groups

This expository article revolves around the question to find short presentations of finite simple groups. This subject is one of the most active research areas of group theory in recent times. We bring together several known results on…

We refer to the set of the orders of elements of a finite group as its spectrum and say that groups are isospectral if their spectra coincide. We prove that with the only specific exception the solvable radical of a nonsolvable finite group…

In this paper we prove that the Diophantine problem in iterated restricted wreath products $G$ of arbitrary non-trivial free abelian groups $A_1,\ldots, A_k$, $k>1$ of finite ranks is undecidable, i.e., there is no algorithm that given a…

We determine for which known finite simple groups $G$ and which primes $p$ the $p$-fusion system of $G$ is simple. This means first collecting together the results that were already known (and correcting two errors made in an earlier study…

We first prove that the Whitehead group of a torsion-free virtually solvable linear group vanishes. Next we make a reduction of the fibered isomorphism conjecture from virtually solvable groups to a class of virtually solvable Q-linear…

We study sequences of noncommutative random variables which are invariant under "quantum transformations" coming from an orthogonal quantum group satisfying the "easiness" condition axiomatized in our previous paper. For 10 easy quantum…

We prove that there is no algorithm that can determine whether or not a finitely presented group has a non-trivial finite quotient; indeed, this remains undecidable among the fundamental groups of compact, non-positively curved square…

This is the second one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple unitary groups.

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

These notes are devoted to lattices in products of trees and related topics. They provide an introduction to the construction, by M. Burger and S. Mozes, of examples of such lattices that are simple as abstract groups. Two features of that…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

In this note we provide some counterexamples for the conjectures of finite simple groups, one of the conjectures said "all finite simple groups $G$ can be determined using their orders $|G|$ and the number of elements of order $p$, where…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

In this note we find all the solutions of the Diophantine equation $x^4\pm y^4=iz^2$ using elliptic curves over $\mathbb Q(i)$. Also, using the same method we give a new proof of Hilbert's result that the equation $x^4\pm y^4=z^2$ has only…

We show that the Diophantine problem in Thompson's group F is undecidable. Our proof uses the facts that F has finite commutator width and rank 2 abelianisation, then uses similar arguments used by B\"uchi and Senger and Ciobanu and Garreta…

We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…

The spectrum of a finite group is the set of element orders of this group. The main goal of this paper is to survey results concerning recognition of finite simple groups by spectrum, in particular, to list all finite simple groups for…

By following the same construction pattern which Martin Davis proposed in a 1968 paper of his, we have obtained six quaternary quartic Diophantine equations that candidate as `rule-them-all' equations: proving that one of them has only a…

Motivated by questions in cryptography, we look for diophantine equations that are hard to solve but for which determining the number of solutions is easy.

The main aim of this article is to study the quantitative structure of projective symplectic groups $PSp_{4}(q)$ with $q>2$ even. Indeed, we prove that the groups $PSp_{4}(q)$ with $q>2$ even are uniquely determined by their orders and the…