English

Ehrhart tensor polynomials

Combinatorics 2017-06-07 v1 Metric Geometry

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 hrh^r-tensor polynomials, extending the notion of the Ehrhart hh^\ast-polynomial, and, for matrices, investigate their coefficients for positive semidefiniteness. In contrast to the usual hh^\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 hrh^r-tensor polynomials and discuss possible future research directions.

Keywords

Cite

@article{arxiv.1706.01738,
  title  = {Ehrhart tensor polynomials},
  author = {Sören Berg and Katharina Jochemko and Laura Silverstein},
  journal= {arXiv preprint arXiv:1706.01738},
  year   = {2017}
}

Comments

18 pages, 3 figures