Papers
Topics
Authors
Recent
Search
2000 character limit reached

Ehrhart tensor polynomials

Published 6 Jun 2017 in math.CO and math.MG | (1706.01738v1)

Abstract: The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix cases, we give Pick-type formulas in terms of triangulations of a lattice polygon. As our main tool, we introduce $hr$-tensor polynomials, extending the notion of the Ehrhart $h\ast$-polynomial, and, for matrices, investigate their coefficients for positive semidefiniteness. In contrast to the usual $h\ast$-polynomial, the coefficients are in general not monotone with respect to inclusion. Nevertheless, we are able to prove positive semidefiniteness in dimension two. Based on computational results, we conjecture positive semidefiniteness of the coefficients in higher dimensions. Furthermore, we generalize Hibi's palindromic theorem for reflexive polytopes to $hr$-tensor polynomials and discuss possible future research directions.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.