Winfried Bruns, Joseph Gubeladze
Let P be a d-dimensional lattice polytope. We show that there exists a natural number c_d, only depending on d, such that the multiples cP have a unimodular cover for every natural number c >= c_d. Actually, a subexponential upper bound for c_d is provided, together with an analogous result for unimodular covers of rational cones.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The problem when the order polytope and the chain polytope of a finite partially ordered set are unimodularly equivalent will be solved.
In this paper we give several criteria for the edge polytope of a fundamental FHM-graph to possess a regular unimodular triangulation in terms of some simple data of the the graph. We further apply our criteria to several examples of graphs and show that their edge polytopes possess a regular unimodular triangulation.
An integral polytope is a polytope whose vertices have integer coordinates. A unimodular triangulation of an integral polytope in $\mathbb{R}^d$ is a triangulation in which all simplices are integral with volume $1/d!$. A classic result of Knudsen, Mumford, and Waterman states that for every integral polytope $P$, there exists a positive integer $c$ such that $cP$ has a unimodular triangulation. We strengthen this result by showing that for every integral polytope $P$, there exists $c$ such that for every positive integer $c' \ge c$, $c'P$ admits a unimodular triangulation. This answers a long…
Ehrhart polynomials are extensively-studied structures that interpolate the discrete volume of the dilations of integral $n$-polytopes. The coefficients of Ehrhart polynomials, however, are still not fully understood, and it is not known when two polytopes have equivalent Ehrhart polynomials. In this paper, we establish a relationship between Ehrhart-equivalence and other forms of equivalence: the $\operatorname{GL}_n(\mathbb{Z})$-equidecomposability and unimodular equivalence of two integral $n$-polytopes in $\mathbb{R}^n$. We conjecture that any two Ehrhart-equivalent integral $n$-polytopes …
Unimodular Smooth Fano Polytopes and their Relation with Ewald Conditions
本文引入幺模光滑 Fano 多面体（USFP），证明其满足三种 Ewald 条件，并利用 Seymour 分解定理给出刻画，同时将深度单调多面体的对偶性质推广到 USFP。
A Regular Unimodular Triangulation of the Matroid Base Polytope
本文构造了任意拟阵基多面体的首个正则幺模三角剖分，并将其推广至整广义置换多面体，解决了此前幺模覆盖存在性未知的问题。
Unimodular polytopes and column number bounds on polytopal totally unimodular matrices via Seymour's decomposition theorem
本文通过塞缪尔分解定理证明了完全单模矩阵列数的精确上界，该结果改进了赫勒的经典界，并展示了单模多面体与顶点构成仿射格基的性质相关联。
A seminal result in the theory of toric varieties, due to Knudsen, Mumford and Waterman (1973), asserts that for every lattice polytope $P$ there is a positive integer $k$ such that the dilated polytope $kP$ has a unimodular triangulation. In dimension 3, Kantor and Sarkaria (2003) have shown that $k=4$ works for every polytope. But this does not imply that every $k>4$ works as well. We here study the values of $k$ for which the result holds showing that: 1. It contains all composite numbers. 2. It is an additive semigroup. These two properties imply that the only values of $k$ that may not wo…
The Birkhoff polytope, defined to be the convex hull of $n\times n$ permutation matrices, is a well studied polytope in the context of the Ehrhart theory. This polytope is known to have many desirable properties, such as the Gorenstein property and existence of regular, unimodular triangulations. In this paper, we study analogues of the Birkhoff polytope for finite irreducible Coxeter groups of other types. We focus on a type-$B$ Birkhoff polytope $\mathcal{BB}(n)$ arising from signed permutation matrices and prove that it and its dual polytope are reflexive, and hence Gorenstein, and also pos…
Oda's conjecture for reflexive polytopes: some special cases
本文在若干特殊条件下证明了自反多胞体的Oda猜想，包括单纯自反多胞体与含原点的格多胞体满足特定顶点和格点条件的情形，以及面幺模多胞体和几乎余幺模自反多胞体对的情形。
Unimodular triangulations of lattice polytopes arise in algebraic geometry, commutative algebra, integer programming and, of course, combinatorics. In this article, we review several classes of polytopes that do have unimodular triangulations and constructions that preserve their existence. We include, in particular, the first effective proof of the classical result by Knudsen-Mumford-Waterman stating that every lattice polytope has a dilation that admits a unimodular triangulation. Our proof yields an explicit (although doubly exponential) bound for the dilation factor.
We analyze marked poset polytopes and generalize a result due to Hibi and Li, answering whether the marked chain polytope is unimodular equivalent to the marked order polytope. Both polytopes appear naturally in the representation theory of semi-simple Lie algebras, and hence we can give a necessary and sufficient condition on the marked poset such that the associated toric degenerations of the corresponding partial flag variety are isomorphic. We further show that the set of lattice points in such a marked poset polytope is the Minkowski sum of sets of lattice points for 0-1 polytopes. Moreov…
Equatorial Flow Triangulations of Gorenstein Flow Polytopes
本文应用Bruns和Römer的赤道三角剖分技术，给出Gorenstein流多面体未被研究的三角剖分的纯组合描述，证明其与框架法所得三角剖分不同，还找到投影自反多面体的面描述，并在强平面偏序集下生成序多面体新幺模三角剖分。
If $P$ is a lattice polytope (that is, the convex hull of a finite set of lattice points in $\mathbf{R}^n$), then every sum of $h$ lattice points in $P$ is a lattice point in the $h$-fold sumset $hP$. However, a lattice point in the $h$-fold sumset $hP$ is not necessarily the sum of $h$ lattice points in $P$. It is proved that if the polytope $P$ is a union of unimodular simplices, then every lattice point in the $h$-fold sumset $hP$ is the sum of $h$ lattice points in $P$.
Unimodular covers of 3-dimensional parallelepipeds and Cayley sums
本文证明了三维空间中平行六面体、中心对称多胞体及特定Cayley和类具有幺模覆盖，改进了先前IDP结果。
Log-concavity and Approximate Counting for Totally Unimodular Polytopes
本文提出全幺模多胞体格点数的下界，基于Gurvits容量优化，实现近似计数算法，并证明相关猜想。
Most $(0,1)$-polytopes are not normal
该研究证明随维度增大，$d$维$(0,1)$-多面体的正规类比例以双指数速率趋于零，分类低维多面体并找到首个具旗帜幺模三角剖分但环面环非Koszul的多面体，还给出非正规的δ-拟阵多面体示例。
A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete enumeration of such equivalence classes for arbitrary constants d and K. The algorithm, which gives another proof of the finiteness result, is implemented for small values of K, up to dimension six. The resulting database contains and extends several existing ones, and has been used to correct mistakes in other classifications. When specialized to three-dimensional s…
Reflexive polytopes have been studied from viewpoints of combinatorics, commutative algebra and algebraic geometry. A nef-partition of a reflexive polytope $\mathcal{P}$ is a decomposition $\mathcal{P}=\mathcal{P}_1+\cdots+\mathcal{P}_r$ such that each $\mathcal{P}_i$ is a lattice polytope containing the origin. Batyrev and van Straten gave a combinatorial method for explicit constructions of mirror pairs of Calabi-Yau complete intersections obtained from nef-partitions. In the present paper, by means of Gröbner basis techniques, we give a large family of nef-partitions arising from unimodular…
We present a geometric approach towards derandomizing the Isolation Lemma by Mulmuley, Vazirani, and Vazirani. In particular, our approach produces a quasi-polynomial family of weights, where each weight is an integer and quasi-polynomially bounded, that can isolate a vertex in any 0/1 polytope for which each face lies in an affine space defined by a totally unimodular matrix. This includes the polytopes given by totally unimodular constraints and generalizes the recent derandomization of the Isolation Lemma for bipartite perfect matching and matroid intersection. We prove our result by associ…
A lattice polytope $\mathcal{P}$ is called reflexive if its dual $\mathcal{P}^\vee$ is a lattice polytope. The property that $\mathcal{P}$ is unimodularly equivalent to $\mathcal{P}^\vee$ does not hold in general, and in fact there are few examples of such polytopes. In this note, we introduce a new reflexive simplex $Q_n$ which has this property. Additionally, we show that $δ$-polynomalial of $Q_n$ is the Eulerian polynomial and show the existence of a regular, flag, unimodular triangulation.
We show that: (1) unimodular simplices in a lattice 3-polytope cover a neighborhood of the boundary of the polytope if and only if the polytope is very ample, (2) the convex hull of lattice points in every ellipsoid in R^3 has a unimodular cover, and (3) for every d at least 5, there are ellipsoids in R^d, such that the convex hulls of the lattice points in these ellipsoids are not even normal. Part (3) answers a question of Bruns, Michalek, and the author.
Self-Reachable Configuration Polytopes for Trees
该研究聚焦树T上自可达芯片构形对应的格点多胞体，证明其具备整数分解性质并刻画顶点集，还证实最少芯片数的自可达构形对应的多胞体与单位立方体幺模等价。
We classify the three-dimensional lattice polytopes with two interior lattice points. Up to unimodular equivalence there are 22,673,449 such polytopes. This classification allows us to verify, for this case only, a conjectural upper bound for the volume of a lattice polytope with interior points, and provides strong evidence for new conjectural inequalities on the coefficients of the Ehrhart polynomial in dimension three.
Let $Φ$ be an irreducible crystallographic root system and $\mathcal P$ its root polytope, i.e., its convex hull. We provide a uniform construction, for all root types, of a triangulation of the facets of $\mathcal P$. We also prove that, on each orbit of facets under the action of the Weyl gruop, the triangulation is unimodular with respect to a root sublattice that depends on the orbit.
It has been shown by Soprunov that the normalized mixed volume (minus one) of an $n$-tuple of $n$-dimensional lattice polytopes is a lower bound for the number of interior lattice points in the Minkowski sum of the polytopes. He defined $n$-tuples of mixed degree at most one to be exactly those for which this lower bound is attained with equality, and posed the problem of a classification of such tuples. We give a finiteness result regarding this problem in general dimension $n \geq 4$, showing that all but finitely many $n$-tuples of mixed degree at most one admit a common lattice projection …
We show that if two lattice $3$-polytopes $P$ and $P'$ have the same Ehrhart function then they are $\operatorname{GL}_3({\mathbb Z})$-equidecomposable; that is, they can be partitioned into relatively open simplices $U_1,\dots, U_k$ and $U'_1,\dots,U'_k$ such that $U_i$ and $U'_i$ are unimodularly equivalent, for each $i$.
Motivated by the problem of bounding the number of rays of plane tropical curves we study the following question: Given $n\in\mathbb{N}$ and a unimodular $2$-simplex $Δ$ what is the maximal number of vertices a lattice polytope contained in $n\cdot Δ$ can have? We determine this number for an infinite subset of $\mathbb{N}$ by providing a family of vertex-maximal polytopes and give bounds for the other cases.
Regular dyadic triangulations of delta-matroid polytopes
本文证明每个delta-拟阵多面体（及更一般的整B型广义置换多面体）存在正则二进三角剖分，其最大单纯形体积为2的幂，并指出B型中唯一非幺模单纯形例外，基于B型根配置的完全二进性。
A lattice polytope $\mathcal{P} \subset \mathbb{R}^d$ is called a locally anti-blocking polytope if for any closed orthant $\mathbb{R}^d_{\varepsilon}$ in $\mathbb{R}^d$, $\mathcal{P} \cap \mathbb{R}^d_{\varepsilon}$ is unimodularly equivalent to an anti-blocking polytope by reflections of coordinate hyperplanes. In the present paper, we give a formula for the $h^*$-polynomials of locally anti-blocking lattice polytopes. In particular, we discuss the $γ$-positivity of the $h^*$-polynomials of locally anti-blocking reflexive polytopes.
Let $P$ be an arbitrary finite partially ordered set. It will be proved that the number of edges of the order polytope ${\mathcal O}(P)$ is equal to that of the chain polytope ${\mathcal C}(P)$. Furthermore, it will be shown that the degree sequence of the finite simple graph which is the $1$-skeleton of ${\mathcal O}(P)$ is equal to that of ${\mathcal C}(P)$ if and only if ${\mathcal O}(P)$ and ${\mathcal C}(P)$ are unimodularly equivalent.
Boundary $h^\ast$-vectors and unimodular triangulations
本文通过正则单模三角剖分和 toric 理想的 Gröbner 衰减研究了格点多面体边界上的 $h^\ast$-多项式，推导了边界 $h^\ast$-多项式与正则单模三角剖分 $h$-多项式的关系，并建立了德恩-索默维尔型关系。
Given two families $X$ and $Y$ of integral polytopes with nice combinatorial and algebraic properties, a natural way to generate new class of polytopes is to take the intersection $\mathcal{P}=\mathcal{P}_1\cap\mathcal{P}_2$, where $\mathcal{P}_1\in X$, $\mathcal{P}_2\in Y$. Two basic questions then arise: 1) when $\mathcal{P}$ is integral and 2) whether $\mathcal{P}$ inherits the "old type" from $\mathcal{P}_1, \mathcal{P}_2$ or has a "new type", that is, whether $\mathcal{P}$ is unimodularly equivalent to some polytope in $X\cup Y$ or not. In this paper, we focus on the families of order pol…
The scissors congruence conjecture for the unimodular group is an analogue of Hilbert's third problem, for the equidecomposability of polytopes. Liu and Osserman studied the Ehrhart quasi-polynomials of polytopes naturally associated to graphs whose vertices have degree one or three. In this paper, we prove the scissors congruence conjecture, posed by Haase and McAllister, for this class of polytopes. The key ingredient in the proofs is the nearest neighbor interchange on graphs and a naturally arising piecewise unimodular transformation.
In 1997 Oda conjectured that every smooth lattice polytope has the integer decomposition property. We prove Oda's conjecture for centrally symmetric $3$-dimensional polytopes, by showing they are covered by lattice parallelepipeds and unimodular simplices.
We completely classify non-spanning $3$-polytopes, by which we mean lattice $3$-polytopes whose lattice points do not affinely span the lattice. We show that, except for six small polytopes (all having between five and eight lattice points), every non-spanning $3$-polytope $P$ has the following simple description: $P\cap \mathbb{Z}^3$ consists of either (1) two lattice segments lying in parallel and consecutive lattice planes or (2) a lattice segment together with three or four extra lattice points placed in a very specific manner. From this description we conclude that all the empty tetrahedr…
Ehrhart Theory of the Join of Two Lattice Polytopes
受两个格点多面体笛卡尔积研究的启发，本文研究两个格点多面体联合的Ehrhart理论，解决了美国数学研究所网站上的一个著名开放问题。
Two-Dimensional Faces of Order and Chain Polytopes
该研究明确了偏序集P的序多面体与链多面体的二维面的组合描述，证明链多面体的正方形面数与序多面体相等、三角形面数不少于序多面体，且除二者幺模等价外该不等式严格成立，验证了Hibi和Li猜想的i=2情形。
A theorem of Howe states that every 3-dimensional lattice polytope $P$ whose only lattice points are its vertices, is a Cayley polytope, i.e. $P$ is the convex hull of two lattice polygons with distance one. We want to generalize this result by classifying 3-dimensional lattice polytopes without interior lattice points. The main result will be, that they are up to finite many exceptions either Cayley polytopes or there is a projection, which maps the polytope to the double unimodular 2-simplex. To every such polytope we associate a smooth projective surface of genus 0.
We show that the Ehrhart h-vector of an integer Gorenstein polytope with a regular unimodular triangulation satisfies McMullen's g-theorem; in particular, it is unimodal. This result generalizes a recent theorem of Athanasiadis (conjectured by Stanley) for compressed polytopes. It is derived from a more general theorem on Gorenstein affine normal monoids M: one can factor K[M] (K a field) by a "long" regular sequence in such a way that the quotient is still a normal affine monoid algebra. This technique reduces all questions about the Ehrhart h-vector of P to the Ehrhart h-vector of a Gorenste…
It is proved that all vertex cover algebras of a hypergraph are standard graded if and only if the hypergraph is unimodular. This has interesting consequences on the symbolic powers of monomial ideals.
For any lattice polytope $P$, we consider an associated polynomial $\barδ_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known inequalities satisfied by the coefficients of the Ehrhart $δ$-vector of a lattice polytope. We also provide combinatorial proofs of two results of Stanley that were previously established using techniques from commutative algebra. Finally, we give a necessary numerical criterion for the existence of a regular unimodular lattice triangulation of the boundary of a lattice poly…
We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d-1)-dimensional lattice polytope without interior lattice points. This was conjectured by Treutlein. As an immediate corollary, we get a short proof of a recent result of Averkov, Wagner and Weismantel, namely the finiteness of the number of maximal lattice polytopes without interior lattice points. Moreover, we show that in dimension four and higher some of these finitely many polytopes are not maximal as convex …
Central limit theorems for high dimensional lattice polytopes: cosmological polytopes
本文研究由Erdős–Rényi随机图诱导的宇宙学多面体在高维区域中的几何特征，推导边数和单模三角剖分边数的期望与方差的渐近公式，并证明量化中心极限定理。
Ehrhart Properties under Operations on Lattice Polytopes
本文研究格多胞体上八种运算（如笛卡尔积、闵可夫斯基和等）对三类Ehrhart性质（系数正性、$h^*$-多项式系数性质、几何性质）的保持性，通过建立保持定理或构造反例，并探讨非保持情形下的充分或等价条件。
The convex hull of the roots of a classical root lattice is called a root polytope. We determine explicit unimodular triangulations of the boundaries of the root polytopes associated to the root lattices A_n, C_n, and D_n, and compute their f-and h-vectors. This leads us to recover formulae for the growth series of these root lattices, which were first conjectured by Conway-Mallows-Sloane and Baake-Grimm and proved by Conway-Sloane and Bacher-de la Harpe-Venkov.
Let $\H$ be a unimodular hypergraph over the vertex set $[n]$ and let $J(\H)$ be the cover ideal of $\H$ in the polynomial ring $R=K[x_1,\ldots,x_n]$. We show that $\reg J(\H)^s$ is a linear function in $s$ for all $s\geqslant r\left\lceil \frac{n}{2}\right\rceil+1$ where $r$ is the rank of $\H$. Moreover for every $i$, $a_i(R/J(\H)^s)$ is also a linear function in $s$ for $s \geqslant n^2$.
V-numbers of powers of cover ideals of unimodular hypergraphs
该研究证明了单模超图覆盖理想幂的局部v数、特定范围的全局v数，以及任意树覆盖理想幂的全局v数均随幂次t呈线性变化。
Central limit theorems for high dimensional lattice polytopes: symmetric edge polytopes
本文研究了由Erdős--Rényi随机图生成的高维对称边多面体，推导了其边数和单模三角剖分边数的中心极限定理，并揭示了主导方差项抵消导致的非典型波动机制。
In this paper we motivate some new directions of research regarding the lattice width of convex bodies. We show that convex bodies of sufficiently large width contain a unimodular copy of a standard simplex. This implies that every lattice polytope contains a minimal generating set of the affine lattice spanned by its lattice points such that the number of generators is bounded by a constant which only depends on the dimension. We also discuss relations to recent results on spanning lattice polytopes and how our results could be viewed as the beginning of the study of generalized flatness cons…
Lattice Path Delta Matroids
本文研究格路拟阵的 $C_n$ 型推广，即沿主对角线对称的格路 delta 拟阵，描述其组合运算并证明其可行多面体可分解为具有单模三角剖分的特殊多面体，体积与特定上升集的排列比例相关。
Inequalities for $f^*$-vectors of Lattice Polytopes
本文研究了格多面体 $f^*$-向量的系数不等式，揭示了其与单纯多面体 $f$-向量不等式的相似性，并证明了特定多面体族的单峰性及 $h^*$-向量相同条件下的单峰 $f^*$-向量存在性。
Let $X$ be a list of vectors that is totally unimodular. In a previous article the author proved that every real-valued function on the set of interior lattice points of the zonotope defined by $X$ can be extended to a function on the whole zonotope of the form $p(D)B_X$ in a unique way, where $p(D)$ is a differential operator that is contained in the so-called internal $\Pcal$-space. In this paper we construct an explicit solution to this interpolation problem in terms of Todd operators. As a corollary we obtain a slight generalisation of the Khovanskii-Pukhlikov formula that relates the volu…
Polytopality criteria for the mix of polytopes and maniplexes
本文研究了两个流形混合的多面体性问题，提出了一般性准则以判断混合是否为多面体，并推广了此前已知的多个多面体性准则。
We prove that any finite, abstract n-polytope is covered by a finite, abstract regular n-polytope.
The mixing operation for abstract polytopes gives a natural way to construct the minimal common cover of two polytopes. In this paper, we apply this construction to the regular convex polytopes, determining when the mix is again a polytope, and completely determining the structure of the mix in each case.
Stanley introduced a lattice polytope $\mathcal{C}_P$ arising from a finite poset $P$, which is called the chain polytope of $P$. The geometric structure of $\mathcal{C}_P$ has good relations with the combinatorial structure of $P$. In particular, the Ehrhart polynomial of $\mathcal{C}_P$ is given by the order polynomial of $P$. In the present paper, associated to $P$, we introduce a lattice polytope $\mathcal{E}_{P}$, which is called the enriched chain polytope of $P$, and investigate geometric and combinatorial properties of this polytope. By virtue of the algebraic technique on Gröbner base…
The coordination sequence of a lattice $Ł$ encodes the word-length function with respect to $M$, a set that generates $Ł$ as a monoid. We investigate the coordination sequence of the cyclotomic lattice $Ł= \Z[ζ_m]$, where $ζ_m$ is a primitive $mþ$ root of unity and where $M$ is the set of all $mþ$ roots of unity. We prove several conjectures by Parker regarding the structure of the rational generating function of the coordination sequence; this structure depends on the prime factorization of $m$. Our methods are based on unimodular triangulations of the $mþ$ cyclotomic polytope, the convex hul…
A $d$-dimensional closed convex set $K$ in $\mathbb{R}^d$ is said to be lattice-free if the interior of $K$ is disjoint with $\mathbb{Z}^d$. We consider the following two families of lattice-free polytopes: the family $\mathcal{L}^d$ of integral lattice-free polytopes in $\mathbb{R}^d$ that are not properly contained in another integral lattice-free polytope and its subfamily $\mathcal{M}^d$ consisting of integral lattice-free polytopes in $\mathbb{R}^d$ which are not properly contained in another lattice-free set. It is known that $\mathcal{M}^d = \mathcal{L}^d$ holds for $d \le 3$ and, for e…
Alternating adjacent-sum polytopes: transfer matrices and Ehrhart series
研究一类周期为二的相邻和格多面体，通过转移矩阵等方法分析其格点数、生成函数等性质，包括奇偶分裂、递归关系等，还推导相关函数及恒等式，探讨了戈伦斯坦性质在不同\(s\)值下的情况。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。