A closer look at lattice points in rational simplices (Q1307019)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A closer look at lattice points in rational simplices |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A closer look at lattice points in rational simplices |
scientific article |
Statements
A closer look at lattice points in rational simplices (English)
0 references
16 January 2000
0 references
The author obtains lattice point counting formulas for dilated rational \(n\)-dimensional polytopes showing that the number of lattice points in the interior of closure of a vector-dilated simplex are expressed by quasipolynomials that satisfy a general reciprocity law [see \textit{E. Ehrhart}, J. Reine Angew. Math. 227, 25-49 (1967; Zbl 0155.37503)]. As an example, a counting formula for a two-dimensional rectangular rational triangle is derived which permits the computation of the number of lattice points inside any rational polygon.
0 references
lattice point
0 references
\(n\)-dimensional polytopes
0 references
simplex
0 references
quasipolynomials
0 references
0.8729356527328491
0 references
0.848512589931488
0 references
