Papers
Topics
Authors
Recent
Search
2000 character limit reached

Unimodality and peak location of the characteristic polynomials of two distance matrices of trees

Published 3 Jul 2024 in math.CO | (2407.03309v1)

Abstract: Unimodality of the normalized coefficients of the characteristic polynomial of distance matrices of trees are known and bounds on the location of its peak (the largest coefficient) are also known. Recently, an extension of these results to distance matrices of block graphs was given. In this work, we extend these results to two additional distance-type matrices associated with trees: the Min-4PC matrix and the 2-Steiner distance matrix. We show that the sequences of coefficients of the characteristic polynomials of these matrices are both unimodal and log-concave. Moreover, we find the peak location for the coefficients of the characteristic polynomials of the Min-4PC matrix of any tree on $n$ vertices. Further, we show that the Min-4PC matrix of any tree on $n$ vertices is isometrically embeddable in $\mathbb{R}{n-1}$ equipped with the $\ell_1$ norm.

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.

Collections

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

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.