Related papers: The subgroup identification problem for finitely p…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this paper, we prove that if $\sigma_1(G)<2+\frac{11}{|G|}$\,, then $G$ is supersolvable. In particular, some new characterizations of the well-known groups…

We construct a finitely presented group with property (T) which can not act on on reasonable spaces. Such group is constructed using an generalization of Hall embedding theorem, where property (T) is added at the expense of weakening the…

Let F be a locally compact non-archimedean field, p its residue characteristic, and G a connected reductive group over F. Let C an algebraically closed field of characteristic p. We give a complete classification of irreducible admissible…

We show that every finitely generated group admits weak analogues of an invariant expectation, whose existence characterizes exact groups. This fact has a number of applications. We show that Hopf $G$-modules are relatively injective, which…

We introduce the notion of soficity for locally compact groups and list a number of open problems.

Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First,…

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

It is known that a group G definable in the field of p-adic numbers is definably locally isomorphic to the group of Q_p-points of a connected algebraic group H defined over Q_p. We show that if H is commutative then G is…

We prove that the free product of two finitely presented locally tame groups is locally tame and describe many examples of tame subgroups of finitely presented groups. We also include some open problems related to tame subgroups.

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is…

Suppose that a finite group $G$ admits a Frobenius group of automorphisms FH of coprime order with cyclic kernel F and complement H such that the fixed point subgroup $C_G(H)$ of the complement is nilpotent of class $c$. It is proved that…

The Boone--Higman conjecture is that every recursively presented group with solvable word problem embeds in a finitely presented simple group. We discuss a brief history of this conjecture and work towards it. Along the way we describe some…

Let $p$ be a prime and let $\mathbb{C}$ be the complex field. We explicitly classify the finite solvable irreducible monomial subgroups of $\mathrm{GL}(p,\mathbb{C})$ up to conjugacy. That is, we give a complete and irredundant list of…

We construct a finitely presented group with undecidable word problem and with Dehn function bounded by a quadratic function on an infinite set of positive integers.

We show that an infinite group $G$ definable in a $1$-h-minimal field admits a strictly $K$-differentiable structure with respect to which $G$ is a (weak) Lie group, and show that definable local subgroups sharing the same Lie algebra have…

We show that the Identity Problem is decidable in polynomial time for finitely generated sub-semigroups of the group $\mathsf{UT}(4, \mathbb{Z})$ of $4 \times 4$ unitriangular integer matrices. As a byproduct of our proof, we also show the…

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…

We introduce and investigate different definitions of effective amenability, in terms of computability of F{\o}lner sets, Reiter functions, and F{\o}lner functions. As a consequence, we prove that recursively presented amenable groups have…

Given any finitely presented group G we find a triangular algebra such that has two presentations, one with fundamental group G and another with trivial group. Thus proving that given a collection G1,...,Gn of finitely presented groups…