Abstract:In the factorial ring of Dirichlet polynomials we explore the connections between how the Dirichlet polynomial P G (s) associated with a finite group G factorizes and the structure of G. If P G (s) is irreducible, then G/Frat G is simple. We investigate whether the converse is true, studying the factorization in the case of some simple groups. For any prime p ≥ 5 we show that if P G (s) = P Alt(p) (s), then G/Frat G ∼ = Alt(p) and P Alt(p) (s) is irreducible. Moreover, if P G (s) = P PSL(2,p) (s), then G/Frat … Show more
“…The ring R of Dirichlet polynomials is a factorial domain and an important role in the factorization of P G (s) in R is played by the normal subgroups of G. We recall a result in this direction that has been employed already in [4] …”
Section: The Main Theoremmentioning
confidence: 99%
“…In [4] we showed that if n is a prime number, then P Alt(n) (s) is irreducible and G/ Frat G Alt(n). Hence we shall assume that n is not a prime number.…”
Section: The Main Theoremmentioning
confidence: 99%
“…In this paper we prove this conjecture when G 1 = Alt(n). The case of alternating groups of prime degree was considered in [4]; moreover it has been proved that the polynomial P Alt(n) (s) is irreducible when n is a prime number. It is still an open question whether this result holds for any n.…”
Section: Introduction For Any Finite Group G We May Define a Complexmentioning
Abstract. Let G be a finite group; there exists a uniquely determined Dirichlet polynomial P G (s) such that if t ∈ ,ގ then P G (t) gives the probability of generating G with t randomly chosen elements. We show that if2000 Mathematics Subject Classification. 20P05, 20D06.
“…The ring R of Dirichlet polynomials is a factorial domain and an important role in the factorization of P G (s) in R is played by the normal subgroups of G. We recall a result in this direction that has been employed already in [4] …”
Section: The Main Theoremmentioning
confidence: 99%
“…In [4] we showed that if n is a prime number, then P Alt(n) (s) is irreducible and G/ Frat G Alt(n). Hence we shall assume that n is not a prime number.…”
Section: The Main Theoremmentioning
confidence: 99%
“…In this paper we prove this conjecture when G 1 = Alt(n). The case of alternating groups of prime degree was considered in [4]; moreover it has been proved that the polynomial P Alt(n) (s) is irreducible when n is a prime number. It is still an open question whether this result holds for any n.…”
Section: Introduction For Any Finite Group G We May Define a Complexmentioning
Abstract. Let G be a finite group; there exists a uniquely determined Dirichlet polynomial P G (s) such that if t ∈ ,ގ then P G (t) gives the probability of generating G with t randomly chosen elements. We show that if2000 Mathematics Subject Classification. 20P05, 20D06.
“…The above theorem was proved for G ∼ = A 1 (p), p prime, in [7] and for G ∼ = A 1 (t), 2 B 2 (t 2 ) and 2 G 2 (t 2 ) in [25]. Now, we turn to a more general setting.…”
Section: Introductionmentioning
confidence: 91%
“…Classical groups, class S S π S (S) (l, t) A l (t) t l+1 , t l (2, 4), (5, t), (7,2), (17,3), (19,2) and (3, 2 k …”
In this paper, we assume that G is a primitive monolithic group with nonabelian socle soc(G) ∼ = S n for some simple group S of Lie type. Under some assumptions on the Lie rank of S, we prove that P G,soc(G) (s) is irreducible in the ring of finite Dirichlet series. Moreover, we show that the Dirichlet polynomial P S (s) = P S,S (s) of a simple group S of Lie type is reducible if and only if S is isomorphic to A 1 (p), where p is a Mersenne prime such that log 2 (p + 1) ≡ 3 (mod 4).
Given a finite group G, let P G (s) be the probability that s randomly chosen elements generate G, and let H be a finite group with P G (s) = P H (s). We show that if the nonabelian composition factors of G and H are PSL(2, p) for some non-Mersense prime p ≥ 5, then G and H have the same non-Frattini chief factors.2010 Mathematics Subject Classification. 20D06.
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.