Winfried Bruns
We describe the implementation of algebraic polyhedra in Normaliz. In addition to convex hull computation/vertex enumeration, it is possible to compute triangulations, volumes, lattice points, face lattices and automorphism groups. The arithmetic is based on the package e-antic by V.~Delecroix.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A complete classification of the $δ$-vectors of lattice polytopes whose normalized volumes are at most $4$ is known. In the present paper, we will classify all the $δ$-vectors of lattice polytopes with normalized volumes $5$.
We survey the computation of polytope volumes by the algorithms of Normaliz to which the Lawrence algorithm has recently been added. It has enabled us to master volume computations for polytopes from social choice in dimension $119$. This challenge required a sophisticated implementation of the Lawrence algorithm.
The free sum is a basic geometric operation among convex polytopes. This note focuses on the relationship between the normalized volume of the free sum and that of the summands. In particular, we show that the normalized volume of the free sum of full dimensional polytopes is precisely the product of the normalized volumes of the summands.
A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in higher dimensions. In particular, there is only a finite number of quadratic polynomials with fixed leading coefficient being the $h^*$-polynomial of a lattice polytope.
In the frame of a classification of general square systems of polynomial equations solvable by radicals, Esterov and Gusev succeeded in classifying all spanning lattice polytopes whose normalized volumes are at most $4$. In the present paper, we complete to classify all lattice polytopes whose normalized volumes are at most $4$ based on the known classification of their $δ$-polynomials.
A combinatorial polytope $P$ is said to be projectively unique if it has a single realization up to projective transformations. Projective uniqueness is a geometrically compelling property but is difficult to verify. In this paper, we merge two approaches to projective uniqueness in the literature. One is primarily geometric and is due to McMullen, who showed that certain natural operations on polytopes preserve projective uniqueness. The other is more algebraic and is due to Gouveia, Macchia, Thomas, and Wiebe. They use certain ideals associated to a polytope to verify a property called graph…
We discuss the computation of automorphism groups and normal forms of cones and polyhedra in Normaliz, and indicate its implementation via nauty. The types of automorphisms include integral, rational, Euclidean and combinatorial, as well as algebraic for polytopes defined over real algebraic number fields. Examples treated in detail are the icosahedron and linear ordering polytopes whose Euclidean automorphism groups are determined.
A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally): skew Schur polynomials; symmetric polynomials associated to reduced words, Redfield--Polya theory, Witt vectors, and totally nonnegative matrices; resultants; discriminants (up to quartics); Macdonald polynomials; key polynomials; Demazure atoms; Schubert polynomials; and Grothendieck polynomials, among others. Our principal construction is the Schubitope. Fo…
Algebraic Volume for Polytope Arise from Ehrhart Theory
本文基于 Ehrhart 理论将多胞体提升为锥，利用代数组合学技术提出一种仅需符号单纯锥分解的体积算法，并给出全新的原始-对偶方法，解决了现有方法对简单或单纯多胞体不切实际的问题。
Results of Koebe (1936), Schramm (1992), and Springborn (2005) yield realizations of $3$-polytopes with edges tangent to the unit sphere. Here we study the algebraic degrees of such realizations. This initiates the research on constrained realization spaces of polytopes.
We describe how to construct and enumerate Magic squares, Franklin squares, Magic cubes, and Magic graphs as lattice points inside polyhedral cones using techniques from Algebraic Combinatorics. The main tools of our methods are the Hilbert Poincare series to enumerate lattice points and the Hilbert bases to generate lattice points. We define polytopes of magic labelings of graphs and digraphs, and give a description of the faces of the Birkhoff polytope as polytopes of magic labelings of digraphs.
We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope still has the property that each coefficient is the normalized volume of a projection of the original polytope. Furthermore, we show that the new family of lattice-face polytopes contains all possible combinatorial types of rational polytopes.
Algebraic aspects of unconditional lattice polytopes
本文研究了反阻多格点多面体与其关联的无条件格点多面体之间的代数关系，证明了反阻多面体的 торic 圎环正常当且仅当关联的无条件多面体的 toric 圎环正常，并且反阻多面体的 toric 理想由二次二项式生成当且仅当关联的无条件多面体的 toric 理想也由二次二项式生成。
We present 35 open problems on combinatorial, geometric and algebraic aspects of k-orbit abstract polytopes. We also present a theory of rooted polytopes that has appeared implicitly in previous work but has not been formalized before.
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that the number of lattice points can be approximated by an explicitly given polynomial of $t$ depending only on $P$. The error term is related to a simultaneous Diophantine approximation problem for algebraic numbers, as in Schmidt's theorem. The main ingredients of the proof are a Poisson summation formula for general algebraic polytopes, and a representation o…
In this note, we investigate some of the fundamental algebraic and geometric properties of $s$-lecture hall simplices and their generalizations. We show that all $s$-lecture hall order polytopes, which simultaneously generalize $s$-lecture hall simplices and order polytopes, satisfy a property which implies the integer decomposition property. This answers one conjecture of Hibi, Olsen and Tsuchiya. By relating $s$-lecture hall polytopes to alcoved polytopes, we then use this property to show that families of $s$-lecture hall simplices admit a quadratic Gröbner basis with a square-free initial …
Ehrhart quasi-polynomials of almost integral polytopes
本文研究几乎整数多胞体的Ehrhart拟多项式，揭示多胞体形状与拟多项式代数性质的关系，并证明格带状多胞体和中心对称格多胞体可由其有理平移的Ehrhart拟多项式刻画。
Polytopes and posets associated to preorders
本文引入并研究有限集上预序定义的预序多面体，从格点计数角度推广了树形多面体，证明了其作为格多面体的对偶性，给出了归一化体积的组合解释以及Ehrhart多项式和h*多项式的公式。
The degree of a lattice polytope is a notion in Ehrhart theory that was studied quite intensively over the previous years. It is well-known that a lattice polytope has normalized volume one if and only if its degree is zero. Recently, Esterov and Gusev gave a complete classification result of families of $n$ lattice polytopes in $\mathbb{R}^n$ whose mixed volume equals one. Here, we give a reformulation of their result involving the novel notion of a mixed degree that generalizes the degree similar to how the mixed volume generalizes the volume. We discuss and motivate this terminology, and ex…
A convex body is unconditional if it is symmetric with respect to reflections in all coordinate hyperplanes. In this paper, we investigate unconditional lattice polytopes with respect to geometric, combinatorial, and algebraic properties. In particular, we characterize unconditional reflexive polytopes in terms of perfect graphs. As a prime example, we study the signed Birkhoff polytope. Moreover, we derive constructions for Gale-dual pairs of polytopes and we explicitly describe Gröbner bases for unconditional reflexive polytopes coming from partially ordered sets
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit polytopes and semi-algebraic sets when the facet descriptions are intractable. The semi-algebraic sets called curvy zonotopes are introduced and studied using graph limits. From both volume calculations and algebraic descriptions we find several interesting conjectures.
The cut polytope of a graph is an important object in several fields, such as functional analysis, combinatorial optimization, and probability. For example, Sturmfels and Sullivant showed that the toric ideals of cut polytopes are useful in algebraic statistics. In the theory of lattice polytopes, the $h^{*}$-polynomial is one of the most important invariants. The necessary and sufficient condition in terms of graphs that the $h^{*}$-polynomial of a cut polytope is palindromic is known. However, except for trees, there are no classes of graphs for which the $h^{*}$-polynomial of their cut poly…
This note provides a simple proof for the equality between the normalized volume of a convex polytope with $m$ vertices and the mixed volume of $m$ simplices and thus shows the seemingly restrictive problem of computing mixed volume of simplices is still at least as hard as computing volumes of convex polytopes.
We describe the computation of polytope volumes by descent in the face lattice, its implementation in Normaliz, and the connection to reverse-lexicographic triangulations. The efficiency of the algorithm is demonstrated by several high dimensional polytopes of different characteristics. Finally, we present an application to voting theory where polytope volumes appear as probabilities of certain paradoxa.
Newton numbers, vanishing polytopes and algebraic degrees
本文分类了具有消失Newton数的便利Newton多面体为$B_k$-多面体，部分解决了Arnold单调性问题，并推广Newton数至$\ell$-与$e$-Newton数，后者计算代数次数并刻画对偶缺陷集。
Extended formulations are an important tool to obtain small (even compact) formulations of polytopes by representing them as projections of higher dimensional ones. It is an important question whether a polytope admits a small extended formulation, i.e., one involving only a polynomial number of inequalities in its dimension. For the case of symmetric extended formulations (i.e., preserving the symmetries of the polytope) Yannakakis established a powerful technique to derive lower bounds and rule out small formulations. We rephrase the technique of Yannakakis in a group-theoretic framework. Th…
Sums of Weighted Lattice Points of Polytopes
本文研究由 Ehrhart 拟多项式加权的多面体格点计数问题，提出将加权和转化为不加权和的新方法，可应用于计算积分、最大值及发现代数组合与数论中的新恒等式。
Intersection Bodies of Polytopes
本文利用组合学和实代数几何工具研究凸多胞形的交集体，证明其为半代数集，提出计算算法，并计算代数边界的不可约分量及其度数上界。
We prove that every polytope described by algebraic coordinates is the face of a projectively unique polytope. This provides a universality property for projectively unique polytopes. Using a closely related result of Below, we construct a combinatorial type of 5-dimensional polytope that is not realizable as a subpolytope of any stacked polytope. This disproves a classical conjecture in polytope theory, first formulated by Shephard in the seventies.
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent interest, the confluence of these properties is a source of active investigation due to conjectures regarding the unimodality of the $h^\ast$-polynomial. In this paper, we consider the Newton polytopes arising from two families of polynomials in algebraic combinatorics: Schur polynomials and inflated symmetric Grothendieck polynomials. In both cases, we prove tha…
Kazhdan-Lusztig-Stanley polynomials are a combinatorial generalization of Kazhdan-Lusztig polynomials of for Coxeter groups that include g-polynomials of polytopes and Kazhdan-Lusztig polynomials of matroids. In the cases of Weyl groups, rational polytopes, and realizable matroids, one can count points over finite fields on flag varieties, toric varieties, or reciprocal planes to obtain cohomological interpretations of these polynomials. We survey these results and unite them under a single geometric framework.
Let P be a lattice polytope with $h^*$-vector $(1, h^*_1, h^*_2)$. In this note we show that if $h_2^* \leq h_1^*$, then $P$ is IDP. More generally, we show the corresponding statements for semi-standard graded Cohen-Macaulay domains over algebraically closed fields.
Ternary relations and their polytopes
本文从组合学视角统一了 Graev 三元关系多面体与宇宙学多面体两种理论，并关联了爱因斯坦度量计数问题。
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 …
Ewald's Conjecture and integer points in algebraic and symplectic toric geometry
本文解决了几何中关于多面体整数点的开放问题，首次证明了埃瓦尔德猜想的广义情况，并探讨了辛格几何中轨道位移问题，同时证明了尼尔猜想在二维和高维情况下的结论。
Asymptotics of quantized barycenters of lattice polytopes with applications to algebraic geometry
本文研究凸格点多面体量化重心序列的渐近展开问题，证明其存在性并确定前两项，针对Delzant多面体和自反多面体给出具体结果，应用于环面簇Fujita–Odaka阈值的渐近分析，解决相关Tian稳定化问题并统一前人结果。
For an integral convex polytope $\Pc \subset \RR^N$ of dimension $d$, we call $δ(\Pc)=(δ_0, δ_1,..., δ_d)$ the $δ$-vector of $\Pc$ and $\vol(\Pc)=\sum_{i=0}^dδ_i$ its normalized volume. In this paper, we will establish the new equalities and inequalities on $δ$-vectors for integral simplices whose normalized volumes are prime. Moreover, by using those, we will classify all the possible $δ$-vectors of integral simplices with normalized volume 5 and 7.
This paper presents an algebraic construction of Euler-Maclaurin formulas for polytopes. The formulas obtained generalize and unite the previous lattice point formulas of Morelli and Pommersheim-Thomas, and the Euler-Maclaurin formulas of Berline-Vergne While the approach of this paper originates in the theory of toric varieties, and recovers previous results about characteristic classes of toric varieties, the present paper is self-contained and does not rely on results from toric geometry. We aim in particular to exhibit in a combinatorial way ingredients such as such Todd classes and cycle-…
The Chow polytope of an algebraic cycle in a torus depends only on its tropicalisation. Generalising this, we associate a Chow polytope to any abstract tropical variety in a tropicalised toric variety. Several significant polyhedra associated to tropical varieties are special cases of our Chow polytope. The Chow polytope of a tropical variety $X$ is given by a simple combinatorial construction: its normal subdivision is the Minkowski sum of $X$ and a reflected skeleton of the fan of the ambient toric variety.
Let $Φ$ be a finite crystallographic irreducible root system and $\mathcal P_Φ$ be the convex hull of the roots in $Φ$. We give a uniform explicit description of the polytope $\mathcal P_Φ$, analyze the algebraic-combinatorial structure of its faces, and provide connections with the Borel subalgebra of the associated Lie algebra. We also give several enumerative results.
The random beta polytope is defined as the convex hull of $n$ independent random points with the density proportional to $(1-\|x\|^2)^β$ on the $d$-dimensional unit ball, where $β>-1$ is a parameter. Similarly, the random beta' polytope is defined as the convex hull of $n$ independent random points with the density proportional to $(1+\|x\|^2)^{-β}$ on $\mathbb R^d$, where $β>\frac d2$. In a previous work [Angles of random simplices and face numbers of random polytopes, Adv. Math., 380 (2021), 107612], we established exact and explicit formulae for the expected $f$-vectors of these random poly…
Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the orignial polytope are hereditary to its subpolytopes obtained by a cut. In this work, we put our attention to all the seperating hyperplanes for some given polytope (integral and convex) and study the existence and classification of such hyperplanes. We prove the exitence of seperating hyperplanes for the order and chain polytopes for any finite posets that are not a single chain; prove there are no such…
Halfspace Representations of Path Polytopes of Trees
本文针对树的路径多面体，利用环面纤维积归纳构造了其最小半空间表示，为多面体几何及相关领域提供了新工具。
The Ehrhart quasi-polynomial of a rational polytope $P$ is a fundamental invariant counting lattice points in integer dilates of $P$. The quasi-period of this quasi-polynomial divides the denominator of $P$ but is not always equal to it: this situation is called quasi-period collapse. Polytopes experiencing quasi-period collapse appear widely across algebra and geometry, and yet the phenomenon remains largely mysterious. Using techniques from algebraic geometry - specifically the $\mathbb{Q}$-Gorenstein deformation theory of orbifold del Pezzo surfaces - we explain quasi-period collapse for ra…
Grothendieck rings of polytopes and non-archimedean semi-algebraic sets
本文通过显式描述 Grothendieck 群，证明了 $Γ$-有理多面体在两类仿射变换下的分类等价性，肯定回答了 Hrushovski 和 Kazhdan 的基本问题，并给出了非阿基米德半代数集动机体积核的简单描述。
We present an algorithm for the classification of triples of lattice polytopes with a given mixed volume $m$ in dimension 3. It is known that the classification can be reduced to the enumeration of so-called irreducible triples, the number of which is finite for fixed $m$. Following this algorithm, we enumerate all irreducible triples of normalized mixed volume up to 4 that are inclusion-maximal. This produces a classification of generic trivariate sparse polynomial systems with up to 4 solutions in the complex torus, up to monomial changes of variables. By a recent result of Esterov, this lea…
On Certain Polytopes Associated to Products of Algebraic Integer Conjugates
本文研究代数整数共轭元乘积不等式所定义的多胞体，显式刻画其顶点结构，并证明在 d>3k 时对非单位根代数整数成立严格不等式，同时给出定量版本。
We prove that the set of functions representable by ReLU neural networks with integer weights strictly increases with the network depth while allowing arbitrary width. More precisely, we show that $\lceil\log_2(n)\rceil$ hidden layers are indeed necessary to compute the maximum of $n$ numbers, matching known upper bounds. Our results are based on the known duality between neural networks and Newton polytopes via tropical geometry. The integrality assumption implies that these Newton polytopes are lattice polytopes. Then, our depth lower bounds follow from a parity argument on the normalized vo…
We use the notions of reflexivity and of reflexive dimensions in order to introduce probability measures for lattice polytopes and initiate the investigation of their statistical properties. Examples of applications to discrete geometry include a study of randomness of self-duality of reflexive polytopes and implications for expectation values of the numbers of such polytopes in higher dimensions. We also discuss enumeration problems and related algorithms and point out interesting open problems. In this context we define the notion of IP-confined polytopes. Our new results include the list of…
We describe several experimental results obtained in four candidates social choice elections. These include the Condorcet and Borda paradoxes, as well as the Condorcet efficiency of plurality voting with runoff. The computations are done by Normaliz. It finds precise probabilities as volumes of polytopes and counting functions encoded as Ehrhart series of polytopes.
From affine to barycentric coordinates in polytopes
本文提出一种基于仿射空间和凸集代数处理及重心代数的方法，通过将有限维凸多胞体分解为同维单纯形并集，在多胞体中生成稀疏重心坐标。
Euler Maclaurin formulas for a polytope express the sum of the values of a function over the lattice points in the polytope in terms of integrals of the function and its derivatives over faces of the polytope or its expansions. Exact Euler Maclaurin formulas [Khovanskii-Pukhlikov, Cappell-Shaneson, Guillemin, Brion-Vergne] apply to exponential or polynomial functions; Euler Maclaurin formulas with remainder [Karshon-Sternberg-Weitsman] apply to more general smooth functions. In this paper we review these results and present proofs of the exact formulas obtained by these authors, using elementa…
A generalization of incidence relations in abstract polytope has been explored, and parameterized surfaces are used as primers. The abstract orientable incidence structure is defined as an algebraic model of incidence relations, in which some algebraic properties in abtract polytope theory are generalized. The geometric interpretation of abstract orientable incidence structure are also discussed. The orientable incidence structure in a semi-regular normal CW complex are briefly investigated.
To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way of geometry and vice versa. Malvenuto and Reutenauer (2011) introduced 'double posets', that is, (finite) sets equipped with two partial orders, as a generalization of Stanley's labelled posets. Many combinatorial constructions can be naturally phrased in terms of double posets. We introduce the 'double order polytope' and the 'double chain polytope' and we …
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 nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby, in amenable cases, nonvanishing is in the complexity class $NP\cap coNP$ of problems with "good characterizations". This suggests a new algebraic combinatorics viewpoint on complexity theory. This report discusses the case of Schubert polynomials. These form a basis of all polynomials and appear in the study of cohomology rings of flag manifolds. We give a …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。