June 7, 2021
What can be (machine) learned about the complexity of Buchberger's algorithm? Given a system of polynomials, Buchberger's algorithm computes a Gr\"obner basis of the ideal these polynomials generate using an iterative procedure based on multivariate long division. The runtime of each step of the algorithm is typically dominated by a series of polynomial additions, and the total number of these additions is a hardware independent performance metric that is often used to eval...
November 27, 2017
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 t...
February 9, 2004
The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We also investigate the roots of Ehrhart polynomials. We prove that for fixed d, there exists a bounded region of C containing all roots of Ehrhart polynomials of d-polytopes, and that all real roots of these polynomials lie in [-d, [d/2]). I...
February 9, 2010
My main results are simple formulas for the surface area of d-dimensional lattice polytopes using Ehrhart theory.
April 21, 2005
We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of a fixed dimension. The algorithm is based on the formula relating the kth coefficient of the Ehrhart quasi-polynomial of a rational polytope to volumes of sections of the polytope by affine lattice subspaces parallel to k-dimensional faces ...
November 9, 2004
If P is a rational polytope in R^d, then $i_P(t):=#(tP\cap Z^d)$ is a quasi-polynomial in t, called the Ehrhart quasi-polynomial of P. A period of i_P(t) is D(P), the smallest positive integer D such that D*P has integral vertices. Often, D(P) is the minimum period of i_P(t), but, in several interesting examples, the minimum period is smaller. We prove that, for fixed d, there is a polynomial time algorithm which, given a rational polytope P in R^d and an integer n, decides w...
June 17, 2018
The holy grail of deep learning is to come up with an automatic method to design optimal architectures for different applications. In other words, how can we effectively dimension and organize neurons along the network layers based on the computational resources, input size, and amount of training data? We outline promising research directions based on polyhedral theory and mixed-integer representability that may offer an analytical approach to this question, in contrast to t...
February 19, 2010
Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P(n) = nP$ is a quasi-polynomial in $n$. We generalize this theorem by allowing the vertices of P(n) to be arbitrary rational functions in $n$. In this case we prove that the number of lattice points in P(n) is a quasi-polynomial for $n$ sufficiently large. Our work was motivated by a conjecture of Ehrhart on the number of solutions to parame...
March 22, 2023
We survey some recent applications of machine learning to problems in geometry and theoretical physics. Pure mathematical data has been compiled over the last few decades by the community and experiments in supervised, semi-supervised and unsupervised machine learning have found surprising success. We thus advocate the programme of machine learning mathematical structures, and formulating conjectures via pattern recognition, in other words using artificial intelligence to hel...
November 8, 2018
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 severa...