Zu einem von B. H. und H. Neumann gestellten Problem

From MaRDI portal
Revision as of 22:00, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3234175

DOI10.1002/MANA.19550140406zbMath0071.25202OpenAlexW2150210072MaRDI QIDQ3234175

Wolfgang Gaschütz

Publication date: 1955

Published in: Mathematische Nachrichten (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mana.19550140406




Related Items (66)

Generating Permutation GroupsGROWTH OF GENERATING SETS FOR DIRECT POWERS OF CLASSICAL ALGEBRAIC STRUCTURESAn application of a theorem of GaschützOn relation groupsOn the connectivity of the non-generating graphObstructions to lifting automorphisms of free algebrasEnumerating finite groups without Abelian composition factors.On representations of \(\operatorname{Gal}(\overline{\mathbb{Q}} / \mathbb{Q})\), \(\widehat{GT}\) and \(\operatorname{Aut}(\hat{F}_2)\)Hanna NeumannGenerating sets of finite groupsGenus, thickness and crossing number of graphs encoding the generating properties of finite groupsMaximal subgroups of direct productsThe generating graph of finite soluble groups.The probability of generating a finite simple group.The diameter of the generating graph of a finite soluble groupOn Finite Groups With ‘Hidden’ PrimesMaximal subgroups of finite groups avoiding the elements of a generating setOn T-systems of groupsUniversal finite group extensions and a non-splitting theoremOn boundedly generated subgroups of profinite groups.The construction of finite solvable groups revisited.Crowns and factorization of the probabilistic zeta function of a finite group.Gaschütz lemma for compact groupsPrefrattini subgroups and crownsThe minimum generating set problemSemiregularity and connectivity of the non-𝔉 graph of a finite groupThe generating graph of a profinite groupFinite soluble groups satisfying the swap conjecture.The pro-supersolvable topology on a free group: deciding densenessOn the number of generators for certain finite groupsUniversal covers of finite groupsThe coset poset and probabilistic zeta function of a finite groupOn the (non-)contractibility of the order complex of the coset poset of a classical group.Powers in finite groups.Lifting of generating subgroupsConnectivity of the product replacement graph of simple groups of bounded Lie rank.Complements of the socle in monolithic groups.Growth sequences of finitely generated groups IIGenerators of maximal orders.Generators and commutators in finite groups; abstract quotients of compact groups.On the probability of generating a minimal d-generated groupGrowth sequences of finite algebrasThe elementary theory of algebraic fields of finite corankTHE ANDREWS–CURTIS CONJECTURE AND BLACK BOX GROUPSFinite groups with planar generating graphPro-finite presentationsOn the number of generators for certain finite groups. IIOn groups withd-generator subgroups of coprime indexComputing \(p\)-groups with trivial Schur multiplicator.Growth sequences of finitely generated groupsGenerators and minimal normal subgroupsOn the isomorphism problem for polycyclic groupsGeneration of polycyclic groupsEpimorphisms between the free groups in a variety of groupsFree presentations and relation modules of finite groupsA bound on the number of generators of a finite groupGroups satisfying a strong complement propertyMinimal invariable generating setsFinitely generated subgroups of free profinite groups and of some Galois groupsCharacteristic subgroups and automorphisms of free profinite groupsProjective objects in categories of group extensionsForbidden subgraphs in generating graphs of finite groupsCoprime invariable generation and minimal-exponent groups.How many elements are needed to generate a finite group with good probability?Unitary representations and compact groupsNielsen equivalence in Gupta-Sidki groups







This page was built for publication: Zu einem von B. H. und H. Neumann gestellten Problem