P : (n) x n: , where A is the set of all vertices of P and each P : (n) is a certain periodic function of n. The Ehrhart reciprocity law follows automatically from the above formula. We also present a formula for the coefficients of Ehrhart polynomials in terms of elementary symmetric functions. 200
Counting lattice points in pyramids
✍ Scribed by Patrick Solé
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 416 KB
- Volume
- 139
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
The old problem of counting lattice points in euclidean spheres leads to use Jacobi theta functions and its relatives as generating functions. Important lattices (root systems, the Leech lattice) can be constructed from algebraic codes and analogies between codes and lattices have been extensively studied by coding theorists and number theorists alike. In this dictionary, the MacWilliams formula is the finite analog of the Poisson formula.
The new problem of counting lattice points in spheres for the L 1 distance leads to hyperbolic trigonometric functions. The same analogy exists but the L 1 counterpart of the Poisson formula is missing. The MacWilliams formula leads to such a duality formula for those lattices which are constructed from codes via Construction A. A connection with Ehrart enumerative theory of polytopes is pointed out. Both problems have important applications in multidimensional vector quantization.
📜 SIMILAR VOLUMES
The number of visible (primitive) lattice points in the sphere of radius R is well approximated by 4π 3ζ(3) R 3 . We consider an integral expression involving the error term E \* (R), which leads to ). This is comparable to what is known in the sphere problem. We can avoid the use of the second pow