Polynomial enumeration of multidimensional lattices
From MaRDI portal
Publication:4170231
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)
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)