In his seminal 1951 paper "Extreme forms" Coxeter \cite{cox51} observed that for $n \ge 9$ one can add vectors to the perfect lattice $\sfA_9$ so that the resulting perfect lattice, called $\sfA_9^2$ by Coxeter, has exactly the same set of minimal vectors. An inhomogeneous analog of the notion of perfect lattice is that of a lattice with a perfect Delaunay polytope: the vertices of a perfect Delaunay polytope are the analogs of minimal vectors in a perfect lattice. We find a new infinite series $P(n,s)$ for $s\geq 2$ and $n+1\geq 4s$ of $n$-dimensional perfect Delaunay polytopes. A remarkable property of this series is that for certain values of $s$ and all $n \ge 13$ one can add points to the integer affine span of $P(n,s)$ in such a way that $P(n,s)$ remains a perfect Delaunay polytope in the new lattice. Thus, we have constructed an inhomogeneous analog of the remarkable relationship between $\sfA_9$ and $\sfA_9^2$.
In this paper, we give a criterion of the Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph: the Ehrhart ring of the stable set polytope of an h-perfect graph $G$ is Gorenstein if and only if (1) sizes of maximal cliques are constant (say $n$) and (2) (a) $n=1$, (b) $n=2$ and there is no odd cycle without chord and length at least 7 or (c) $n\geq 3$ and there is no odd cycle without chord and length at least 5.
In this paper, we give a criterion of the nearly Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph: the Ehrhart ring of the stable set polytope of an h-perfect graph $G$ with connected components $G^{(1)}, \ldots, G^{(\ell)}$ is nearly Gorenstein if and only if (1) for each $i$, the Ehrhart ring of the stable set polytope of $G^{(i)}$ is Gorenstein and (2) $|ω(G^{(i)})-ω(G^{(j)})|\leq 1$ for any $i$ and $j$, where $ω(G^{(i)})$ is the clique number of $G^{(i)}$. We also show that the Segre product of Cohen-Macaulay graded rings with linear non-zerodivisor …
For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested in polynomial time, and for every $f$-vector of $3$-polytopes, there exists an inscribable polytope with that $f$-vector. For higher-dimensional polytopes, much less is known. Of course, for any inscribable polytope, all of its lower-dimensional faces need to be inscribable, but this condition does not appear to be very strong. We observe non-trivial new ob…
We consider the computational problem of finding short paths in the skeleton of the perfect matching polytope of a bipartite graph. We prove that unless $P=NP$, there is no polynomial-time algorithm that computes a path of constant length between two vertices at distance two of the perfect matching polytope of a bipartite graph. Conditioned on $P\neq NP$, this disproves a conjecture by Ito, Kakimura, Kamiyama, Kobayashi and Okamoto [SIAM Journal on Discrete Mathematics, 36(2), pp. 1102-1123 (2022)]. Assuming the Exponential Time Hypothesis we prove the stronger result that there exists no poly…
The perfect matching polytope, i.e. the convex hull of (incidence vectors of) perfect matchings of a graph is used in many combinatorial algorithms. Kotzig, Lovász and Plummer developed a decomposition theory for graphs with perfect matchings and their corresponding polytopes known as the tight cut decomposition which breaks down every graph into a number of indecomposable graphs, so called bricks. For many properties that are of interest on graphs with perfect matchings, including the description of the perfect matching polytope, it suffices to consider these bricks. A key result by Lovász on…
Institute of Computing, UFMS（乌法联邦大学计算研究所）；Faculty of Mathematics, University of Vienna（维也纳大学数学系）；School of Mathematics and Statistics, Zhengzhou University（郑州大学数学与统计学院）
