Related papers: Additive number theory and inequalities in Ehrhart…
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…
The purpose of this paper is to extend the scope of the Ehrhart theory to periodic graphs. We give sufficient conditions for the growth sequences of periodic graphs to be a quasi-polynomial and to satisfy the reciprocity laws. Furthermore,…
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…
A lattice polytope $P$ is called IDP if any lattice point in its $k$th dilate is a sum of $k$ lattice points in $P$. In 1991 Stanley proved a strong inequality in Ehrhart theory for IDP lattice polytopes. We show that his conclusion holds…
We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…
Addition formulas exist in trigonometric functions. Double-angle and half-angle formulas can be derived from these formulas. Moreover, the relation equation between the trigonometric function and the hyperbolic function can be derived using…
Given a lattice polytope $P$ (with underlying lattice $\lo$), the universal counting function $\uu_P(\lo')=|P\cap \lo'|$ is defined on all lattices $\lo'$ containing $\lo$. Motivated by questions concerning lattice polytopes and the Ehrhart…
Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…
We present examples of smooth lattice polytopes in dimensions 3 and higher where each coefficient of their Ehrhart polynomials that can potentially be negative is indeed negative. This answers a question by Bruns. We also discuss…
We study the interplay between Sabbah's mixed Hodge structure for regular functions and Ehrhart theory for polytopes. To this end, we analyze the properties of the Poincar\'e polynomial of the Hodge filtration of this mixed Hodge structure.
In the present paper, we introduce a multibasic extension of the Ehrhart theory. We give a multibasic extension of Ehrhart polynomials and Ehrhart series. We also show that an analogue of Ehrhart reciprocity holds for multibasic Ehrhart…
Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…
In this paper, we study inequalities involving polynomials and quasimodular forms. More precisely, we focus on the monotonicity of the functions of the form $t \mapsto t^m F(it)$ where $F$ is a quasimodular form and $m > 0$. As an…
We consider Hilbert-type functions associated with difference (not necessarily inversive) field extensions and systems of algebraic difference equations in the case when the translations are assigned some integer weights. We will show that…
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…
Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…
On even-dimensional Euclidean space for integer powers of the Laplace operator greater than or equal to half the dimension, a fundamental solution of the polyharmonic equation has binomial and logarithmic behavior. Gegenbauer polynomial…
A function g, with domain the natural numbers, is a quasi-polynomial if there exists a period m and polynomials p_0,p_1,...,p_{m-1} such that g(t)=p_i(t) for t=i mod m. Quasi-polynomials classically -- and "reasonably" -- appear in Ehrhart…
Many results in extremal graph theory can be formulated as certain polynomial inequalities in graph homomorphism densities. Answering fundamental questions raised by Lov{\'a}sz, Szegedy and Razborov, Hatami and Norine proved that…
The characterization of lattice polytopes based upon information about their Ehrhart $h^*$-polynomials is a difficult open problem. In this paper, we finish the classification of lattice polytopes whose $h^*$-polynomials satisfy two…