William Gustafson
Problem 4.19 in Ziegler's "Lectures on Polytopes" asserts that every simple $3$-dimensional polytope has the property that its dual can be constructed as the convex hull of a subset of the vertices of the original simple polytope. In this note we state a higher-dimensional analogue of this conjecture and provide a family of counterexamples for dimension $d \geq 3$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A Counterexample to Ziegler's Cross-Polytope Conjecture for Simplicial 0/1-Polytopes
通过构造一个7维单纯0/1-多胞体（14个顶点）并证明其非中心对称，否定了Ziegler关于顶点数达到上界时必为中心对称交叉多胞体的猜想。
In this short note, we give large counterexamples to natural questions about certain order polytopes, in particular, Gelfand--Tsetlin polytopes. Several of the counterexamples are too large to be discovered via a brute-force computer search. We also show that the multiset of hooks in a Young diagram is not enough information to determine the Ehrhart polynomial for an associated order polytope. This is somewhat counter-intuitive to the fact that the multiset of hooks always determine the leading coefficient of the Ehrhart polynomial.
In this paper, we present a minimal counterexample to a conjecture of Perles that answers a question of Haase and Ziegler. The example is a simple 4-polytope that has an induced 3-connected 3-regular subgraph, whose graph complement is connected. This subgraph is planar and not the graph of a facet of the polytope.
We prove that the neighborly cubical polytopes studied by G"unter M. Ziegler and the first author arise as a special case of neighborly cubical spheres constructed by Babson, Billera, and Chan. By relating the two constructions we obtain an explicit description of a non-polytopal neighborly cubical sphere and, further, a new proof of the fact that the cubical equivelar surfaces of McMullen, Schulz, and Wills can be embedded into R^3.
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially checkable certificate for the correct reconstruction was found by [Joswig, Kaibel & Koerner 2000]. A much stronger certificate would be given by the following characterization of the facet subgraphs, conjectured by M. Perles: ``The facet subgraphs of the graph of a simple d-polytope are exactly all the (d-1)-regular, connected, induced, non-separating subgrap…
In the early 1990s, a family of combinatorial CW-complexes named permutoassociahedra was introduced by Kapranov, and it was realized by Reiner and Ziegler as a family of convex polytopes. The polytopes in this family are "hybrids" of permutohedra and associahedra. Since permutohedra and associahedra are simple, it is natural to search for a family of simple permutoassociahedra, which is still adequate for a topological proof of Mac Lane's coherence. This paper presents such a family.
Unimodality of the number of paths per length on polytopes: Examples, counterexamples, and a central limit theorem
该研究针对凸多面体路径数的单峰性猜想，证实部分多面体类符合猜想、构造反例否定其普遍性，并证明球面上均匀顶点的随机多面体相干路径长度满足中心极限定理。
On the numerical Terao's conjecture and Ziegler pairs for line arrangements
本文提出了一个反例，反驳了复射影平面上线束安排中的数值Terao猜想，并构造了具有相同底层matroid但不同自由解析的Ziegler对。
Higher-dimensional counterexamples to Hamiltonicity
该研究证明d≥2时d多面体的图有哈密顿线图当且仅当d≠3，构造了相关3多面体反例，并给出四个哈密顿图论结论推广到单纯复形的基本反例。
The metric polytope m(n) is the polyhedron associated with all semimetrics on n nodes. In 1992 Monique Laurent and Svatopluk Poljak conjectured that every fractional vertex of the metric polytope is adjacent to some integral vertex. The conjecture holds for n<9 and, in particular, for the 1 550 825 600 vertices of m(8). While the overwhelming majority of the known vertices of m(9) satisfy the Laurent-Poljak conjecture, we exhibit a fractional vertex not adjacent to any integral vertex.
In a Note added in proof to a 1984 paper, Daniel A. Marcus claimed to have a counterexample to his conjecture that a minimal positively k-spanning vector configuration in R^m has size at most 2km. However, the counterexample was never published, and seems to be lost. Independently, ten years earlier, Peter Mani in 1974 solved a problem by Hadwiger, disproving that every ``illuminated'' d-dimensional polytope must have at least 2d vertices. These two studies are related by Gale duality, an elementary linear algebra technique devised by Micha A. Perles in the sixties. Thus, we note that Mani's s…
Let $d \geq 3$ be an integer. It is known that the number of edges of the edge polytope of the complete graph with $d$ vertices is $d(d-1)(d-2)/2$. In this paper, we study the maximum possible number $μ_d$ of edges of the edge polytope arising from finite simple graphs with $d$ vertices. We show that $μ_{d}=d(d-1)(d-2)/2$ if and only if $3 \leq d \leq 14$. In addition, we study the asymptotic behavior of $μ_d$. Tran--Ziegler gave a lower bound for $μ_d$ by constructing a random graph. We succeeded in improving this bound by constructing both a non-random graph and a random graph whose compleme…
We prove that the intersection of a Hirsch polytope and a cube may be a non-Hirsch polytope.
An outstanding conjecture on roots of Ehrhart polynomials says that all roots $α$ of the Ehrhart polynomial of an integral convex polytope of dimension $d$ satisfy $-d \leq \Re(α) \leq d-1$. In this paper, we suggest some counterexamples of this conjecture.
As a discrete analog to Minkowski's theorem on convex bodies, Wills conjectured that the Ehrhart coefficients of a centrally symmetric lattice polytope with exactly one interior lattice point are maximized by those of the cube of side length two. We discuss several counterexamples to this conjecture and, on the positive side, we identify a family of lattice polytopes that fulfill the claimed inequalities. This family is related to the recently introduced class of $l$-reflexive polytopes.
Symmetric edge polytopes are not gamma-positive
通过构造无穷反例族，否证了Ohsugi和Tsuchiya关于对称边多胞体的Ehrhart h^*-多项式是γ-正的猜想，最小反例为36维对称边多胞体。
Using the authors' 2014 "constraints method," we give a short proof for a 2015 result of Dobbins on representations of a point in a polytope as the barycenter of points in a skeleton, and show that the "r-fold Whitney trick" of Mabillard and Wagner (2014/2015) implies that the Topological Tverberg Conjecture for r-fold intersections fails dramatically for all r that are not prime powers.
We study the equivariant Ehrhart theory of families of polytopes that are invariant under a non-trivial action of the group with order two. We study families of polytopes whose equivariant $H^*$-polynomial both succeed and fail to be effective, in particular, the symmetric edge polytopes of cycles and the rational cross-polytope. The latter provides a counterexample to the effectiveness conjecture if the requirement that the vertices of the polytope have integral coordinates is loosened to allow rational coordinates. Moreover, we exhibit such a counterexample whose Ehrhart function has period …
The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most $n-d$ edges. This paper presents the first counterexample to the conjecture. Our polytope has dimension 43 and 86 facets. It is obtained from a 5-dimensional polytope with 48 facets which violates a certain generalization of the $d$-step conjecture of Klee and Walkup.
The equivariant Ehrhart theory of polytopes with order-two symmetries: Part II
本文针对具有二阶对称性的6维多面体，构造Stapledon有效性猜想的两个反例，给出基于多面体面的判据缩小反例范围，还回答了Stapledon关于不变线性参数系的问题。
On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture
本文证明 Hirsch 猜想在有界多面体和单调游走情形下的经典反例均不能迁移到回路直径猜想，并通过结构几何分析与全量枚举给出两种验证路径。
Our motivation is the question of how similar the $f$-colouring problem is to the classic edge-colouring problem, particularly with regard to graph parameters. In 2010, Zhang, Yu, and Liu gave a new description of the $f$-matching polytope and derived a formula for the fractional $f$-chromatic index, stating that the fractional $f$-chromatic index equals the maximum of the fractional maximum $f$-degree and the fractional $f$-density. Unfortunately, this formula is incorrect. We present counterexamples for both the description of the $f$-matching polytope and the formula for the fractional $f$-…
We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a given class. We provide examples of cubical polytopes that are not reconstructible from their dual graphs. Furthermore, we show that matroid (base) polytopes are not reconstructible from their graphs and not class reconstructible from their dual graphs; our counterexamples include hypersimplices. Additionally, we prove that matroid polytopes are class reconstr…
Santos' construction of the first known counterexample to the Hirsch conjecture, for bounded polytopes, follows the strategy of first finding a counterexample to the nonrevisiting conjecture. Santos constructs a $5$-dimensional all-but-simple spindle $(P,x,y)$ of length $6$, which is a counterexample to the nonrevisiting conjecture. For simple polytopes, if we had a counterexample to the nonrevisiting conjecture, we would produce the corresponding counterexample to the Hirsch conjecture through repeated wedging, over all the facets not incident to $x$ or $y$. However, Santos $5$-dimensional sp…
Examples and counterexamples in Ehrhart theory
本文综述Ehrhart多项式和$h^*$-多项式系数的不等式，构造反例否定IDP多胞形相关猜想的变体，并首次揭示Ehrhart正性与实根性的联系。
The "topological Tverberg conjecture" by Bárány, Shlosman and Szűcs (1981) states that any continuous map of a simplex of dimension $(r-1)(d+1)$ to $\mathbb{R}^d$ maps points from $r$ disjoint faces of the simplex to the same point in $\mathbb{R}^d$. This was established for affine maps by Tverberg (1966), for the case when $r$ is a prime by Bárány et al., and for prime power $r$ by Özaydin (1987). We combine the generalized van Kampen theorem announced by Mabillard and Wagner (2014) with the constraint method of Blagojević, Ziegler and the author (2014), and thus prove the existence of counte…
A nine-line counterexample to a conjecture on the minimal degree of Jacobian relations
构造两个具有同构交格但雅可比关系最小度不同的九线排列，给出广义Terao猜想的反例。
In 2010 Santos described the construction of a counterexample to the Hirsch conjecture, and in 2012 Santos and Weibel provided the coordinates for the 40 facets of a 20-dimensional counterexample. In this paper we explore technical details of the construction using Santos and Weibel's work as the motivating example. Santos presented the construction in the dual setting. Here we return to the primal setting, in which Santos' construction calls for repeated application of a perturbed wedge operation, a wedge over a facet followed by a perturbation of one or more other facets. We show that the st…
Unimodality shenanigans in Ehrhart theory
本文通过构造矩形棱柱的 Cayley 和，否证了 Stanley、Brenti 及 Ferroni-Higashitani 关于 IDP 多胞体 $h^*$-多项式单峰性与对数凹性的多个猜想，并给出光滑反例。
Stronger counterexamples to the topological Tverberg conjecture
本文提出更强的拓扑Tverberg猜想反例，通过改进方法构造更高维的反例，并基于Mabillard-Wagner定理和Ozaydin定理进行证明。
The positive semidefinite (psd) rank of a polytope is the size of the smallest psd cone that admits an affine slice that projects linearly onto the polytope. The psd rank of a d-polytope is at least d+1, and when equality holds we say that the polytope is psd-minimal. In this paper we develop new tools for the study of psd-minimality and use them to give a complete classification of psd-minimal 4-polytopes. The main tools introduced are trinomial obstructions, a new algebraic obstruction for psd-minimality, and the slack ideal of a polytope, which encodes the space of realizations of a polytop…
We study the description of the crystal structure on the set of Mirković-Vilonen polytopes. Anderson and Mirković defined an operator and conjectured that it coincides with the Kashiwara operator. Kamnitzer proved the conjecture for type A and gave an counterexample for type C_{3}. He also gave an explicit formula to calculate the Kashiwara operator for type A. In this paper we prove that a part of the AM conjecture still holds in general, answering an open question of Kamnitzer (2007). Moreover, we show that although the formula given by Kamnitzer does not hold in general, it is still valid i…
A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a previously disproved conjecture which stated that any Gorenstein lattice polytope has a unimodal $h^\ast$-polynomial. The first counterexamples to unimodality for Gorenstein lattice polytopes were given in even dimensions greater than five by Musta{ţ}{ǎ} and Payne, and this was extended to all dimensions greater than five by Payne. While there exist numerous e…
The purpose of this paper is the formal verification of a counterexample of Santos et al. to the so-called Hirsch Conjecture on the diameter of polytopes (bounded convex polyhedra). In contrast with the pen-and-paper proof, our approach is entirely computational: we implement in Coq and prove correct an algorithm that explicitly computes, within the proof assistant, vertex-edge graphs of polytopes as well as their diameter. The originality of this certificate-based algorithm is to achieve a tradeoff between simplicity and efficiency. Simplicity is crucial in obtaining the proof of correctness …
Consider a variant of the graph diameter of a polyhedron where each step in a walk between two vertices travels maximally in a circuit direction instead of along incident edges. Here circuit directions are non-trivial solutions to minimally-dependent subsystems of the presentation of the polyhedron. These can be understood as the set of all possible edge directions, including edges that may arise from translation of the facets. It is appealing to consider a circuit analogue of the Hirsch conjecture for graph diameter, as suggested by Borgwardt et al. [BFH15]. They ask whether the known counter…
Advancing Geometry with AI: Multi-agent Generation of Polytopes
本文提出一种高度并行的人工智能多智能体系统，用于自动生成高复杂度多面体，并在 Hirsch 猜想、k-neighbourly 问题和最长单调路径问题中生成匹配或超越已知最佳界的新示例，证明 AI 能有效推进几何学中极难问题的研究。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。