首页> 外文期刊>Journal of Combinatorial Theory, Series A >Separating hyperplanes of edge polytopes
【24h】

Separating hyperplanes of edge polytopes

机译:分离边缘多面体的超平面

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

摘要

Let G be a finite connected simple graph with d vertices and let PGRd be the edge polytope of G. We call PG decomposable if PG decomposes into integral polytopes PG+ and PG- via a hyperplane. In this paper, we explore various aspects of decomposition of PG: we give an algorithm deciding the decomposability of PG, we prove that PG is normal if and only if both PG+ and PG- are normal, and we also study how a condition on the toric ideal of PG (namely, the ideal being generated by quadratic binomials) behaves under decomposition.
机译:令G为具有d个顶点的有限连通简单图,令PGRd为G的边多边形。如果PG通过超平面分解为整数多边形PG +和PG-,则称PG可分解。在本文中,我们探讨了PG分解的各个方面:给出了确定PG可分解性的算法,当且仅当PG +和PG-均正常时,证明PG正常,并且我们还研究了PG上的条件PG的复曲面理想(即由二次二项式生成的理想)在分解下表现。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号