Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Ehrhart tensor polynomials (1706.01738v1)

Published 6 Jun 2017 in math.CO and math.MG

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

We haven't generated a summary for this paper yet.