On the Connected Blocks Polytope

IF 0.6 3区数学 Q4 COMPUTER SCIENCE, THEORY & METHODS

Discrete & Computational Geometry Pub Date : 2024-07-11 DOI:10.1007/s00454-024-00675-5

Justus Bruckamp, Markus Chimani, Martina Juhnke

引用次数: 0

Abstract

In this paper, we study the connected blocks polytope, which, apart from its own merits, can be seen as the generalization of certain connectivity based or Eulerian subgraph polytopes. We provide a complete facet description of this polytope, characterize its edges and show that it is Hirsch. We also show that connected blocks polytopes admit a regular unimodular triangulation by constructing a squarefree Gröbner basis. In addition, we prove that the polytope is Gorenstein of index 2 and that its \(h^*\)-vector is unimodal.

Abstract Image

查看原文本刊更多论文

关于连块多面体

本文研究的是连通块多面体，它除了本身的优点外，还可以看作是某些基于连通性或欧拉子图多面体的概括。我们提供了该多面体的完整面描述，描述了它的边的特征，并证明它是赫氏多面体。我们还通过构建无平方格罗伯纳基证明了连通块状多面体具有规则的单模态三角剖分。此外，我们还证明了这个多面体是指数为 2 的 Gorenstein 多面体，而且它的\(h^*\)向量是单模态的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete & Computational Geometry 数学-计算机：理论方法

CiteScore

1.80

自引率

12.50%

发文量

审稿时长

6-12 weeks

期刊介绍： Discrete & Computational Geometry (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role. It publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometric graphs, geometry of numbers, and motion planning.