Vol. 215, No. 1, 2004

Download This Article
Download this article. For Screen
For Printing
Recent Issues
Vol. 332: 1  2
Vol. 331: 1  2
Vol. 330: 1  2
Vol. 329: 1  2
Vol. 328: 1  2
Vol. 327: 1  2
Vol. 326: 1  2
Vol. 325: 1  2
Online Archive
Volume:
Issue:
     
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Officers
 
Subscriptions
 
ISSN 1945-5844 (electronic)
ISSN 0030-8730 (print)
 
Special Issues
Author index
To appear
 
Other MSP journals

Erika Damian & Andrea Lucchini & Fiorenza Morini

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∕FratGAlt(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.

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∕FratGAlt(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.

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) = P Alt(p)(s), then G FratG Alt(p) and P Alt(p)(s) is irreducible. Moreover, if PG(s) = P PSL(2,p)(s), then G FratG is simple, but P PSL(2,p)(s) is reducible whenever p = 2t 1 and t = 3mod4.

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) = P Alt(p)(s), then G FratG Alt(p) and P Alt(p)(s) is irreducible. Moreover, if PG(s) = P PSL(2,p)(s), then G FratG is simple, but P PSL(2,p)(s) is reducible whenever p = 2t 1 and t = 3mod4.

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 ∕ FratGAlt(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
Erika Damian
Dipartimento di Matematica
Università di Brescia
Via Valotti 9, 25133 Brescia
Italy
Andrea Lucchini
Dipartimento di Matematica
Università di Brescia
Via Valotti 9, 25133 Brescia
Italy
Fiorenza Morini
Dipartimento di Matematica
Università di Brescia
Via Valotti 9, 25133 Brescia
Italy