Related papers: Free Products of digroups
We construct Graev ultrametrics on free products of groups with two-sided invariant ultrametrics and HNN extensions of such groups. We also introduce a notion of a free product of general Polish groups and prove, in particular, that two…
In various classes of infinite groups, we identify groups that are presentable by products, i.e. groups having finite index subgroups which are quotients of products of two commuting infinite subgroups. The classes we discuss here include…
We give two slight generalizations of results of Poizat about elementary theories of groups obtained by free constructions. The first-one concerns the non-superstability of such groups in most cases, and the second-one concerns the…
We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…
We construct a family of automata with n states, n>3, acting on a rooted binary tree that generate the free products of cyclic groups of order 2.
We introduce the notion of free decomposition spaces: they are simplicial spaces freely generated by their inert maps. We show that left Kan extension along the inclusion $j \colon \Delta_{\operatorname{inert}} \to \Delta$ takes general…
We prove an estimate for the rank of the intersection of free subgroups in virtually free groups, which is analogous to the Hanna Neumann inequality for subgroups in a free group and to the S.V. Ivanov estimate for subgroups in free…
We introduce the concept of a pants decomposition for a finitely generated free group and construct the corresponding pants graph. A pants decomposition of a free group leads to the formation of a simplicial graph, referred to as the pants…
We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct products of free and abelian groups: after introducing enriched automata (i.e., automata with extra abelian labels), we obtain an explicit…
We develop a method to show that some (abstract) groups can be embedded into a free pro-$p$ group. In particular, we show that a finitely generated subgroup of a free $\mathbb Q$-group can be embedded into a free pro-$p$ group for almost…
This note contains a (short) proof of the following generalisation of the Friedman--Mineyev theorem (earlier known as the Hanna Neumann conjecture): if $A$ and $B$ are nontrivial free subgroups of a virtually free group containing a free…
An almost-direct product of free groups is an iterated semidirect product of finitely generated free groups in which the action of the constituent free groups on the homology of one another is trivial. We determine the structure of the…
We adapt Safin's result on powers of sets in free groups to obtain Helfgott type growth in free products: if A is any finite subset of a free product of two arbitrary groups then either A is conjugate into one of the factors, or the size of…
It has recently been proved that the class of unital exact C*-algebras is closed under taking reduced amalgamated free products. In particular, this implied that the class of exact discrete groups is closed under taking amalgamated free…
In this paper, the problem formulated in [8] is solved. We prove, that the group of automorphisms of the category of free associative algebras is generated by semi-inner and mirror automorphisms
We present a link between easy quantum groups, discrete groups and combinatorics. By this, we infer new connections between quantum isometry groups, reflection groups, varieties of groups and the combinatorics of partitions. More precisely,…
We prove that Dehn twists about opposite curves that define a complete partition on an $n$-punctured disk $D_n$ generate either a free group or a free product of abelian groups. Additionally, we introduce an algorithm based on Dynnikov…
We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…
We survey the extensions of a group by a group using crossed products instead of exact sequences of groups. The approach has various advantages, one of them being that the crossed product is an universal object. Several new applications are…