Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials

DOI10.1016/0022-314X(78)90035-5zbMath0393.10035OpenAlexW2060558517MaRDI QIDQ1252374

John S. Lew, Arnold L. Rosenberg

Publication date: 1978

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-314x(78)90035-5

zbMATH Keywords

Lattice-PointsMultidimensional ArraysPacking FunctionPairing FunctionsPolynomial IndexingQuadratic PolynomialRecursive Function TheoryStorage SchemesStoring Functions

Mathematics Subject Classification ID

Quadratic and bilinear Diophantine equations (11D09) Polynomials in number theory (11C08) Data structures (68P05) Computability and recursion theory (03D99) Homogeneous approximation to one number (11J04) Nonconvex bodies (11H16)

Related Items (12)

Non-injectivity of Nonzero Discriminant Polynomials and Applications to Packing Polynomials ⋮ Packing polynomials on irrational sectors ⋮ A family of \((n-1)!\) diagonal polynomial orders of \(N^ n\) ⋮ Cantor Polynomials and the Fueter-Pólya Theorem ⋮ An enlarged family of packing polynomials on multidimensional lattices ⋮ Diagonal polynomials for small dimensions ⋮ EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE ⋮ CANTOR POLYNOMIALS FOR SEMIGROUP SECTORS ⋮ The diagonal polynomials of dimension four ⋮ Polynomial enumeration of multidimensional lattices ⋮ Polynomial indexing of integer lattice-points. II. Nonexistence results for higher-degree polynomials ⋮ Bivariate polynomial injections and elliptic curves

Cites Work

• Polynomial indexing of integer lattice-points. II. Nonexistence results for higher-degree polynomials
• Data graphs and addressing schemes
• Allocating Storage for Extendible Arrays
• Managing Storage for Extendible Arrays
• Transcendental Numbers. (AM-16)
• On a Principle of Lipschitz
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials