Distance matrices of a tree: two more invariants, and in a unified framework
Projesh Nath Choudhury, Apoorva Khare
备注:
Major updates to the exposition; several "alternate proofs" are removed. Final version, 30 pages + 2 figures, to appear in the European Journal of Combinatorics
发表信息:
European Journal of Combinatorics 115 (2024), art. # 103787, 30 pp
Graham-Pollak showed that for $D = D_T$ the distance matrix of a tree $T$, det$(D)$ depends only on its number of edges. Several other variants of $D$, including directed/multiplicative/$q$- versions were studied, and always, det$(D)$ depends only on the edge-data.
We introduce a general framework for bi-directed weighted trees, with threefold significance. First, we improve on state-of-the-art for all known variants, even in the classical Graham-Pollak case: we delete arbitrary pendant nodes (and more general subsets) from the rows/columns of $D$, and show these minors do not depend on the tree-structure.
Second, our setting unifies all known variants (with entries in a commutative ring). We further compute $D^{-1}$ in closed form, extending a result of Graham-Lovasz [Adv. Math. 1978] and answering an open question of Bapat-Lal-Pati [Lin. Alg. Appl. 2006] in greater generality.
Third, we compute a second function of the matrix $D$: the sum of all its cofactors, cof$(D)$. This was worked out in the simplest setting by Graham-Hoffman-Hosoya (1978), but is relatively unexplored for other variants. We prove a stronger result, in our general setting, by computing cof$(.)$ for minors as above, and showing these too depend only on the edge-data.
Finally, we show our setting is the "most general possible", in that with more freedom in the edgeweights, det$(D)$ and cof$(D)$ depend on the tree structure. In a sense, this completes the study of the invariants det$(D_T)$, cof$(D_T)$ for trees $T$ with edge-data in a commutative ring.
Moreover: for a bi-directed graph $G$ we prove multiplicative Graham-Hoffman-Hosoya type formulas for det$(D_G)$, cof$(D_G)$, $D_G^{-1}$. We then show how this subsumes their 1978 result. The final section introduces and computes a third, novel invariant for trees and a Graham-Hoffman-Hosoya type result for our "most general" distance matrix $D_T$.
The Smith normal form of Laplacian matrices of simplicial annuli and high dimensional trees
Banco de México(墨西哥银行);Facultad de Ciencias Universidad Nacional Autónoma de México(墨西哥国立自治大学理学院);Cinvestav(墨西哥国立理工学院先进研究中心);Facultad de Economía, Universidad Autónoma de San Luis Potosí(圣路易斯波托西自治大学经济学院);Worcester Polytechnic Institute(伍斯特理工学院)
Inertia and spectral symmetry of eccentricity matrices of some clique trees
连通图$G$的偏心率矩阵$\mathcal E(G)$是由$G$的距离矩阵得到的,保持每行和每列中最大的非零元素不变,并将剩余的1替换为0。本文考虑块至多有两个割点的团树集合$\mathcal C \mathcal T$ \textcolor{blue}{of the clique tree}。在证明了$\mathcal C \mathcal T$中团树的偏心矩阵的不可约性并求出了它的惯性指数之后,我们证明了$\mathcal C \mathcal T$中每一个顶点数大于$4$且直径为奇数的图都有两个正的和两个负的$\mathcal E$ -特征值.正的$\mathcal E$ -特征值和负的$\mathcal E$ -特征值在数量上是相等的,即使对于$\mathcal C \mathcal T$中直径为偶数的图也是如此;共享的基数也计算了\textcolor{blue}{`diametrally distinguished'}的顶点。最后,证明了$\mathcal C \mathcal T$中团树$G$的偏心矩阵的谱关于原点对称的充要条件是$G$具有奇数直径且恰好有两个相邻的中心顶点.
School of Mathematics and Computational Science, Xiangtan University(湘潭大学数学与计算科学学院);School of Mathematical Sciences, Xiamen University(厦门大学数学科学学院);School of Mathematics and Statistics, Lanzhou University(兰州大学数学与统计学院)
$λ$-shaped random matrices, $λ$-plane trees, and $λ$-Dyck paths
Technische Universität Wien(维也纳工业大学);Università degli Studi di Firenze(佛罗伦萨大学);Università degli Studi di Bari(巴里大学);INFN, Sezione di Bari(意大利国家核物理研究所巴里分部)