Searcharxiv⌕ Search

arXiv · math/0405336

Abnormal subgroups and Carter subgroups in some infinite groups

Abstract

Some properties of abnormal subgroups in generalized soluble groups will be considered. In particular, the transitivity of abnormality in metahypercentral groups is proven. Also it will be proven that a subgroup H of a radical group G is abnormal in G if and only if every intermediate subgroup for H coincides with its normalizer in G. This result will extend on radical groups the well-known criterion of abnormality for finite soluble groups obtained by D. Taunt. For some infinite groups (not only periodic) the existence of Carter subgroups and their conjugations will be also proven.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

L. A. Kurdachenko, I. Ya. Subbotin. 2004-05-17. Abnormal subgroups and Carter subgroups in some infinite groups. https://searcharxiv.com/abs/math/0405336

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗