Papers
Topics
Authors
Recent
2000 character limit reached

Symmetric decompositions and the Veronese construction

Published 11 Apr 2020 in math.CO and math.AC | (2004.05423v3)

Abstract: We study rational generating functions of sequences ${a_n}{n\geq 0}$ that agree with a polynomial and investigate symmetric decompositions of the numerator polynomial for subsequences ${a{rn}}{n\geq 0}$. We prove that if the numerator polynomial for ${a_n}{n\geq 0}$ is of degree $s$ and its coefficients satisfy a set of natural linear inequalities then the symmetric decomposition of the numerator for ${a_{rn}}{n\geq 0}$ is real-rooted whenever $r\geq \max {s,d+1-s}$. Moreover, if the numerator polynomial for ${a_n}{n\geq 0}$ is symmetric then we show that the symmetric decomposition for ${a_{rn}}_{n\geq 0}$ is interlacing. We apply our results to Ehrhart series of lattice polytopes. In particular, we obtain that the $h\ast$-polynomial of every dilation of a $d$-dimensional lattice polytope of degree $s$ has a real-rooted symmetric decomposition whenever the dilation factor $r$ satisfies $r\geq \max {s,d+1-s}$. Moreover, if the polytope is Gorenstein then this decomposition is interlacing.

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.

Authors (1)

Collections

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