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

It is known that the polynomial $f(n,m)=\frac{1}{2}(n+m)(n+m+1)+m$ defines bijection $\mathbb{N}\times\mathbb{N}\to\mathbb{N}$ (Put pairs of $\mathbb{N}$ into the semi-infinite matrix and count them by diagonals). Does there exist a polynomial bijection $\mathbb{Z}\times\mathbb{Z}\to\mathbb{Z}$? The question is related to the open question about polynomial bijection $\mathbb{Q}\times\mathbb{Q}\to\mathbb{Q}$ here.

share|cite|improve this question
Related but not decisive: – Benjamin Dickman Dec 28 '12 at 6:53
[It's also AMM 6028, which remains unsolved as far as I know.] – Benjamin Dickman Dec 28 '12 at 7:02
@Dickman: It took a me a while to know what you were talking about. Let me add the link – boumol Dec 28 '12 at 11:44
@Dicman and @Boumol: Thank you for interesting references. Interesting, AMM6028 asks for polynomials with integer coefficients. In fact, the bijection $\mathbb{N}\times\mathbb{N}\to\mathbb{N}$ I know has rational coefficients. Does there exist polynomial $\mathbb{N}\times\mathbb{N}\to\mathbb{N}$ bijection with integer coefficients? – Lev Glebsky Dec 28 '12 at 18:32

It is an open problem. Maximal results about bijections from $\mathbb N\times \mathbb N$, $\mathbb Z\times \mathbb N$, $\mathbb Z\times \mathbb Z$ to $\mathbb N$ are contained in

John S. Lew, Arnold L. Rosenberg, Polynomial indexing of integer lattice-points I. General concepts and quadratic polynomials, J. Number Theory 10 (1978) pp 192-214, doi:10.1016/0022-314X(78)90035-5.
Polynomial indexing of integer lattice-points II. Nonexistence results for higher-degree polynomials, J. Number Theory 10 (1978) pp 215-243, doi:10.1016/0022-314X(78)90036-7

share|cite|improve this answer
I edited the references and links. – David Roberts Mar 10 at 7:05

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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