Groups having complete bipartite divisor graphs for their conjugacy class sizes
ROGHAYEHHAFEZIEH(*) - PABLOSPIGA(**)
ABSTRACT- Given a finite groupG, thebipartite divisor graphfor its conjugacy class sizes is the bipartite graph with bipartition consisting of the set of conjugacy class sizes ofGnZ(G)(whereZ(G)denotes the centre ofG) and the set of prime numbers that divide these conjugacy class sizes, and withfp;ngbeing an edge if gcd(p;n)61.
In this paper we construct infinitely many groups whose bipartite divisor graph for their conjugacy class sizes is the complete bipartite graphK2;5, giving a solution to a question of Taeri [15].
MATHEMATICSSUBJECTCLASSIFICATION(2010). Primary 00Z99; secondary 99A00.
KEYWORDS. Bipartite divisor graph, conjugacy class size, extra-special group.
1. Introduction
Given a finite groupG, there are several sets of invariants that convey nontrivial information about the structure ofG. Some classical examples include the set consisting of the orders of the elements ofG, or the set of conjugacy class sizes ofG, or the set of degrees of the irreducible complex characters ofG.
For every setXas above, it is natural to ask to what extent the group structure ofGis reflected and influenced byX, and a useful tool in this kind of investigation is the so-called bipartite divisor graph B(X) of X. The
(*) Indirizzo dell'A.: Department of Mathematics, Gebze Institute of Technol- ogy, Gebze, Turkey.
E-mail: roghayeh@gyte.edu.tr
(**) Indirizzo dell'A.: Dipartimento di Matematica e Applicazioni, University of Milano-Bicocca, Via Cozzi 55 Milano, MI 20125, Italy.
E-mail: pablo.spiga@unimib.it
bipartition of the vertex set ofB(X) consists ofXn f1gand of the set of prime numbers dividingx, for somex2X, and the edge set ofB(X) con- sists of the pairsfp;xgwithgcd(p;x)61.
In this paper we are interested in the case thatXconsists of the con- jugacy class sizes ofG, that is,X fjgGj jg2Gg, and hence we study the bipartite divisor graph for the conjugacy class sizes. We will denote this graph simply byB(G). We refer the reader to the beautiful survey [5] for the influence of the conjugacy class sizes on the structure of finite groups.
Historically, various graphs associated with the algebraic structure of a finite group have been extensively studied by a large number of authors, see for example [1, 2, 3, 4, 6, 9, 13, 16]. Recently, Lewis [14] discussed many remarkable connections among these graphs by analysing analogous of these graphs for arbitrary positive integer subsets. Then, inspired by the survey of Lewis, Praeger and Iranmanesh [12] introduced the bipartite divisor graphB(X) for a finite setXof positive integers and studied some basic invariants of this graph (such as the diameter, girth, number of connected components and clique number).
One of the main questions that naturally arises in this area is classifying the groups whose bipartite divisor graphs have special graphical shapes.
For instance, in [10], the first author of this paper and Iranmanesh have classified the groups whose bipartite divisor graphs are paths. Similarly, Taeri [15] considered the case that the bipartite divisor graph is a cycle, and in the course of his investigation posed the following question:
Question([15, Question 1]). Is there any finite group G such that B(G) is isomorphic to a complete bipartite graph Km;n, for some positive in- tegers m;n2?
The main theorem of this paper gives a family of examples which shows that the answer to this question is positive.
THEOREM1.1. For every odd prime p, there exists af2;pg-group G with B(G)K2;5.
In light of Theorem 1.1, we pose the following question.
QUESTION1.2. For which positive integers m;n2, is there a finite group G with B(G)Km;n?
In this paper we have tried to produce infinitely many groupsGwith B(G)Km;n,m;n2 and withm;nas small as possible. We were unable
to construct groupsGwithB(G)K2;3. Observe that Dolfi and Jabara [8]
have classified the finite groups having only two non-trivial conjugacy class sizes, and from this remarkable work it follows [8, Corollary C] that there is no groupGwithB(G)K2;2.
REMARK 1.3. Shortly after the submission of ourarXivpreprint [11]
and during the refereeing process of an earlier draft of this paper, Casolo has provided us of a conjecture addressing Question 1.2. For the sake of completeness we include it here:
CONJECTURE1.4 [7]. If G is a finite group with B(G)Km;n(where n is the number of non-identity conjugacy class sizes of G), then n2m.
In particular, Casolo conjectures that there exists no finite group G with B(G)K2;3. (Casolo has proved [7] that there are groups G with B(G)K2;4, we include a sketch of his construction in Section 3.).
Clearly a ``working'' conjecture can be very useful for the developing of new research, and hence we acknowledge our deepest gratitude to our friend Carlo Casolo for his contribution.
2. Groups with complete bipartite divisor graphs for their conjugacy class sizes
Given a finite group G, we denote byZ(G) the centre ofG, and given g2G, we denote bygGthe conjugacy class ofgunderG. Furthermore,jgGj denotes the cardinality ofgG.
NOTATION2.1. We letpbe an odd prime number andEbe the extra- special 2-group of plus-type
E hx1;. . .;xp 1;y1;. . .;yp 1;z j x2i y2i z2[xi;z][yi;z]18i;
[xi;xj][yi;yj][xi;yj]18i6j;
[xi;yi]z8ii:
Observe that
[xe11 xepp 11;yh11 yhpp11]ze1h1 ep 1hp 1; and that every elementg2Ecan be written uniquely as
gxe11 xepp 11yh11 yhpp 11zn
withei;hi2 f0;1gfor eachi2 f1;. . .;p 1gandn2 f0;1g.
Finally, we letAandBbe the maps fromfx1;. . .;xp 1;y1;. . .;yp 1;zg toEgiven (with exponential notation) by
zAz; zB z;
xAi xi1; xBi xp i; for eachi2 f1;. . .;p 2g;
xAp 1x1 xp 1; xBp 1x1;
yAi y1yi1; yBi yp i; for eachi2 f1;. . .;p 2g;
yAp 1y1; yBp 1y1:
LEMMA2.2. Let E, A and B be as in Notation2:1.Then A and B extend to two automorphisms a and b (respectively) of E.Moreover, apb2 (ab)21andha;biis a dihedral group of order2p.
PROOF. To show thatAandBextend to two automorphisms, sayaandb respectively, ofEit suffices to prove that they preserve the defining relations of E. For instance, for every i2 f1;. . .;p 2g, we have [xAi;yAi] [xi1;y1yi1][xi1;yi1]zzA[xi;yi]A. Similarly, [xAp 1;yAp 1] [x1 xp 1;y1][x1;y1]zzA[xp 1;yp 1]A. Fori;j2 f1;. . .;p 2g with i6j, we have [xAi;yAj][xi1;y1yj1]1[xi;xj]A. Moreover, [xAi;yAp 1][xi1;y1]1[xi;yp 1]Aand [xAp 1;yAj][x1 xp 1;y1yj1]
[x1;y1][xj1;yj1] zz1[xp 1;yj]A. All the other computations are similar and are left to the conscientious reader.
It is readily seen thatb2fixes each generatorx1;. . .;xp 1,y1;. . .;yp 1,z of E, and hence b21. Observe that xap21(x1 xp 2xp 1)a xa1 xap 2xap 1x2 xp 1(x1 xp 1)x1. Thus xa1p (xa1p 2)a2 xap21x1, and hence xaip (xa1i 1)ap (xa1p)ai1xa1i1xi for every i2 f1;. . .;p 1g. Arguing inductively oni, we getyaip 1i yp 1 iyp 1for each i2 f1;. . .;p 1g. It follows that yaip i (yp i 1yp 1)ay1yp iy1 yp i. Giveni2 f1;. . .;p 1g, applying this equality first to the indexiand then to the indexp i, we get yaip(yaip i)aiyap ii yp (p i) yi. The- reforeapfixesx1;. . .;xp 1;y1;. . .;yp 1;zand henceap1. Finally, we have
zabz;
xabi xbi1 xp i 1; 8i2 f1;. . .;p 2g;
xabp 1(x1 xp 1)bxp 1 x1x1. . .xp 1;
yabi (y1yi1)byp 1yp i 1; 8i2 f1;. . .;p 2g;
yabp 1yb1yp 1;
from which it easily follows that (ab)21. p
PROOF OFTHEOREM1:1. Letp;E;AandBbe as in Notation 2.1, leta andbbe the automorphisms extendingAandBas in Lemma 2.2, and set M ha;bi. Given two elements n1 and n2 of order p, define N hn1i hn2i EandGNjM where
na1 n1; na2 n1n2; nb1n1; nb2n21
(note that this is well-defined because the action ofM ha;bionhn1;n2i determines a dihedral group of automorphisms of hn1;n2iorder 2p). We show thatB(G)K2;5.
We start by determining the conjugacy class sizes ofGnZ(G). Clearly, Z(G) hn1;zi.
We claim that the conjugacy classes ofGinNnZ(G) have cardinality 2p or 4p. Lete2 fh2Ej[a;h]2Z(E)gand writeexe11 xepp 11yh11 yhpp11zn, for somee1;. . .;ep 1;h1;. . .;hp 1;n2 f0;1g. We have
ea(xe11)a (xepp 11)a(yh11)a (yhpp11)a(zn)a
xe21xe32 xepp 21(x1 xp 1)ep 1(y1y2)h1(y1y3)h2 (y1yp 1)hp 2yh1p 1zn
xe1p 1xe21ep 1 xepp 21ep 1yh11 hp 1yh21 yhpp12zn:
As e 1ea[e;a]2Z(E) hzi, by comparing e with ea, we get ei hi0 for every i2 f1;. . .;p 1g, and hence e2Z(E). Thus fh2Ej[a;h]2Z(E)g Z(E). In particular,CE a Z(E) andaacts fixed point freely onEnZ(E). It follows that the orbits ofMacting by conjuga- tion onEnZ(E) have size por 2p. SincejE0j 2, for everye2EnZ(E) we havejE:CE ej 2. ThuseGhas size 2por 4p. Now letg2NnZ(N).
Writegne, for some n2 hn1;n2i n hn1iand e2En hzi. Now CN g hn1;n2iCE ehas index 2 in Nand so (asadoes not centralise n)CG g
has index divisible by 2p. It follows (with an elementary computation) that the conjugacy classes of Gin NnZ(G) have size 2p or 4p. Observe that both possibilities can occur: jxG1j 4p andj(x1xp 1)Gj 2p.
Let g2 hN;ai nN and write gnai, for some n2N and i2
f1;. . .;p 1g. Now, givene2E, we haveenezn, for somen2 f0;1g. In
particular, if e2CE g, then eeg(en)ai(ezn)aieaizn, and hence [a;e]2Z(E). Thus e2Z(E). It follows thatCN g Z(G) and jCG gj pjCN gj 2p2. ThusjgGj 22p 1p.
It remains to compute the size of the conjugacy classes of G in Gn ha;Ni. Observe that every element of Gn ha;Ni is conjugate to an element of hb;Ni nN. In particular, since we are interested only on the conjugacy class sizes, we may assume thatg2 hb;Ni nN. Writegnb, for
somen2N. Observe that
fh2Ej[h;b]2Z(E)g hx1xp 1;x2xp 2;. . .;x(p 1)=2x(p1)=2;
y1yp 1;y2yp 2;. . .;y(p 1)=2y(p1)=2;zi CE b;
and jCE bj 2p. Now, arguing as above, it is easy to verify that CN g hn1;CE bi and jhn1;CE bi:CN gj 2 f1;2g. Thus jCG gj 2 fp22p;p22p1g and hencejgGjequals 2p 1p2 or 2pp2. Observe that both of these cases can occur: in fact jbGj jG:CG bj 2p 1p2 and j(x1b)Gj jG:CG x1bj 2pp2.
Summing up, the conjugacy class sizesjgGj(asgruns throughGnZ(G)) are 2p;4p;22p 1p;2p 1p2;2pp2, from which it follows thatB(G)K2;5. p
3. The caseB(G)K2;4
Here we describe a groupGwithB(G)K2;4: the construction is due to Casolo [7]. LetQ be the quaternion group of order 8, and letQ1 hq1i, Q2 hq2iandQ3 hq3ibe the three maximal subgroups ofQ. Letpbe an odd prime and letEbe the extra-specialp-group
hx1;x2;x3;y1;y2;y3;zjxpi ypi zp[xi;z][yi;z]18i;
[xi;xj][yi;yj][xi;yj]18i6j;[xi;yi]z8ii:
Arguing as in Section 2, it is easy to verify that by assigning
xq11x1; yq11y1; xq21x21; yq21y21; xq31x31; yq31y31; zq1z;
xq12x11; yq12y11; xq22x2; yq22y2; xq32x31; yq32y31; zq2z;
xq13x11; yq13y11; xq23x21; yq23y21; xq33x3; yq33y3; zq3z;
we define a group-action ofQonE. SetGEjQ.
Now, following the proof of Theorem 1.1 we see that the conjugacy class sizesjgGj, asgruns throughGnZ(G), are 2p, 4p, 2p4and 2p5. In particular, B(G)K2;4.
REFERENCES
[1] G. ALFANDARY, On graphs related to conjugacy classes of groups, Israel J.
Math.86(1994), 211-220.
[2] A. AZAD, M. A. IRANMANESH, C. E. PRAEGER, P. SPIGA,Abelian coverings of finite general linear groups and an application to their non-commuting graphs, J. Algebraic Combin.34(2011), 683-711.
[3] E. A. BERTRAM, M. HERZOG, A. MANN, On a graph related to conjugacy classes of groups, Bull. London Math. Soc.22(1990), 569-575.
[4] D. BUBBOLONI, S. DOLFI, M. A. IRANMANESH, C. E. PRAEGER, On bipartite divisor graphs for group conjugacy class sizes, J. Pure Appl. Algebra213 (2009), 1722-1734.
[5] A. R. CAMINA, R. D. CAMINA,The influence of conjugacy class sizes on the structure of finite groups: a survey, Asian-European J. Math.4(2011), 559- [6] C. C588.ASOLO, S. DOLFI, The diameter of a conjugacy class graph of finite
groups, Bull. London Math. Soc.28(1996), 141-148.
[7] C. CASOLO,personal communication.
[8] S. DOLFI, E. JABARA,The structure of finite groups of conjugate rank2, Bull.
London Math. Soc.41(2009), 916-926.
[9] S. DOLFI, E. PACIFICI, L. SANUS, P. SPIGA,On the vanishing prime graph of groups, Journal Lond. Math. Soc.82(2010), 167-183.
[10] R. HAFEZIEH, M. A. IRANMANESH,Bipartite divisor graph for the product of subsets of integers, Bull. Aust. Math. Soc.87(2013), 288-297.
[11] R. HAFEZIEH, P. SPIGA,Groups having complete bipartite divisor graphs for their conjugacy class sizes, arXiv:1309.5629.
[12] M. A. IRANMANESH, C. E. PRAEGER, Bipartite divisor graphs for integer subsets, Graphs Combin.26(2010), 95-105.
[13] L. S. KAZARIN, On groups with isolated conjugacy classes, Izv. Vyssh.
Uchebn. Zaved. Mat.25(1981), 40-45.
[14] M. L. LEWIS,An overview of graphs associated with character degrees and conjugacy class sizes in finite groups, Rocky Mountain J. Math.38 (2008), 175-211.
[15] B. TAERI, Cycles and bipartite graph on conjugacy class of groups, Rend.
Semin. Mat. Univ. Padova123(2010), 233-247.
[16] J. S. WILLIAMS, Prime graph components of finite groups, J. Algebra 69 (1981), 487-513.
Manoscritto pervenuto in redazione il 22 settembre 2013.