A combinatorial study of multiple $q$-integrals is developed. This includes a $q$-volume of a convex polytope, which depends upon the order of $q$-integration. A multiple $q$-integral over an order polytope of a poset is interpreted as a generating function of linear extensions of the poset. Specific modifications of posets are shown to give predictable changes in $q$-integrals over their respective order polytopes. This method is used to combinatorially evaluate some generalized $q$-beta integrals. One such application is a combinatorial interpretation of a $q$-Selberg integral. New generating functions for generalized Gelfand-Tsetlin patterns and reverse plane partitions are established. A $q$-analogue to a well known result in Ehrhart theory is generalized using $q$-volumes and $q$-Ehrhart polynomials.
We present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes with small integer vertices, particularly 0/1 polytopes and half-integral polytopes.
The Euler--Maclaurin (EM) summation formula is used in many theoretical studies and numerical calculations. It approximates the sum $\sum_{k=0}^{n-1} f(k)$ of values of a function $f$ by a linear combination of a corresponding integral of $f$ and values of its higher-order derivatives $f^{(j)}$. An alternative (Alt) summation formula was recently presented by the author, which approximates the sum by a linear combination of integrals only, without using high-order derivatives of $f$. It was shown that the Alt formula will in most cases outperform, or greatly outperform, the EM formula in terms…
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 …
In the present paper, we give some sufficient conditions for $\operatorname{Cl}(\Bbbk[P])$ to be torsionfree, where $\operatorname{Cl}(\Bbbk[P])$ denote the divisor class group of the toric ring $\Bbbk[P]$ of an integral polytope $P$. We prove that $\operatorname{Cl}(\Bbbk[P])$ is torsionfree if $P$ is compressed, and $\operatorname{Cl}(\Bbbk[P])$ is torsionfree if $P$ is a $(0,1)$-polytope which has at most $\dim P+2$ facets. Moreover, we characterize the toric rings of $(0,1)$-polytopes in the case $\operatorname{Cl}(\Bbbk[P])\cong \mathbb{Z}$.
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…
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…
Circuits play a fundamental role in the theory of linear programming due to their intimate connection to algorithms of combinatorial optimization and the efficiency of the simplex method. We are interested in better understanding the properties of circuit walks in integral polyhedra. In this paper, we introduce a hierarchy for integral polyhedra based on different types of behavior exhibited by their circuit walks. Many problems in combinatorial optimization fall into the most interesting categories of this hierarchy - steps of circuit walks only stop at integer points, at vertices, or follow …
In this paper we show that the diameter of a d-dimensional lattice polytope in [0,k]^n is at most (k - 1/2) d. This result implies that the diameter of a d-dimensional half-integral polytope is at most 3/2 d. We also show that for half-integral polytopes the latter bound is tight for any d.
Fano and Reflexive Polytopes from Feynman Integrals
Institut de Physique Théorique, Université Paris-Saclay, CEA, CNRS（理论物理研究所，巴黎萨克雷大学，法国原子能和替代能源委员会，法国国家科学研究中心）；Department of Physics and Astronomy, Ghent University（根特大学物理与天文学系）
Freie Universität Berlin（柏林自由大学）；London School of Economics and Political Science（伦敦政治经济学院）；University of Twente（特文特大学）
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…
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…
Following the seminal work of Padberg on the Boolean quadric polytope $BQP$ and its LP relaxation $BQP_{LP}$, we consider a natural extension: $SATP$ and $SATP_{LP}$ polytopes, with $BQP_{LP}$ being projection of the $SATP_{LP}$ face (and $BQP$ -- projection of the $SATP$ face). We consider a problem of integer recognition: determine whether a maximum of a linear objective function is achieved at an integral vertex of a polytope. Various special instances of 3-SAT problem like NAE-3-SAT, 1-in-3-SAT, weighted MAX-3-SAT, and others can be solved by integer recognition over $SATP_{LP}$. We descri…
Ehrhart discovered that the function that counts the number of lattice points in dilations of an integral polytope is a polynomial. We call the coefficients of this polynomial Ehrhart coefficients, and say a polytope is Ehrhart positive if all Ehrhart coefficients are positive (which is not true for all integral polytopes). The main purpose of this article is to survey interesting families of polytopes that are known to be Ehrhart positive and discuss the reasons from which their Ehrhart positivity follows. We also include examples of polytopes that have negative Ehrhart coefficients and polyt…
We study polytopes defined by inequalities of the form $\sum_{i\in I} z_{i}\leq 1$ for $I\subseteq [d]$ and nonnegative $z_i$ where the inequalities can be reordered into a matrix inequality involving a column-convex $\{0,1\}$-matrix. These generalize polytopes studied by Stanley, and the consecutive coordinate polytopes of Ayyer, Josuat-Vergès, and Ramassamy. We prove an integral equivalence between these polytopes and flow polytopes of directed acyclic graphs $G$ with a Hamiltonian path, which we call spinal graphs. We show that the volume of these flow polytopes is the number of extensions …
It is shown that, for each $d \geq 4$, there exists an integral convex polytope $\mathcal{P}$ of dimension $d$ such that each of the coefficients of $n, n^{2}, \ldots, n^{d-2}$ of its Ehrhart polynomial $i(\mathcal{P},n)$ is negative. Moreover, it is also shown that for each $d \geq 3$ and $1 \leq k \leq d-2$, there exists an integral convex polytope $\mathcal{P}$ of dimension $d$ such that the coefficient of $n^k$ of the Ehrhart polynomial $i(\mathcal{P},n)$ of $\mathcal{P}$ is negative and all its remaining coefficients are positive. Finally, we consider all the possible sign patterns of the…
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 …
It is known that every integral convex polytope is unimodularly equivalent to a face of some Gorenstein Fano polytope. It is then reasonable to ask whether every normal polytope is unimodularly equivalent to a face of some normal Gorenstein Fano polytope. In the present paper, it is shown that, by giving new classes of normal Gorenstein Fano polytopes, each order polytope as well as each chain polytope of dimension $d$ is unimodularly equivalent to a facet of some normal Gorenstein Fano polytopes of dimension $d + 1$. Furthermore, investigation on combinatorial properties, especially, Ehrhart …
Let $G$ be a semisimple algebraic group over $\mathbb{C}$. For a reduced word $\bf i$ of the longest element in the Weyl group of $G$ and a dominant integral weight $λ$, one can construct the string polytope $Δ_{\bf i}(λ)$, whose lattice points encode the character of the irreducible representation $V_λ$. The string polytope $Δ_{\bf i}(λ)$ is singular in general and combinatorics of string polytopes heavily depends on the choice of $\mathbf i$. In this paper, we study combinatorics of string polytopes when $G = SL_{n+1}(\mathbb{C})$, and present a sufficient condition on $\mathbf i$ such that …
We construct explicit combinatorial Bernoulli factories for the class of \emph{flow-based polytopes}; integral 0/1-polytopes defined by a set of network flow constraints. This generalizes the results of Niazadeh et al. (who constructed an explicit factory for the specific case of bipartite perfect matchings) and provides novel exact sampling procedures for sampling paths, circulations, and $k$-flows. In the process, we uncover new connections to algebraic combinatorics.
In this paper, we address the problem of counting integer points in a rational polytope described by $P(y) = \{ x \in \mathbb{R}^m \colon Ax = y, x \geq 0\}$, where $A$ is an $n \times m$ integer matrix and $y$ is an $n$-dimensional integer vector. We study the Z-transformation approach initiated by Brion-Vergne, Beck, and Lasserre-Zeron from the numerical analysis point of view, and obtain a new algorithm on this problem: If $A$ is nonnegative, then the number of integer points in $P(y)$ can be computed in $O(\mathrm{poly} (n,m, \|y\|_\infty) (\|y\|_\infty + 1)^n)$ time and $O(\mathrm{poly} (…
对于一个多胞形P，Chvatal闭包P'是通过同时加强所有可行不等式cx <= b（含积分c）到cx <= floor（b）而得到的.直到达到P的积分壳所需的该过程的迭代次数被称为Chvatal秩。如果P是[0，1]^n的子集，那么已知O（n^2 log n）次迭代总是足够的（Eisenbrand and and Schulz（1999）），并且有时至少需要（1+1/e-o（1））n次迭代（Pokutta and Stauffer（2011）），在下限和上界之间留下巨大的差距。我们证明了存在一个包含在0/1立方体中的多面体，其Chvatal秩为Omega（n^2），将缺口缩小到对数因子。事实上，甚至一个超线性的下界被提到作为一个开放的问题，由几个作者。我们选择的P是半随机背包多面体和单个分数顶点的凸包。主要的技术成分是联系Chvatal秩同时丢番图逼近w.r.t.定义P的法向量的L1范数。
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-…
