Counting lattice points by means of the residue theorem (Q1840495): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: math/0306035 / rank | |||
Normal rank |
Revision as of 22:26, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting lattice points by means of the residue theorem |
scientific article |
Statements
Counting lattice points by means of the residue theorem (English)
0 references
12 July 2001
0 references
Let \(a_1,a_2,\dots, a_n\) be integer numbers greater than or equal to 2. An \(n\)-dimensional open tetrahedron \(P\) may be defined by \[ \sum_{k=1}^n \frac{x_k}{a_k}< 1, \] where \(a_k\) are positive real numbers. The number of lattice points in the dilated domain \(tP\), where \(t\) is a natural number, can be expressed by a polynomial in \(t\) of degree \(n\). The author constructs an analytical function such that this polynomial can be found by the residue theorem with respect to this function.
0 references
lattice points in polytopes
0 references
exact enumeration problems
0 references
generating functions
0 references
dilation
0 references
Ehrhart polynomial
0 references