Results 11 to 20 of about 254,436 (287)

A probabilistic version of a theorem of lászló kovács and hyo-seob sim [PDF]

open access: yesInternational Journal of Group Theory, 2020
For a finite group group‎, ‎denote by $\mathcal V(G)$ the smallest positive integer $k$ with the property that the probability of generating $G$ by $k$ randomly chosen elements is at least $1/e.$ Let $G$ be a finite soluble group‎.
Andrea Lucchini, Mariapia Moscatiello
doaj   +1 more source

On infinite anticommutative groups [PDF]

open access: yesInternational Journal of Group Theory, 2023
We completely describe the structure of locally (soluble-by-finite) groups in which all abelian subgroups are locally cyclic‎. ‎Moreover‎, ‎we prove that Engel groups with the above property are locally nilpotent‎.
Costantino Delizia, Chiara Nicotera
doaj   +1 more source

Maximal subgroups of finite soluble groups in general position [PDF]

open access: yesAnnali di Matematica Pura ed Applicata, 2015
For a finite group G we investigate the difference between the maximum size $${{\mathrm{MaxDim}}}(G)$$MaxDim(G) of an “independent” family of maximal subgroups of G and maximum size m(G) of an irredundant sequence of generators of G.
E. Detomi, A. Lucchini
semanticscholar   +2 more sources

Influence of complemented subgroups on the structure of finite groups [PDF]

open access: yesInternational Journal of Group Theory, 2021
P‎. ‎Hall proved that a finite group $G$ is supersoluble with elementary abelian Sylow subgroups if and only if every subgroup of $G$ is complemented in $G$‎. ‎He called such groups complemented‎. ‎A‎. ‎Ballester-Bolinches and X‎.
Izabela Malinowska
doaj   +1 more source

A characterization of soluble groups in which normality is a transitive relation [PDF]

open access: yesInternational Journal of Group Theory, 2017
A subgroup $X$ of‎ ‎a group $G$ is said to be an H-‎subgroup if‎ ‎NG(X) ∩ Xg  ≤ X for each element $g$ belonging to $G$‎. ‎In [M‎. ‎Bianchi and e.a.‎, ‎On finite soluble groups in which normality is a transitive relation‎, J‎.
Giovanni Vincenzi
doaj   +1 more source

Products of Finite Connected Subgroups

open access: yesMathematics, 2020
For a non-empty class of groups L, a finite group G=AB is said to be an L-connected product of the subgroups A and B if 〈a,b〉∈L for all a∈A and b∈B. In a previous paper, we prove that, for such a product, when L=S is the class of finite soluble groups ...
María Pilar Gállego   +4 more
doaj   +1 more source

On Groups with Extreme Centralizers and Normalizers [PDF]

open access: yesAdvances in Group Theory and Applications, 2016
An FCI-group is a group in which every non-normal cyclic subgroup has finite index in its centralizer and an FNI-group is one in which every non-normal subgroup has finite index in its normalizer.
Derek J.S. Robinson
doaj   +1 more source

Structure of finite groups with some weakly $S$-semipermutable subgroups [PDF]

open access: yesJournal of Mahani Mathematical Research, 2023
Let $ G $ be a finite group. If $ A\leq G $, recall that $ A $ is  weakly $S$-semipermutable  in $G$ provided there is $K\unlhd G$ such that   $KA$ is $S$-permutable in $G$, and  $K\cap A$ is $S$-semipermutable in $G$.
Hassan Jafarian Dehkordi   +2 more
doaj   +1 more source

Some Different Results on MS-Groups and MSN-Groups [PDF]

open access: yesAdvances in Group Theory and Applications, 2017
Let $P$ and $Q$ be different normal Sylow subgroups of the finite group $G$. If $G/P$ and $G/Q$ are soluble $PST$-groups (respectively $BT$-groups), then $G$ is also a soluble $PST$-group (respectively $BT$-group).
James C. Beidleman
doaj   +1 more source

On the structure of groups admitting faithful modules with certain conditions of primitivity

open access: yesResearches in Mathematics, 2023
In the paper we study structure of soluble-by-finite groups of finite torsion-free rank which admit faithful modules with conditions of primitivity. In particular, we prove that under some additional conditions if an infinite finitely generated linear ...
A.V. Tushev
doaj   +1 more source

Home - About - Disclaimer - Privacy