Counting lattice points in free sums of polytopes

被引:3
|
作者
Stapledon, Alan
机构
关键词
Polytopes; Ehrhart theory; Free sums; Weighted Ehrhart polynomial;
D O I
10.1016/j.jcta.2017.04.004
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show how to compute the Ehrhart polynomial of the free sum of two lattice polytopes containing the origin P and Q in terms of the enumerative combinatorics of P and Q. This generalizes work of Beck, Jayawant, McAllister, and Braun, and follows from the observation that the weighted h*-polynomial is multiplicative with respect to the free sum. We deduce that given a lattice polytope P containing the origin, the problem of computing the number of lattice points in all rational dilates of P is equivalent to the problem of computing the number of lattice points in all integer dilates of all free sums of P with itself. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:51 / 60
页数:10
相关论文
共 50 条