Polynomial enumeration of multidimensional lattices

DOI10.1007/BF01776577zbMath0388.68039OpenAlexW2024303753MaRDI QIDQ4170231

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)

Related Items (4)

Some canonical sequences of integers ⋮ An enlarged family of packing polynomials on multidimensional lattices ⋮ CANTOR POLYNOMIALS FOR SEMIGROUP SECTORS ⋮ The diagonal polynomials of dimension four

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A structured computer system model
• 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
• Data graphs and addressing schemes
• Commutative Train Algebras of Ranks 2 and 3
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• On a Principle of Lipschitz

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