Cantor polynomials and the Fueter-Pólya theorem
From MaRDI portal
Publication:4576574
Abstract: A packing polynomial is a polynomial that maps the set of lattice points with nonnegative coordinates bijectively onto . 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
Recommendations
Cites work
- scientific article; zbMATH DE number 6427311 (Why is no real title available?)
- scientific article; zbMATH DE number 3071176 (Why is no real title available?)
- A family of \((n-1)!\) diagonal polynomial orders of \(N^ n\)
- An enlarged family of packing polynomials on multidimensional lattices
- Cantor polynomials for semigroup sectors
- Data graphs and addressing schemes
- Diagonal polynomials and diagonal orders on multidimensional lattices
- Packing polynomials on multidimensional integer sectors
- Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials
- Polynomial indexing of integer lattice-points. II. Nonexistence results for higher-degree polynomials
- Polynomials in Two Variables Taking Distinct Integer Values at Lattice- Points
- The diagonal polynomials of dimension four
Cited in
(4)
This page was built for publication: Cantor polynomials and the Fueter-Pólya theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576574)