Related papers: The Identity Problem in nilpotent groups of bounde…
The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
The famous Tits' alternative states that a linear group either contains a nonabelian free group or is soluble-by-(locally finite). We study in this paper similar alternatives in pseudofinite groups. We show for instance that an…
A covering of a group is a finite set of proper subgroups whose union is the whole group. A covering is minimal if there is no covering of smaller cardinality, and it is nilpotent if all its members are nilpotent subgroups. We complete a…
Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) asks whether $b$ can be generated by $a_1,\ldots,a_k$. If $S$ is a finite group, then there is a folklore…
Let $G$ be a solvable subgroup of the group $\diff{}{n}$ of local complex analytic diffeomorphisms. Analogously as for groups of matrices we bound the solvable length of $G$ by a function of $n$. Moreover we provide the best possible bounds…
We consider the class of groups called identity excluding which has the property that any non-trivial irreducible unitary representation restricted to a dense subgroup does not weakly contain the trivial representation. For adapted and…
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,…
We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in…
Suppose that G is a finitely generated group and W is the formal language of words defining the identity in G. We prove that if G is a nilpotent group, the fundamental group of a finite volume hyperbolic three-manifold, or a right-angled…
Two groups are said to have the same nilpotent genus if they have the same nilpotent quotients. We answer four questions of Baumslag concerning nilpotent completions. (i) There exists a pair of finitely generated, residually…
This paper develops a theory of polynomial maps from commutative semigroups to arbitrary groups and proves that it has desirable formal properties when the target group is locally nilpotent. We apply this theory to solve Waring's Problem…
Let $G$ be a finite group and $M(G)$ be the subgroup of $G$ generated by all non-central elements of $G$ that lie in the conjugacy classes of the smallest size. Recently several results have been proved regarding the nilpotency class of…
The complex algebra of an inverse semigroup with finitely many idempotents in each $\mathcal D$-class is stably finite by a result of Munn. This can be proved fairly easily using $C^*$-algebras for inverse semigroups satisfying this…
A new scheme for proving pseudoidentities from a given set {\Sigma} of pseudoidentities, which is clearly sound, is also shown to be complete in many instances, such as when {\Sigma} defines a locally finite variety, a pseudovariety of…
The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…
A well-known theorem of P. Hall, usually called Hall's criterion for nilpotence, states: a group G is nilpotent whenever it has a normal subgroup N such that G/[N,N] and N are nilpotent. We widely generalize this result, replacing groups…
We show that there is no iterated identity satisfied by all finite groups. For $w$ being a non-trivial word of length $l$, we show that there exists a finite group $G$ of cardinality at most $\exp(l^C)$ which does not satisfy the iterated…
A new sufficient condition under which a semigroup admits no finite identity basis has been recently suggested in a joint paper by Karl Auinger, Yuzhu Chen, Xun Hu, Yanfeng Luo, and the author (see http://arxiv.org/abs/1405.0783). Here we…
This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for…