SearcharxivSearch

arXiv · 0903.5060

Schreier type theorems for bicrossed products

Abstract

We prove that the bicrossed product of two groups is a quotient of the pushout of two semidirect products. A matched pair of groups $(H, G, \alpha, \beta)$ is deformed using a combinatorial datum $(\sigma, v, r)$ consisting of an automorphism $\sigma$ of $H$, a permutation $v$ of the set $G$ and a transition map $r: G\to H$ in order to obtain a new matched pair $\bigl(H, (G,*), \alpha', \beta' \bigl)$ such that there exist an $\sigma$-invariant isomorphism of groups $H {}_{\alpha} \bowtie_{\beta} G \cong H {}_{\alpha'} \bowtie_{\beta'} (G,*)$. Moreover, if we fix the group $H$ and the automorphism $\sigma \in \Aut(H)$ then any $\sigma$-invariant isomorphism $H {}_{\alpha} \bowtie_{\beta} G \cong H {}_{\alpha'} \bowtie_{\beta'} G'$ between two arbitrary bicrossed product of groups is obtained in a unique way by the above deformation method. As applications two Schreier type classification theorems for bicrossed product of groups are given.

Explore related subjects

Keep this discovery

BibTeXRIS

A. L. Agore, G. Militaru. 2009-03-29. Schreier type theorems for bicrossed products. https://doi.org/10.2478/s11533-011-0128-6

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR