Research

We give explicit formulas for the gamma vector directly in terms of the input polynomial which extends to arbitrary polynomials. More specifically, we can express them as a linear combination of the coefficients of the starting polynomial (using Catalan numbers and binomial coefficients) or in terms of the derivative of a simple quotient of the input polynomial. The first formula suggests relations to common noncrossing partition/Coxeter group structures in existing gamma positivty examples. The second one shows that the gamma vector measures the difference between local and global information when the input polynomial is the h-polynomial of a simplicial complex. It can also be used to relate signs/inequalities of the gamma vector to upper/lower bounds for the coefficients of the input polynomial. The expression in terms of a derivative and relation to the bounds complements and extends initial observations made by Gal when he defined the gamma vector. Finally, we use the form taken by sums involved while making these estimates and connections between matroid-related examples and intersection numbers to connect these properties of the gamma vector to algebraic structures. For example, this includes characteristic classes involved in log concavity and Schur positivity problems.