Skip to main content
Log in

Diagonal polynomials and diagonal orders on multidimensional lattices

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

HereR andN denote the real numbers and the nonnegative integers, respectively. Alsos(x)=x 1+···+x n whenx=(x 1, …,x n) inR n. A mapf:R nR is call adiagonal function of dimensionn iff|N n is a bijection ontoN and, for allx, y inN n, f(x)<f(y) whens(x)<s(y). Morales and Lew [6] constructed 2n−2 inequivalent diagonal polynomial functions of dimensionn for eachn>1. Here we use new combinatorial ideas to show that numberd n of such functions is much greater than 2n−2 forn>3. These combinatorial ideas also give an inductive procedure to constructd n+1 diagonal orderings of {1, …,n}.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. G. Cantor, Ein Beitrag zur Mannigfaltigkeitslehre,J. Reine Angew. Math. (Crelle’s Journal),84 (1878), 242–258.

    Article  Google Scholar 

  2. G. Cantor, Beitrage zur Begrundung der Transfiniter Mengenlehre,Math. Ann.,46 (1885), 481–512; translated asContributions to the Founding of the Theory of Transfinite Numbers, Dover, New York, 1952.

    Article  Google Scholar 

  3. A. L. Cauchy,Cours d’analyse de l’École Royale Polytechnique, 1re partie: Analyse algébrique, l’Imprimerie Royale, Paris, 1821, reprinted by Wissenschaftliche Buchgesellschaft, Darmstadt, 1968, pp. 140–158.

    Google Scholar 

  4. J. S. Lew, L. B. Morales, and A. Sanches-Flores, Diagonal Polynomials for Small Dimension,Math. Systems Theory,29 (1996), 305–310.

    MathSciNet  MATH  Google Scholar 

  5. L. B. Morales, An Application of Elementary Combinatorics to Infinite Multivariable Polynomials Interpolation,Aport. Mat. Comun. Soc. Mat. Mex.,14 (1994), 319–321.

    Google Scholar 

  6. L. B. Morales and J. S. Lew, An Enlarged Family of Packing Polynomials on Multidimensional Lattices,Math. Systems Theory,29 (1996), 293–303.

    MathSciNet  MATH  Google Scholar 

  7. A. L. Rosenberg, Data Graphs and Addressing Schemes,J. Comput. System Sci.,5 (1971), 193–238.

    Article  MathSciNet  MATH  Google Scholar 

  8. A. L. Rosenberg, Storage Mappings for Extendible Arrays, in R. T. Yeh (ed.),Current Trends in Programming Methodology, Vol. IV, Prentice-Hall, Englewood Cliffs, NJ, 1978, pp. 263–311.

    Google Scholar 

  9. T. Skolem, Über die Zurückführbarkeit einiger durch Rekursionen definierter Relationen auf “Arithmetische” (1937), in T. Skolem (ed.),Selected Works in Logic, Universitetsforlaget, Oslo, 1970.

    Google Scholar 

  10. T. Skolem, The Development of Recursive Arithmetic (1947), in T. Skolem (ed.),Selected Works in Logic, Universitetsforlaget, Oslo, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Morales, L.B. Diagonal polynomials and diagonal orders on multidimensional lattices. Theory of Computing Systems 30, 367–382 (1997). https://doi.org/10.1007/BF02679466

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02679466

Keywords

Navigation