MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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?

share|cite|improve this question

closed as not a real question by Gjergji Zaimi, GH from MO, Zev Chonoles, Andrés E. Caicedo, Martin Brandenburg Oct 13 '11 at 7:46

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

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 '11 at 22:38
up vote 2 down vote accepted

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.

share|cite|improve this answer
From there on to function fields it's but a jump. – Felipe Voloch Oct 13 '11 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 '11 at 20:33

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