2000 character limit reached
Cantor polynomials and the Fueter-Polya theorem
Published 27 Dec 2015 in math.NT | (1512.08261v1)
Abstract: A packing polynomial is a polynomial that maps the set $\mathbf{N}_02$ of lattice points with nonnegative coordinates bijectively onto $\mathbf{N}_0$. Cantor constructed two quadratic packing polynomials, and Fueter and Polya proved analytically that the Cantor polynomials are the only quadratic packing polynomials. The purpose of this paper is to present a beautiful elementary proof of Vsemirnov of the Fueter-Polya theorem. It is a century-old conjecture that t
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.