Polynomial enumeration of multidimensional lattices

DOI10.1007/BF01776577MaRDI QIDQ4170231zbMATH OpenOpenAlexFDO

Authors John S. Lew

Publication date 1979

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01776577

zbMATH Keywords

ALGORITHMGEOMETRY OF NUMBERSPACKINGPOLYNOMIAL ENUMERATION OF MULTIDIMENSIONAL LATTICESTREES

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Lattice packing and covering (number-theoretic aspects) (11H31) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3172829 (Why is no real title available?)
• scientific article; zbMATH DE number 3448641 (Why is no real title available?)
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3417832 (Why is no real title available?)
• scientific article; zbMATH DE number 3198205 (Why is no real title available?)
• A structured computer system model
• Commutative Train Algebras of Ranks 2 and 3
• Data graphs and addressing schemes
• On a Principle of Lipschitz
• 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
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products

Cited in

(4)

• An enlarged family of packing polynomials on multidimensional lattices
• Cantor polynomials for semigroup sectors
• Some canonical sequences of integers
• The diagonal polynomials of dimension four

This page was built for publication: Polynomial enumeration of multidimensional lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170231)