finite solvable group
Recently Published Documents


TOTAL DOCUMENTS

64
(FIVE YEARS 11)

H-INDEX

6
(FIVE YEARS 1)

Author(s):  
BURCU ÇINARCI

Abstract Let G be a finite solvable group and let p be a prime divisor of $|G|$ . We prove that if every monomial monolithic character degree of G is divisible by p, then G has a normal p-complement and, if p is relatively prime to every monomial monolithic character degree of G, then G has a normal Sylow p-subgroup. We also classify all finite solvable groups having a unique imprimitive monolithic character.


Author(s):  
Ualbai Umirbaev ◽  
Viktor Zhelyabin

We show that the right ideal of a Novikov algebra generated by the square of a right nilpotent subalgebra is nilpotent. We also prove that a [Formula: see text]-graded Novikov algebra [Formula: see text] over a field [Formula: see text] with solvable [Formula: see text]-component [Formula: see text] is solvable, where [Formula: see text] is a finite additive abelean group and the characteristic of [Formula: see text] does not divide the order of the group [Formula: see text]. We also show that any Novikov algebra [Formula: see text] with a finite solvable group of automorphisms [Formula: see text] is solvable if the algebra of invariants [Formula: see text] is solvable.


Author(s):  
Yuliya V. Gorbatova

We describe the structure of finite solvable non-nilpotent groups in which every two strongly n-maximal subgroups are permutable (n = 2; 3). In particular, it is shown for a solvable non-nilpotent group G that any two strongly 2-maximal subgroups are permutable if and only if G is a Schmidt group with Abelian Sylow subgroups. We also prove the equivalence of the structure of non-nilpotent solvable groups with permutable 3-maximal subgroups and with permutable strongly 3-maximal subgroups. The last result allows us to classify all finite solvable groups with permutable strongly 3-maximal subgroups, and we describe 14 classes of groups with this property. The obtained results also prove the nilpotency of a finite solvable group with permutable strongly n -maximal subgroups if the number of prime divisors of the order of this group strictly exceeds n (n=2; 3).


2020 ◽  
Vol 490 (2) ◽  
pp. 124341
Author(s):  
Igor Klep ◽  
James Eldred Pascoe ◽  
Gregor Podlogar ◽  
Jurij Volčič

Author(s):  
BURCU ÇINARCI ◽  
TEMHA ERKOÇ

Isaacs and Seitz conjectured that the derived length of a finite solvable group $G$ is bounded by the cardinality of the set of all irreducible character degrees of $G$ . We prove that the conjecture holds for $G$ if the degrees of nonlinear monolithic characters of $G$ having the same kernels are distinct. Also, we show that the conjecture is true when $G$ has at most three nonlinear monolithic characters. We give some sufficient conditions for the inequality related to monolithic characters or real-valued irreducible characters of $G$ when the commutator subgroup of $G$ is supersolvable.


2020 ◽  
Vol 30 (05) ◽  
pp. 1073-1080
Author(s):  
Güli̇n Ercan ◽  
İsmai̇l Ş. Güloğlu

Let [Formula: see text] be a finite solvable group and [Formula: see text] be a subgroup of [Formula: see text]. Suppose that there exists an [Formula: see text]-invariant Carter subgroup [Formula: see text] of [Formula: see text] such that the semidirect product [Formula: see text] is a Frobenius group with kernel [Formula: see text] and complement [Formula: see text]. We prove that the terms of the Fitting series of [Formula: see text] are obtained as the intersection of [Formula: see text] with the corresponding terms of the Fitting series of [Formula: see text], and the Fitting height of [Formula: see text] may exceed the Fitting height of [Formula: see text] by at most one. As a corollary it is shown that for any set of primes [Formula: see text], the terms of the [Formula: see text]-series of [Formula: see text] are obtained as the intersection of [Formula: see text] with the corresponding terms of the [Formula: see text]-series of [Formula: see text], and the [Formula: see text]-length of [Formula: see text] may exceed the [Formula: see text]-length of [Formula: see text] by at most one. These theorems generalize the main results in [E. I. Khukhro, Fitting height of a finite group with a Frobenius group of automorphisms, J. Algebra 366 (2012) 1–11] obtained by Khukhro.


2019 ◽  
Vol 19 (10) ◽  
pp. 2050190
Author(s):  
Carolina Vallejo Rodríguez

Let [Formula: see text] be a finite solvable group and let [Formula: see text] for some prime [Formula: see text]. Whenever [Formula: see text] is odd, Isaacs described a correspondence between irreducible characters of degree not divisible by [Formula: see text] of [Formula: see text] and [Formula: see text]. This correspondence is natural in the sense that an algorithm is provided to compute it, and the result of the application of the algorithm does not depend on choices made. In the case where [Formula: see text], G. Navarro showed that every irreducible character [Formula: see text] of degree not divisible by [Formula: see text] has a unique linear constituent [Formula: see text] when restricted to [Formula: see text], and that the map [Formula: see text] defines a bijection. Navarro’s bijection is obviously natural in the sense described above. We show that these two correspondences are the same under the intersection of the hypotheses.


2019 ◽  
Vol 30 (02) ◽  
pp. 253-265 ◽  
Author(s):  
Cindy Tsang ◽  
Chao Qin

We exhibit infinitely many natural numbers [Formula: see text] for which there exists at least one insolvable group of order [Formula: see text], and yet the holomorph of every solvable group of order [Formula: see text] has no insolvable regular subgroup. We also solve Problem 19.90(d) in the Kourovka notebook.


2019 ◽  
Vol 18 (10) ◽  
pp. 1950183 ◽  
Author(s):  
Burcu Çınarcı ◽  
Temha Erkoç

In this paper, we prove that the Taketa inequality, namely the derived length of a finite solvable group [Formula: see text] is less than or equal to the number of distinct irreducible complex character degrees of [Formula: see text], is true under some conditions related to the real and the monolithic characters of [Formula: see text].


Sign in / Sign up

Export Citation Format

Share Document