Related papers: Computable Scott sentences and the weak Whitehead …

We give the following characterization of sofic (weakly sofic) groups: a group $G$ is sofic (weakly sofic) if and only if any system of equations solvable in any alternating group (any finite group) is solvable over $G$.

For all sufficiently large odd integers $n$, the following version of Higman's embedding theorem is proved in the variety ${\cal B}_n$ of all groups satisfying the identity $x^n=1$. A finitely generated group $G$ from ${\cal B}_n$ has a…

Let G be a finite group and cd(G) denote the set of complex irreducible character degrees of G. In this paper, we prove that if G is a finite group and H is an almost simple group whose socle is a sporadic simple group H0 such that cd(G) =…

We study totally disconnected, locally compact (t.d.l.c.) groups from an algorithmic perspective. We give various approaches to defining computable presentations of t.d.l.c.\ groups, and show their equivalence. In the process, we obtain an…

We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…

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…

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

We call a finite group G ultrasolvable if it has a characteristic subgroup series whose factors are cyclic. It was shown by Durbin--McDonald that the automorphism group of an ultrasolvable group is supersolvable. The converse statement was…

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

This paper is devoted to understand groups definable in Presburger arithmetic. We prove the following theorems: Theorem 1. Every group definable in a model of Presburger Arithmetic is abelian-by-finite. Theorem 2. Every bounded group…

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

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.

We show that if a finite dimensional Hopf algebra over ${\bf C}$ has a basis such that all the structure constants are non-negative, then the Hopf algebra must be given by a finite group $G$ and a factorization $G=G_+G_-$ into two…

We classify finite-dimensional complex Hopf algebras $A$ which are pointed, that is, all of whose irreducible comodules are one-dimensional, and whose group of group-like elements $G(A)$ is abelian such that all prime divisors of the order…

In this article, I study some classes of finitely presented groups with the aim of finding out whether the maximal metabelian quotients of the members of these classes admit finite presentations. The considered classes include those of…

Relying on the techniques and ideas from our recent paper [13], we prove several anti-classification results for various rigidity conditions in countable abelian and nilpotent groups. We prove three main theorems: (1) the rigid abelian…

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…

A finitely presented group is semistable at infinity if all proper rays in the Cayley 2-complex are properly homotopic. A long standing open question asks whether all finitely presented groups are semistable at infinity. This article…