Startseite On Gluck’s conjecture for wreath product type groups
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

On Gluck’s conjecture for wreath product type groups

  • Hangyang Meng ORCID logo EMAIL logo und Xiuyun Guo ORCID logo
Veröffentlicht/Copyright: 6. August 2024

Abstract

A well-known conjecture of Gluck claims that | G : F ( G ) | b ( G ) 2 for all finite solvable groups 𝐺, where F ( G ) is the Fitting subgroup and b ( G ) is the largest degree of a complex irreducible character of 𝐺. In this paper, we prove that Gluck’s conjecture holds for all wreath product type groups of the form G H 1 H 2 H r , where 𝐺 is a finite solvable group acting primitively on F ( G ) / Φ ( G ) , and each H i is a solvable primitive permutation group of finite degree.

Award Identifier / Grant number: 12001359

Award Identifier / Grant number: 12171302

Funding statement: This research is sponsored by Young Scientists Fund of NSFC (12001359). This research is supported by the National Natural Science Foundation of China (12171302).

A Appendix: Exceptional cases

In this final section, let X = GL ( 2 , 3 ) be the general linear group on V = F 3 F 3 , consisting of all invertible 2 × 2 -matrices over F 3 . Let 𝐼 be the identity matrix and set

a = ( 0 1 1 0 ) , b = ( 1 1 1 1 ) , c = ( 1 1 0 1 ) , d = ( 1 0 0 1 ) .

Lemma 7

With the notation above, we have

  1. a , b Q 8 , a 2 = I = b 2 and b 1 a b = a 1 ;

  2. c , d S 3 , c 3 = I = d 2 and d 1 c d = c 1 ;

  3. 𝑋 is the semidirect product of a , b and c , d with a , b normal; in particular, c 1 a c = b ; c 1 b c = b a ; d 1 a d = a 1 , d 1 b d = ( b a ) 1 .

  4. Let v = ( 0 , 1 ) , u = ( 1 , 0 ) V . Then

    C X ( v ) = { x X v x = v } = c , d ;

    hence O 2 ( X ) = a , b acts transitively on V { 0 } . Moreover, we have

    C X ( v ) C X ( u ) = 1 ,

    so 𝑋 has a regular orbit on V V .

Proof

The results follow from direct calculation. ∎

Now we denote the set of all tensor (or Kronecker) products of pairs x , y in X = GL ( 2 , 3 ) by

G 0 = { x y x , y GL ( 2 , 3 ) } ,

and also set

S 0 = { x y x , y SL ( 2 , 3 ) } .

Note that G 0 , S 0 are both subgroups of GL ( V V ) GL ( 4 , 3 ) . Write

τ = ( 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 ) .

Note that τ 2 = 1 and τ 1 ( x y ) τ = y x , x , y GL ( 2 , 3 ) . Set

G = G 0 , τ , G 1 = S 0 , d d , τ , G 2 = S 0 , ( d I ) τ .

Lemma 8

With the notation above, let u = ( 1 , 0 ) , v = ( 0 , 1 ) V and set

λ = v v , μ = u v + v u V V .

  1. 𝐺 is the unique primitive subgroup (up to conjugacy) in GL ( V V ) of order 2304, which has three orbits { 0 } , λ G , μ G on V V of length 1, 32, 48 respectively. Moreover,

    C G ( λ ) = τ , c I , d I , I c , I d S 3 S 2 , C G ( μ ) = a a 1 , b ( b a ) 1 , c c 1 , ( d d ) , τ S 4 × S 2 .

  2. Let 𝐻 be a subgroup of 𝐺 with S 0 H and | G : H | = 2 . Then H = G 0 , G 1 or G 2 . Moreover, for i = 0 , 2, G i has three orbits { 0 } , λ G i , μ G i on V V of length 1, 32, 48 respectively; G 1 has four orbits on V V of length 1, 32, 24, 24 and

    C G 1 ( λ ) = G 1 C G ( λ ) = c 1 , 1 c , d d , τ = c c , ( d d ) τ × c 2 c , τ S 3 × S 3 .

Proof

Part (1) follows from a direct calculation and GAP [14]. For part (2), it is easy to see that G / S 0 D 8 . Hence there exist three maximal subgroups of 𝐺 containing S 0 , that is, G 0 , G 1 , G 2 . For i = 0 , 2 , we see that C G ( λ ) and C G ( μ ) is not contained in G i as τ G i . So

| G i : C G i ( λ ) | = | G i C G ( λ ) : C G ( λ ) | = | G : C G ( λ ) | = 32 , | G i : C G i ( μ ) | = | G i C G ( μ ) : C G ( μ ) | = | G : C G ( μ ) | = 48 .

Hence G i has the same orbits as 𝐺 for i = 0 , 2 . But for i = 1 , we see that

C G ( λ ) G 1 and C G ( μ ) G 1 G .

Hence λ G 1 = λ G and μ G is the union of two distinct G 1 -orbits of the same length equal to 24, as desired. ∎

Acknowledgements

The authors would like to thank the referees and editors for several helpful comments.

  1. Communicated by: Hung Tong-Viet

References

[1] J. P. Cossey, Z. Halasi, A. Maróti and H. N. Nguyen, On a conjecture of Gluck, Math. Z. 279 (2015), no. 3–4, 1067–1080. 10.1007/s00209-014-1403-6Suche in Google Scholar

[2] S. Dolfi, Large orbits in coprime actions of solvable groups, Trans. Amer. Math. Soc. 360 (2008), no. 1, 135–152. 10.1090/S0002-9947-07-04155-4Suche in Google Scholar

[3] S. Dolfi and E. Jabara, Large character degrees of solvable groups with abelian Sylow 2-subgroups, J. Algebra 313 (2007), no. 2, 687–694. 10.1016/j.jalgebra.2006.12.004Suche in Google Scholar

[4] A. Espuelas, Large character degrees of groups of odd order, Illinois J. Math. 35 (1991), no. 3, 499–505. 10.1215/ijm/1255987794Suche in Google Scholar

[5] D. Gluck, The largest irreducible character degree of a finite group, Canad. J. Math. 37 (1985), no. 3, 442–451. 10.4153/CJM-1985-026-8Suche in Google Scholar

[6] B. Huppert, Endliche Gruppen. I, Grundlehren Math. Wiss. 134, Springer, Berlin, 1967. 10.1007/978-3-642-64981-3Suche in Google Scholar

[7] B. Huppert, Character Theory of Finite Groups, De Gruyter Exp. Math. 25, Walter de Gruyter, Berlin, 1998. 10.1515/9783110809237Suche in Google Scholar

[8] I. M. Isaacs, Character Theory of Finite Groups, Pure Appl. Math. 69, Academic Press, New York, 1976. Suche in Google Scholar

[9] O. Manz and T. R. Wolf, Representations of Solvable Groups, London Math. Soc. Lecture Note Ser. 185, Cambridge University, Cambridge, 1993. 10.1017/CBO9780511525971Suche in Google Scholar

[10] H. Meng, A. Ballester-Bolinches and R. Esteban-Romero, On large orbits of subgroups of linear groups, Trans. Amer. Math. Soc. 372 (2019), no. 4, 2589–2612. 10.1090/tran/7639Suche in Google Scholar

[11] A. Moretó and T. R. Wolf, Orbit sizes, character degrees and Sylow subgroups, Adv. Math. 184 (2004), no. 1, 18–36. 10.1016/S0001-8708(03)00093-8Suche in Google Scholar

[12] T. R. Wolf, Large orbits of supersolvable linear groups, J. Algebra 215 (1999), no. 1, 235–247. 10.1006/jabr.1998.7730Suche in Google Scholar

[13] Y. Yang, Large character degrees of solvable 3 -groups, Proc. Amer. Math. Soc. 139 (2011), no. 9, 3171–3173. 10.1090/S0002-9939-2011-10735-4Suche in Google Scholar

[14] GAP Group, Gap–groups, algorithms, and programming, version 4.9.1., http://www.gap-system.org, 2018. Suche in Google Scholar

Received: 2024-02-19
Revised: 2024-06-18
Published Online: 2024-08-06
Published in Print: 2025-01-01

© 2024 Walter de Gruyter GmbH, Berlin/Boston

Heruntergeladen am 16.9.2025 von https://www.degruyterbrill.com/document/doi/10.1515/jgth-2024-0042/html
Button zum nach oben scrollen