Ehrhart polynomials of lattice-face polytopes
| dc.creator | Liu, Fu | |
| dc.date | 2005-12-28 | |
| dc.date.accessioned | 2026-07-07T06:55:50Z | |
| dc.date.available | 2026-07-07T06:55:50Z | |
| dc.description | There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any d-dimensional simplex in general position into d! signed sets, each of which corresponds to a permutation in the symmetric group, and reduce the problem of counting lattice points in a polytope in general position to that of counting lattice points in these special signed sets. Applying this decomposition to a lattice-face simplex, we obtain signed sets with special properties that allow us to count the number of lattice points inside them. We are thus able to conclude the desired formula for the Ehrhart polynomials of lattice-face polytopes. | |
| dc.description | 28 pages | |
| dc.identifier | https://arxiv.org/abs/math/0512616 | |
| dc.identifier | http://arxiv.org/abs/math/0512616 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/106411 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A19; 52B20 | |
| dc.title | Ehrhart polynomials of lattice-face polytopes | |
| dc.type | text |