首页> 外文期刊>Journal of Combinatorial Theory, Series A >Counting lattice points in free sums of polytopes
【24h】

Counting lattice points in free sums of polytopes

机译:计数晶格点在多种多套物中

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:我们展示了如何在P和Q的枚举组合中计算含有原点P和Q的两个格式多项式的eHRHART多项式。这概括了Beck,Jayawant,Mcallister和Braun的工作,并从 观察到加权H * -Polynomial相对于自由总和乘法。 我们推断给定包含原点的晶格多晶硅p,计算所有合理扩张中P的晶格点数的问题相当于计算所有自由总和的所有整数的晶格点数的问题 本身。 (c)2017年Elsevier Inc.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号