MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).
0

Irreducible polynomials are often introduced as the analog to prime numbers in polynomial rings. Prime numbers, of course, have a very rich theory, leading to the likes of the Riemann Zeta function and the Prime Number Theorem.

Do any analogs and/or generalizations of primes, such as irreducible polynomials and prime elements, have similarly rich theorems/conjectures?

flag
1 
 Well, there is a zeta function and a prime number theorem for irreducible polynomials over finite fields, but both are quite easy to investigate. – Qiaochu Yuan Oct 12 2011 at 22:38

closed as not a real question by Gjergji Zaimi, GH, Zev Chonoles, Andres Caicedo, Martin Brandenburg Oct 13 2011 at 7:46

1 Answer

2

Maybe the first generalization of prime numbers is to prime ideals in algebraic number fields. You do get analogs of the zeta-function, the Prime Number Theorem, even the Riemann Hypothesis. Any text on algebraic number theory will take you there.

link|flag
From there on to function fields it's but a jump. – Felipe Voloch Oct 13 2011 at 12:53
A step over a curb type jump or an Evel Knievel Snake River Canyon-like jump? Gerhard "Inquiring Minds Want To Gauge" Paseman, 2011.10.13 – Gerhard Paseman Oct 13 2011 at 20:33

Not the answer you're looking for? Browse other questions tagged or ask your own question.