SearcharxivSearch

arXiv · 1607.04855

Minimal generating systems and properties of Sylow 2-subgroups of alternating group

Abstract

The background of this paper is the following: search of the minimal systems of generators for this class of group which still was not founded also problem of representation for this class of group, exploration of systems of generators for Sylow 2-subgroups $Syl_2{A_{2^k}}$ and $Syl_2{A_{n}}$ of alternating group, finding structure these subgroups. The aim of this paper is to research the structure of Sylow 2-subgroups and to construct a minimal generating system for such subgroups. In other words, the problem is not simply in the proof of existence of a generating set with elements for Sylow 2-subgroup of alternating group of degree $2^k $ and its constructive proof and proof its minimality. For the construction of minimal generating set we used the representation of elements of group by automorphisms of portraits for binary tree. The main result is the proof of minimality of this generating set of the above described subgroups and also the description of their structure. Key words: minimal system of generators, wreath product, Sylow subgroups, group, semidirect product.

Explore related subjects

Keep this discovery

BibTeXRIS

Ruslan Skuratovskii. 2016-07-17. Minimal generating systems and properties of Sylow 2-subgroups of alternating group. https://arxiv.org/abs/1607.04855

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