Abstract |
|
In the factorial ring of Dirichlet
polynomials we explore the connections between how the Dirichlet
polynomial PG(s)
associated with a finite group G factorizes and the structure of G. If PG(s) is
irreducible, then G ∕ FratG 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 PG(s) =
PAlt(p)(s), then
G ∕ FratG≅Alt(p) and
PAlt(p)(s) is
irreducible. Moreover, if PG(s) =
PPSL(2,p)(s), then
G ∕ FratG is simple, but PPSL(2,p)(s) is
reducible whenever p =
2t − 1 and t = 3
mod 4.
|
Authors
|