WorksMathematics
Weighted Euler transforms, real-rootedness, and -positivity
Abstract
For and a polynomial of degree , let denote the weighted Euler numerator of , defined as the numerator of the generating function with denominator . For every , we show the following preservation result: if the numerators and have only real nonpositive zeros, then the same holds for . The proof relies on an explicit multiplication formula in falling-factorial coordinates and a characterization of multiplier sequences for generalized Laguerre bases due to Brändén and Ottergren. Furthermore, when the symmetric degrees coincide with the ordinary degrees of the input polynomials, the same operation preserves -positivity. For positive integers , the weight is the Ehrhart polynomial of the standard simplex . This yields geometric preservation theorems for products with a single simplex factor, as well as applications to Gorenstein polytopes and a Reeve tetrahedron example.
Introduction
In enumerative combinatorics and Ehrhart theory, one frequently evaluates a polynomial at nonnegative integers, or equivalently, computes the generating function of the sequence . Such a function is rational and its numerator often encodes the core combinatorial data. A natural question is how the numerator behaves under multiplication of the input polynomials.
This paper studies a weighted family of such numerators. Fix , and let denote the rising factorial (with $(a)_0=1). Given a nonzero polynomial of degree , define its weighted Euler numerator via
By Proposition 2.1, is a polynomial of degree at most . As usual, the power is understood as a formal power series, or analytically for .
Two special cases explain the role of the parameter . For the weight is simply , yielding the ordinary generating function of . For , the weight is the Ehrhart polynomial of the standard simplex ; this is the source of the geometric applications in § 5.
For the unweighted case , Wagner [18] proved that has only real nonpositive zeros whenever and do. Brändén, Ferroni, and Jochemko [5] established further preservation results, including -positivity. For general , Karp and Vishnyakova [10, Open problem 2] asked whether real negative zeros of and imply the same for . Vishnyakova [17, Open Problem 1.9] then posed the analogous question for nonpositive zeros. Since , the nonpositive version is more general, as it additionally allows input polynomials with vanishing constant terms. Below, we prove this nonpositive preservation for all (Theorem 1.1), and deduce the corresponding -positivity result (Theorem 1.2).
2020 Mathematics Subject Classification. Primary 05A15; Secondary 26C10, 52B20, 33C45.
Key words and phrases. Weighted Euler transforms, real-rootedness, -positivity, multiplier sequences, generalized Laguerre polynomials, Ehrhart polynomials.
For , let
A nonzero polynomial is said to be -positive (or nonnegative in some literature) with symmetric degree . Such a polynomial satisfies the symmetry , although its ordinary degree can be strictly smaller than . As usual, nonzero constants are regarded as real-rooted.
We prove two preservation theorems. The first addresses real-rootedness.
Theorem 1.1 (Real-rootedness). Let , and let be nonzero polynomials. If every zero of and is real and nonpositive, then the same holds for .
The second addresses -positivity, under a subtle degree condition.
Theorem 1.2 (-positivity). Let , and let be nonzero polynomials of degrees , respectively. If and , then .
We begin by passing to falling-factorial coordinates. Let denote the linear change of basis, where is the falling factorial. This map converts the multiplication of polynomials into the bilinear operation
Under the substitution , the numerator transforms into the polynomial , and its nonpositive zeros map to the zeros of in . This polynomial coincides exactly with the characterizing polynomial in the deep classification of multiplier sequences for generalized Laguerre bases by Brändén and Ottergren [6]. By invoking their characterization as a black box, we bypass several pages of standard technical estimates and obtain Theorem 1.1 in a few lines.
For Theorem 1.2, bilinearity reduces the problem to the -basis polynomials . The -positivity for the product of any two such basis polynomials is proved in two steps: Theorem 1.1 ensures the product has only real nonpositive zeros, and the Brändén–Gal theorem then yields -positivity.
Now we describe two geometric applications of these algebraic results when . Let be a -dimensional lattice polytope with Ehrhart polynomial , and let be the standard simplex. The identity
allows us to restate Theorems 1.1 and 1.2 as follows.
Theorem 1.3 (Real-rootedness, geometric form). Let be lattice polytopes of dimensions , and let be an integer. If and are real-rooted, then is real-rooted.
Theorem 1.4 (-positivity, geometric form). Let be lattice polytopes of dimensions , and let be an integer. If and , then .
A key structural feature of these results is that the output retains only a single simplex factor. This connects to the general study of Ehrhart invariants under polytope operations (see Liu [11]). Moreover, Theorem 1.4 naturally applies to Gorenstein polytopes.
The remainder of the paper is organized as follows. Section 2 establishes the multiplication formula, Section 3 proves the preservation of real-rootedness, Section 4 proves -positivity, and Section 5 develops the geometric consequences, including a Reeve tetrahedron example.
The multiplication formula for weighted Euler numerators
This section reduces the product to an explicit bilinear formula (14). This formula is the key tool for the preservation arguments in § 3 and 4.
Falling-factorial coordinates
To simplify multiplication, we pass to the basis of falling factorials , with . If , define
Since , is a degree-preserving linear isomorphism. For of degree ,
where extracts the leading coefficient.
Proposition 2.1. For , we have
If , the numerator and are related by the mutually inverse substitutions
and
Furthermore, the endpoint values satisfy
Proof. The binomial series and the identity yield
Multiplying by and summing over yields (7). When , the numerator in (7) is exactly , which gives (8). Substituting into (8) gives (9). Finally, evaluating (8) at and yields and . This proves (10). □
Two auxiliary identities
Lemma 2.2. For ,
Proof. Since both sides are polynomials in , it suffices to assume that is a sufficiently large integer. For such , we give a combinatorial proof. The left-hand side counts pairs of ordered lists of lengths and chosen from labels, with no repetition within each list. Classify such a pair by the number of common labels. There are ways to choose and match these common labels. Once these are fixed, the remaining positions must receive distinct labels, yielding choices. This completes the proof. □
Lemma 2.3. If are nonnegative integers and , then
Proof. We use the generalized binomial coefficients for real and integers . Multiplying the left-hand side by gives
This sum is exactly the coefficient of in the product , which evaluates to . This is an instance of the Vandermonde convolution. Dividing by completes the proof. □
The multiplication formula
For , we define the induced operation
This operation is bilinear, commutative, and associative. The next proposition gives an explicit formula for it.
Proposition 2.4. For any and , we have
If and are nonzero, the sum is finite with .
Proof. Since both sides are bilinear, it suffices to verify the identity for monomials and . Using and Lemma 2.2, we compute
On the other hand, the right-hand side of (14) becomes
Its coefficient of is
Put , , and . Splitting the rising and falling factorials at yields
where the last equality uses Lemma 2.3 with . Now
Thus for every . This completes the proof. □
Preservation of real-rootedness
We now prove Theorem 1.1. Brändén and Ottergren [6] classified multiplier sequences for generalized Laguerre bases, establishing a powerful criterion for real-rootedness preservation in that setting. Remarkably, our weighted Euler numerators map precisely onto their characterizing polynomial, which allows us to invoke their classification directly and bypass the standard technical estimates. (For completeness, a direct proof using the classical Pólya–Schur criterion and Brändén’s bilinear theorem is given in Appendix A.)
The change of variables and the location of zeros
For a polynomial of degree at most , define
It is straightforward to check that is a polynomial: writing yields . The inverse substitution is
In particular, applying (9) gives
Lemma 3.1. Let be a nonzero polynomial with for some . If every zero of is real and nonpositive, then has degree and all its zeros in . Conversely, if a nonzero polynomial has degree and all its zeros in , then is a nonzero polynomial of degree at most with only real, nonpositive zeros. Under this correspondence, we have ; hence if and only if . Moreover, if has positive leading coefficient, then has nonnegative coefficients.
Proof. Write with and , where . Then
This has degree , with roots at for each , and at with multiplicity .
Conversely, suppose with and . The inverse substitution yields
When , this contributes a nonpositive root ; when , the factor is the constant . Therefore is nonzero, and its degree is minus the multiplicity of as a root of . The equality gives the claim about the origin. Finally, all factors in the displayed expression for have nonnegative coefficients, so the same holds for when . □
Multiplier sequences for the Laguerre basis
Fix and put . Let
be the generalized Laguerre polynomials. Since their degree is exactly , they form a basis of $\mathbb{R}[u].
For a nonzero polynomial , define the linear operator on by
(Here and below, preservation of real-rootedness includes mapping to the zero polynomial.)
We use the following characterization due to Brändén and Ottergren [6 Theorem 1.1], stated here in a form adapted to our notation. Given real sequences and related by
assume that is not a trivial sequence (i.e., it does not consist of at most two consecutive nonzero terms). Define the power series
Then the operator preserves real-rootedness if and only if is a real-rooted polynomial with all its zeros contained in .
We now apply this to the sequence . Writing and using , we obtain
Thus, the sequence corresponds to for , and for . Since is a nonzero polynomial, it has at most roots, so for infinitely many . Hence the sequence is not trivial. For this sequence, the power series truncates to the polynomial
Comparing this with (5), we see that is precisely . Therefore, the theorem of [6 Theorem 1.1] gives
By Lemma 3.1 and (15), the right-hand side is equivalent to saying that all zeros of are real and nonpositive. We conclude that
Now we are ready to prove the real-rootedness of the Euler numerators.
Proof of Theorem 1.1. Assume that and have only real nonpositive zeros. By (18), both and preserve real-rootedness; consequently, their composition also preserves real-rootedness. For every , we compute
Since these two linear operators agree on the basis , they must be identical. Thus, also preserves real-rootedness. By applying the equivalence (18) once more, we deduce that all zeros of are real and nonpositive. ∎
Preservation of -positivity
We now focus on Theorem 1.2. We begin by fixing terminology. A nonzero polynomial is symmetric of degree if
Equivalently, this means for every when writing . If denotes the set of indices with nonzero coefficients, then such an is unique and equals . We call this the symmetric degree of and denote it by
The following basic properties follow directly from the definition:
(S1) , , , and for .
(S2) for nonzero .
(S3) if and only if .
By (S3), the symmetric degree can exceed the ordinary degree exactly when the constant term vanishes. For instance, but for any .
Recall from (2) that is the cone generated by the polynomials .
The polynomials
form a basis of the space of polynomials symmetric of degree . Indeed, the space has dimension , and the degrees are all distinct for . Therefore, every such has a unique expansion
Consequently, if and only if and all coefficients in this expansion are nonnegative. Equivalently, is precisely the cone generated by the .
We will use the following elementary properties:
(G1) for all . In particular, and .
(G2) : if and , then . Indeed, , so multiplying the -expansions (20) gives a nonnegative expansion in the basis of .
(G3) For , . Indeed,
and the coefficient of is nonnegative.
Note that (G3) is the only step where the reciprocal pairing of roots appears. Combining (G1)–(G3) with the factorization of real-rooted polynomials yields the following classical result, which is due to Brändén [4 Lemma 4.1] and Gal [9 Remark 3.1.1]; see also [1 Section 1].
Theorem 4.1 (Brändén–Gal). Let be symmetric of degree . If all zeros of are real and nonpositive, then .
Next, we verify that symmetry is preserved under our operation.
Proposition 4.2. Let , and let be nonzero polynomials of degrees , respectively. If and are symmetric of degrees and , then is symmetric of degree .
Proof. Put and . By (8), we have
We claim that is symmetric of degree if and only if
For the forward implication, suppose . Substituting into (21) yields
The backward implication is obtained similarly using the substitution .
Analogously, for , we have . Differentiating times gives
Since , each summand in (14) acquires the same factor under . Hence
Because , we apply the equivalence (22) once again to conclude that is symmetric of degree . □
We now prove Theorem 1.2. Note that the two gamma-positive inputs are not required to be real-rooted.
Proof of Theorem 1.2. Write
with all .
For each , define
Although has degree , the polynomial has degree exactly , with leading coefficient . Since preserves degrees,
The polynomials are defined analogously, and we have
Fix and set . We show that by verifying the conditions of the Brändén–Gal theorem.
First, since and have no zeros outside , Theorem 1.1 implies that all zeros of are real and nonpositive.
Second, by (10) of Proposition 2.1, we have
Since has only real nonpositive zeros, being positive at ensures that all its coefficients are nonnegative.
Third, by Proposition 4.2, is symmetric of degree . Theorem 4.1 therefore applies to yield . Finally, by the linearity of and (23), we have
All products have degree , so their weighted Euler series share the same denominator . Consequently,
The theorem then follows, since the cone is closed under nonnegative linear combinations. □
Remark 4.3. The requirement that and in Theorem 1.2 is essential. The map is not globally linear: the denominator of its generating function depends on . For example, with , and , but
By imposing and , the ordinary degree and the symmetric degree are forced to coincide. This unifies the denominators, ensuring that the linear combinations used in the proof (such as ) are well-defined.
Without this degree condition, the conclusion can fail. For instance, take and . Then . Direct computation yields , which does not belong to the predicted . This shows that the degree condition is indeed necessary.
A common simplex factor
Ehrhart series and the Pochhammer weight
Let be a -dimensional lattice polytope. We work in its affine span and, after translating by a lattice vertex, regard as a full-dimensional polytope in with the induced lattice; the lattice on a Cartesian product is the product lattice (see [2] for standard background). The Ehrhart function of is
Ehrhart’s theorem states that is a polynomial in of degree , with [8], and its generating function takes the form
The numerator is called the -polynomial of . It has degree at most , nonnegative integer coefficients, and constant term ; see [16, 2]. In particular, if is real-rooted, its zeros are strictly negative. (As usual, nonzero constants are considered real-rooted.)
For two lattice polytopes and , the Cartesian product satisfies
The preservation of real-rootedness under this product is a classical result of Wagner [18 Theorem 0.2]; see Liu [11 Section 2] for a broader survey of operations on lattice polytopes.
Fix an integer and let
be the standard simplex, with being a point. The lattice points of correspond to nonnegative integer tuples satisfying . By setting , these are in bijection with the nonnegative integer solutions of . Consequently,
Equivalently, the polynomial is the Ehrhart polynomial of (with the empty product being for ). The Pochhammer weight therefore has a direct geometric interpretation at every positive integer parameter.
Proposition 5.1. Let be a lattice polytope of dimension , and let be an integer. Then
In particular, .
Proof. By (25) and (26), we have
The left-hand side is the weighted Euler series associated to . Since , its denominator is . On the other hand, the polytope has dimension , so its Ehrhart series shares the same denominator . Comparing the numerators yields (27). The degree bound then follows from the degree bound for . □
Products with one common simplex
We now prove Theorems 1.3 and 1.4. Using Proposition 5.1 to translate into the algebraic setting, both proofs are immediate applications of our main results (Theorems 1.1 and 1.2). Afterward, we explain a geometric feature of the output.
Proof of Theorems 1.3 and 1.4. Put and . Then , , and . By Proposition 5.1, we have
Under the hypotheses of Theorem 1.3, the first two numerators are real-rooted. Since Ehrhart numerators have nonnegative coefficients and constant term , all their zeros are strictly negative. Applying Theorem 1.1 with shows that has only real nonpositive zeros, proving Theorem 1.3.
Under the hypotheses of Theorem 1.4, we instead have and . Together with and , these are precisely the hypotheses of Theorem 1.2 with . Hence
which proves Theorem 1.4. □
Corollary 5.2. For each positive integer , the class
is closed under Cartesian products. More generally, if , then is real-rooted. Likewise, if are lattice polytopes with for every , where , then the same output belongs to .
Proof. The assertion for two factors is the combination of Theorem 1.3 and Theorem 1.4. Apply them successively to and , keeping the same parameter . At the th step the symmetry degree in the second assertion is . □
A common Gorenstein index
We next discuss a geometric condition that supplies the symmetry degrees required in Theorem 1.4. A full-dimensional lattice polytope is reflexive if lies in its interior and its polar
is a lattice polytope. Equivalently, every facet inequality can be written as for some primitive integer vector .
The codegree of a lattice polytope is
We say is Gorenstein of index if , the polytope has a unique interior lattice point , and is reflexive. These definitions are taken in the affine lattice of . A point is Gorenstein of index 1. We refer to [7, 2] for the standard connections with Ehrhart series.
We will need the following well-known properties of Gorenstein polytopes; see [2] and [12 Theorem 4.3].
Lemma 5.3. Let be a -dimensional Gorenstein lattice polytope of index . Then
Moreover, the Cartesian product of two Gorenstein lattice polytopes of the same index is Gorenstein of index $r.
For , the polytope has a unique interior lattice point, namely the vector . Indeed, the interior of consists of points with strictly positive coordinates and coordinate sum less than . Since has coordinate sum , it lies in the interior of ; moreover, no such point exists for . Translating by , the facet inequalities become
Since the right-hand sides are all 1, the polytope is reflexive. Hence is Gorenstein of index . (For , this holds trivially by our convention for a point.)
Corollary 5.4. Let and be Gorenstein lattice polytopes of the same index . If and are gamma-positive, then is gamma-positive.
Proof. Put and . Lemma 5.3 shows that is Gorenstein of index . Its dimension is , so its -polynomial has degree and symmetry degree . Similarly, the symmetry degree for is . The two gamma-positive inputs therefore belong to and , respectively. Theorem 1.4 gives the conclusion, with symmetry degree . □
The Reeve tetrahedron
Consider the Reeve tetrahedron [15]
A direct computation of its Ehrhart series gives
This numerator is not real-rooted. We give two applications of our theorems to this non-real-rooted example.
First application: adjoining a segment. Let be the unit segment. Since its Ehrhart polynomial is , multiplying the th series coefficient by acts as . We obtain
Thus . In particular, the non-real-rooted numerator is repaired by adjoining a single segment: but . Moreover, since the output belongs to , Corollary 5.2 implies that for every , the numerator is real-rooted and belongs to .
Second application: Cartesian powers. Next we consider the powers without adjoining any simplex factor. For , define
We will show that has only real negative roots if and only if .
Since , zero is never a root. For , has no real roots. For , a direct computation gives
and the quartic factor equals for all real . Hence has only one real root. Thus the threshold is sharp.
We now prove the assertion for . By Theorem 1.1 with , the product of two real-rooted polynomials with real nonpositive zeros has real nonpositive zeros. Since , this implies
It therefore suffices to verify the base cases , as the identities , , , and the induction step for complete the proof.
To check these base cases, we make the substitution . For , the roots of are real and negative. We express in terms of a lower-degree monic polynomial . Put , , and . Then
The extra factor occurs when is even. The coefficients of are given by via the generating function.
For , has degree 8:
It can be written as , with
Evaluating at gives . The signs alternate, so the intermediate value theorem ensures a root in each interval . All evaluations use exact rational arithmetic. Since , all its roots are real and lie in . Each root yields two negative roots of via . Thus all 8 roots of are real and negative.
For , the verification is analogous. The corresponding polynomials and their alternating evaluations are:
evaluated at yields .
evaluated at yields .
Since and , the alternating signs certify that all their roots are real and lie in . Translating back via (and accounting for the extra factor when ) shows that all roots of and are real and negative. This completes the proof of the base cases.
By (31), has only real negative roots for all .
Acknowledgements
Acknowledgements. Guoce Xin was partially supported by the National Natural Science Foundation of China (No. 12571355).
Appendix A. An alternative proof via the Pólya–Schur criterion
This appendix provides an alternative proof of Theorem 1.1 that avoids the Brändén–Ottergren characterization. Instead, it relies solely on the classical Pólya–Schur criterion and Brändén’s bilinear preservation theorem. The argument follows the structure of § 3 but substitutes the algebraic core.
A Pochhammer multiplier sequence
Definition A.1. A sequence of real numbers is a multiplier sequence if the coefficient operator
maps every real-rooted polynomial to a real-rooted polynomial or to the zero polynomial.
We use the following finite form of the Pólya–Schur criterion [14]; see also [3 Theorem 3.14].
Theorem A.2 (Pólya–Schur criterion). Let be a sequence of nonnegative real numbers. It is a multiplier sequence if and only if, for every integer , the polynomial
has only real, nonpositive zeros or is identically zero.
Lemma A.3. For every , the sequence is a positive multiplier sequence.
Proof. We verify Theorem A.2 using generalized Laguerre polynomials. For and , define
Here for . Formula (32) is the standard finite expansion of the generalized Laguerre polynomial [13 Eq. 18.5.12]. Its leading coefficient is , so its degree is exactly .
To locate the zeros, we use the Rodrigues identity
Indeed, differentiating the exponential factor times gives
and multiplying by recovers (32).
Let have degree less than . Integrating by parts times in (33) gives
To justify this, put . For , as , and . Thus all boundary terms at vanish. At infinity, and its derivatives decay exponentially, so the other boundary terms also vanish. All integrals converge since the least power at is , with .
Assume , and let be the distinct zeros in at which changes sign. If , take . The polynomial then has constant sign on apart from its zeros, and it is not identically zero. Since on this interval, its weighted integral cannot vanish. This contradicts (34), because . Consequently . As has degree , it has exactly distinct positive zeros, each of multiplicity one.
Now set . For ,
It follows from (32) that
For all zeros of this polynomial are strictly negative; for it equals 1. Theorem A.2 proves the multiplier property, and positivity follows from . □
Interval preservation for the induced product
We use the interval form of Brändén’s bilinear preservation theorem [3 Theorem 3.11].
Theorem A.4 (Brändén). Let be a nonnegative multiplier sequence and let be real numbers. If is real-rooted and all zeros of lie in , then
is real-rooted or identically zero. (The sum is finite, and the closed interval permits zeros at its endpoints.)
Proposition A.5. Fix . Let be nonzero polynomials with positive leading coefficients, of degrees , respectively. If all their zeros belong to , then has degree , positive leading coefficient, and all its zeros in . Moreover,
Proof. By (14),
Lemma A.3 allows us to apply Theorem A.4 with
Here is real-rooted, has all its zeros in , and . The theorem therefore shows that is real-rooted or identically zero.
Every summand in (37) has degree at most . Its coefficient of is nonnegative, and their sum is
Thus is nonzero, has degree , and has positive leading coefficient.
It remains to locate its real zeros. Write , where and . For and , each term in the product-rule expansion of is positive. For , each such term has sign . The same statements hold for .
For , all summands in (37) are positive. For , their signs are all , since . In either interval the summand with is nonzero, so has no zeros there. Together with real-rootedness, this proves that all its zeros lie in . The same argument applies when or . Finally, evaluating (37) at and leaves only its summand and proves (36). □
Real-rootedness of the Euler numerators
Alternative proof of Theorem 1.1. Set and . Multiplying and by nonzero real constants rescales their numerators and the numerator of . We may therefore assume that and have positive leading coefficients. Since all their zeros are nonpositive, their coefficients are nonnegative, and .
Set and . By (15) and Lemma 3.1, these polynomials have degrees and all their zeros in . Their leading coefficients are and , hence positive. The definition of the induced product gives
Proposition A.5 shows that this polynomial has degree , positive leading coefficient, and all its zeros in . Since , applying (8) to and then Lemma 3.1 proves that has only real, nonpositive zeros.
If both input numerators have only strictly negative zeros, then and . By (36), , so the output numerator has no zero at the origin. Its zeros are consequently strictly negative.
Finally, if the original input numerators already have nonnegative coefficients, the initial rescaling is unnecessary. The positive leading coefficient of and Lemma 3.1 then show that has nonnegative coefficients.
References
School of Mathematical Sciences, Capital Normal University, Beijing 100048, P.R. China Email address: [email protected]
School of Mathematical Sciences, Capital Normal University, Beijing 100048, P.R. China Email address: [email protected]
References
- [1]C. A. Athanasiadis, Gamma-positivity in combinatorics and geometry, Sém. Lothar. Combin. 77 (2016–2018), Article B77i, 64 pp.arxiv.org/abs/1711.05983
- [2]M. Beck and S. Robins, Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra, second ed., Undergraduate Texts in Mathematics, Springer, New York, 2015. doi:10.1007/978-1-4939-2969-6.DOI
- [3]P. Brändén, On linear transformations preserving the Pólya frequency property, Trans. Amer. Math. Soc. 358 (2006), no. 8, 3697–3716. doi:10.1090/S0002-9947-06-03856-6.DOI
- [4]P. Brändén, Actions on permutations and unimodality of descent polynomials, European J. Combin. 29 (2008), no. 2, 514–531.DOI
- [5]P. Brändén, L. Ferroni, and K. Jochemko, Preservation of inequalities under Hadamard products, Trans. Amer. Math. Soc. (2026), published electronically September 22, 2026. doi:10.1090/tran/9683. Preprint: arXiv:2408.12386v2.DOI
- [6]P. Brändén and E. Ottergren, A characterization of multiplier sequences for generalized Laguerre bases, Constr. Approx. 39 (2014), no. 3, 585–596. doi:10.1007/s00365-013-9204-4.DOI
- [7]W. Bruns and T. Römer, h-Vectors of Gorenstein polytopes, J. Combin. Theory Ser. A 114 (2007), no. 1, 65–76. doi:10.1016/j.jcta.2006.03.003.DOI
- [8]E. Ehrhart, Sur les polyèdres rationnels homothétiques à n dimensions, C. R. Acad. Sci. Paris 254 (1962), 616–618.
- [9]S. R. Gal, Real root conjecture fails for five- and higher-dimensional spheres, Discrete Comput. Geom. 34 (2005), no. 2, 269–284.DOI
- [11]F. Liu, Ehrhart properties under operations on lattice polytopes, preprint (2026), arXiv:2610.06338v2.arxiv.org/abs/2610.06338
- [12]F. Liu, S. Tao, and G. Xin, Ehrhart Theory of the Join of Two Lattice Polytopes, preprint (2026), arXiv:2606.18794v1.arxiv.org/abs/2606.18794
- [13]National Institute of Standards and Technology, NIST Digital Library of Mathematical Functions, Chapter 18, Orthogonal polynomials, especially Equation 18.5.12. https://dlmf.nist.gov/18.5.E12, accessed October 27, 2026.
- [14]G. Pólya and I. Schur, Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen, J. Reine Angew. Math. 144 (1914), 89–113. doi:10.1515/crll.1914.144.89.
- [15]J. E. Reeve, On the volume of lattice polyhedra, Proc. London Math. Soc. (3) 7 (1957), 378–395. doi:10.1112/plms/s3-7.1.378.DOI
- [16]R. P. Stanley, Decompositions of rational convex polytopes, Ann. Discrete Math. 6 (1980), 333–342. doi:10.1016/S0167-5060(08)70717-9.DOI
- [18]D. G. Wagner, Total positivity of Hadamard products, J. Math. Anal. Appl. 163 (1992), no. 2, 459–483. doi:10.1016/0022-247X(92)90261-B.DOI