“…Example 2.5. We recall a construction from [29]. Let p, q, and r be three, not necessarily distinct, primes with q = r such that q and r do not divide p qr − 1, let V be the additive group of the field F p qr of order p qr , let S be the Galois group of the field extension F p qr /F p , let C be the cyclic subgroup of order p qr −1 p r −1 of the multiplicative group of F * p qr and let G :…”
Section: Groups Whose Bipartite Divisor Graphs Have Special Shapesmentioning
confidence: 99%
“…Thus B(G) is a path if and only if p qr −1 p r −1 is a prime power. Lemma 3.1 in [29] yields that, if p qr −1 p r −1 is a prime power, then either r is a power of q, or p = q = 2 and r = 3. The first case is not possible because by hypothesis r and q are distinct primes.…”
Section: Groups Whose Bipartite Divisor Graphs Have Special Shapesmentioning
Let G be a finite group. The bipartite divisor graph B(G) for the set of irreducible complex character degrees cd(G) is the undirected graph with vertex set consisting of the prime numbers dividing some element of cd(G) and of the non-identity character degrees in cd(G), where a prime number p is declared to be adjacent to a character degree m if and only if p divides m. The graph B(G) is bipartite and it encodes two of the most widely studied graphs associated to the character degrees of a finite group: the prime graph and the divisor graph on the set of irreducible character degrees.
“…Example 2.5. We recall a construction from [29]. Let p, q, and r be three, not necessarily distinct, primes with q = r such that q and r do not divide p qr − 1, let V be the additive group of the field F p qr of order p qr , let S be the Galois group of the field extension F p qr /F p , let C be the cyclic subgroup of order p qr −1 p r −1 of the multiplicative group of F * p qr and let G :…”
Section: Groups Whose Bipartite Divisor Graphs Have Special Shapesmentioning
confidence: 99%
“…Thus B(G) is a path if and only if p qr −1 p r −1 is a prime power. Lemma 3.1 in [29] yields that, if p qr −1 p r −1 is a prime power, then either r is a power of q, or p = q = 2 and r = 3. The first case is not possible because by hypothesis r and q are distinct primes.…”
Section: Groups Whose Bipartite Divisor Graphs Have Special Shapesmentioning
Let G be a finite group. The bipartite divisor graph B(G) for the set of irreducible complex character degrees cd(G) is the undirected graph with vertex set consisting of the prime numbers dividing some element of cd(G) and of the non-identity character degrees in cd(G), where a prime number p is declared to be adjacent to a character degree m if and only if p divides m. The graph B(G) is bipartite and it encodes two of the most widely studied graphs associated to the character degrees of a finite group: the prime graph and the divisor graph on the set of irreducible character degrees.
For a character [Formula: see text] of a finite group [Formula: see text], the number [Formula: see text] is called the co-degree of [Formula: see text]. In this paper, we concentrate on some conditions on the character co-degree sets implying solvability. More precisely, we show that if for every non-principal irreducible characters [Formula: see text] and [Formula: see text] of [Formula: see text] with [Formula: see text], the greatest common divisor of [Formula: see text] and [Formula: see text] is divisible by at most two primes (counting multiplicities), then either [Formula: see text] is solvable or [Formula: see text] is isomorphic to one of the groups [Formula: see text], [Formula: see text] or an extension of an elementary abelian [Formula: see text]-group [Formula: see text] of order [Formula: see text] by [Formula: see text]. In the last case, the set of the co-degrees of the irreducible characters of [Formula: see text] is [Formula: see text].
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.