Papers
Topics
Authors
Recent
Search
2000 character limit reached

Generalized Matrix polynomials of Tree Laplacians indexed by Symmetric functions and the GTS poset

Published 6 Dec 2019 in math.CO | (1912.03101v1)

Abstract: Let TT be a tree on nn vertices with qq-Laplacian LT<sup>qL_T<sup>q and Laplacian matrix LTL_T. Let GTSnGTS_n be the generalized tree shift poset on the set of unlabelled trees on nn vertices. Inequalities are known between coefficients of the immanantal polynomial of LTL_T (and LT<sup>qL_T<sup>q) as we go up the poset GTSnGTS_n. Using the Frobenius characteristic, this can be thought as a result involving the schur symmetric function sλs_{\lambda}. In this paper, we use an arbitrary symmetric function to define a {\it generalized matrix function} of an n×nn \times n matrix. When the symmetric function is the monomial and the forgotten symmetric function, we generalize such inequalities among coefficients of the generalized matrix polynomial of LT<sup>qL_T<sup>q as we go up the GTSnGTS_n poset.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.