首页> 外文会议>International Integer Programming and Combinatorial Optimization Conference >Simple Explicit Formula for Counting Lattice Points of Polyhedra
【24h】

Simple Explicit Formula for Counting Lattice Points of Polyhedra

机译:计算Polyhedra格子点的简单明确公式

获取原文
获取外文期刊封面目录资料

摘要

Given z∈C{sup}n and A∈Z{sup}(m×n), we provide an explicit expression and an algorithm for evaluating the counting function h(y; z) :=∑{z{sup}x|x∈Z{sup}n; Ax=y, x≥0}. The algorithm only involves simple (but possibly numerous) calculations. In addition, we exhibit finitely many fixed convex cones of R{sup}n explicitly and exclusively defined by A, such that for any y∈Z{sup}m, h(y; z) is obtained by a simple formula that evaluates ∑z{sup}x over the integral points of those cones only. At last, we also provide an alternative (and different) formula from a decomposition of the generating function into simpler rational fractions, easy to invert.
机译:给定z∈c{sup} n和a∈z{sup}(m×n),我们提供了一种显式表达式和用于评估计数函数h(y; z)的算法:=σ{z {sup} x | x∈z{sup} n; x = y,x≥0}。该算法仅涉及简单(但可能众多)的计算。另外,我们明确地展现了r {sup} n的许多固定凸锥体,例如由a,例如任何Y∈z{sup} m,h(y; z)通过评估σ的简单公式获得z {sup} x仅在那些锥体的整数点上。最后,我们还提供了一种替代(和不同)公式从发电功能的分解成更简单的合理分数,易于反转。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号