Related papers: Unsolvability of the isomorphism problem for [free…
A group is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory…
Among other things, we prove that the group of automorphisms fixing every normal subgroup of a nilpotent-by-abelian group is nilpotent-by-metabelian. In particular, the group of automorphisms fixing every normal subgroup of a metabelian…
Let G be an abelian group and let lambda be the smallest rank of any group whose direct sum with a free group is isomorphic to G. If lambda is uncountable, then G has lambda pairwise disjoint, non-free subgroups. There is an example where…
We give a solution stated in the title to problem 3 of part 1 of the problems listed in the book of Eklof and Mekler [EM],(p.453). There, in pp. 241-242, this is discussed and proved in some cases. The existence of strongly lambda-free ones…
We prove the A-theoretic Isomorphism Conjecture with coefficients and finite wreath products for solvable groups.
We determine all the multiplicity-free representations of the symmetric group. This project is motivated by a combinatorial problem involving systems of set-partitions with a specific pattern of intersection.
We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…
We consider 9 infinite families of finite $p$-groups, for $p$ a prime, and we settle the isomorphism problem that arises when the parameters that define these groups are modified.
We show that free Burnside groups of sufficiently large odd exponent are non--amenable in a certain strong sense, more precisely, their left regular representations are isolated from the trivial representation uniformly on finite generating…
In this paper we study residual solvability of the amalgamated product of two finitely generated free groups, in the case of doubles. We find conditions where this kind of structure is residually solvable, and show that in general this is…
We exhibit infinitely many natural numbers $n$ for which there exists at least one insolvable group of order $n$, and yet the holomorph of any solvable group of order $n$ has no insolvable regular subgroup. We also solve Problem 19.90 (d)…
A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We describe the compatibility JSJ decomposition over abelian groups. We prove that in…
In this paper we show that Diophantine problem for quadratic equations in Baumslag-Solitar groups $BS(1,k)$ and in wreath products $A \wr \mathbb{Z}$, where $A$ is a finitely generated abelian group and $\mathbb{Z}$ is an infinite cyclic…
We prove new separability results about free groups. Namely, if $H_1, \ldots , H_k$ are infinite index, finitely generated subgroups of a non-abelian free group $F$, then there exists a homomorphism onto some alternating group $f:F…
It is a known fact that any unimodular equation over an abelian group has a solution in that group itself. It is also known that for metabelian groups this does not hold; moreover, there is a unimodular equation over some metabelian group…
We study direct products of free-abelian and free groups with special emphasis on algorithmic problems. After giving natural extensions of standard notions into that family, we find an explicit expression for an arbitrary endomorphism of…
Suppose a group $G$ is quasi-isometric to a free product of a finite set $S$ of finitely generated abelian groups; let $S'$ denote the set of ranks of the free abelian parts of the groups in $S$. Then $G$ is commensurable with the free…
An abelian group acting freely on a $\mathrm{CAT}(0)$ cube complex is free abelian.
We prove that the compressed word problem in a group that is hyperbolic relative to a collection of free abelian subgroups is solvable in polynomial time.
We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.