Results 1 to 10 of about 1,145,592 (138)

Restrictions on sets of conjugacy class sizes in arithmetic progressions [PDF]

open access: yesInternational Journal of Group Theory, 2023
We continue the investigation, that began in [M. Bianchi, A. Gillio and P. P. Pálfy, A note on finite groups in which the conjugacy class sizes form an arithmetic progression, Ischia group theory 2010, World Sci. Publ., Hackensack, NJ (2012) 20--25.] and
Alan R. Camina, Rachel D. Camina
doaj   +1 more source

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 σ-Residuals of Subgroups of Finite Soluble Groups

open access: yesMathematics, 2023
Let σ={σi:i∈I} be a partition of the set of all prime numbers. A subgroup H of a finite group G is said to be σ-subnormal in G if H can be joined to G by a chain of subgroups H=H0⊆H1⊆⋯⊆Hn=G where, for every j=1,⋯,n, Hj−1 is normal in Hj or Hj/CoreHj(Hj−1)
A. A. Heliel   +3 more
doaj   +1 more source

Groups with soluble minimax conjugate classes of subgroups [PDF]

open access: yesIranian Journal of Numerical Analysis and Optimization, 2008
A classical result of Neumann characterizes the groups in which each subgroup has finitely many conjugates only as central-by-finite groups. If X is a class of groups, a group G is said to have X-conjugate classes of subgroups if G/coreG(NG(H)) 2 X for ...
Francesco Russo
doaj   +1 more source

On Minimal Non-Soluble Groups, the Normalizer Condition and McLain Groups [PDF]

open access: yesAdvances in Group Theory and Applications, 2017
We prove that a minimal non-soluble ($MN\mathfrak{S}$ in short) Fitting $p$-group $G$ has a proper subgroup $K$ such that for every proper subgroup $R$ of $G$ containing $K$, we have $N_G(R) > R$.
Ahmet Arikan
doaj   +1 more source

Intersections of prefrattini subgroups in finite soluble groups [PDF]

open access: yesInternational Journal of Group Theory, 2017
‎Let $H$ be a prefrattini subgroup of a soluble finite group $G$‎. ‎In the‎ ‎paper it is proved that there exist elements $x,y in G$ such that the equality‎ ‎$H cap H^x cap H^y = Phi (G)$ holds‎.
Sergey Kamornikov
doaj   +1 more source

Some New Local Properties Defining Soluble PST-Groups [PDF]

open access: yesAdvances in Group Theory and Applications, 2017
Let $G$ be a group and $p$ a prime number. $G$ is said to be a $Y_p$-group if whenever $K$ is a $p$-subgroup of $G$ every subgroup of $K$ is an $S$-permutable subgroup in $N_G(K)$.
J.C. Beidleman
doaj   +1 more source

Seminormal, Non-Normal Maximal Subgroups and Soluble PST-Groups [PDF]

open access: yesAdvances in Group Theory and Applications, 2016
All groups in this paper are finite. Let G be a group. Maximal subgroups of G are used to establish several new characterisations of soluble PST-groups.
J.C. Beidleman
doaj   +1 more source

Hepatocyte growth factor and soluble cMet levels in plasma are prognostic biomarkers of mortality in patients with severe acute kidney injury [PDF]

open access: yesKidney Research and Clinical Practice, 2021
Background Hepatocyte growth factor (HGF)/cMet pathway is necessary for repair and regeneration following acute kidney injury (AKI). We evaluated the clinical potential of plasma HGF and soluble cMet as prognostic biomarkers for severe AKI requiring ...
Lilin Li   +9 more
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

Home - About - Disclaimer - Privacy