arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.11566math.CO
收藏

树的距离矩阵:两个新的不变量,以及一个统一框架

Distance matrices of a tree: two more invariants, and in a unified framework

Projesh Nath Choudhury, Apoorva Khare

AI总结:

本文提出双向加权树的统一框架,证明距离矩阵的行列式、余子式之和及相关子式仅依赖于边数据,推广并统一了 Graham-Pollak 等经典结果,并引入第三个新不变量。

摘要:

Graham-Pollak 证明了对于树 $T$ 的距离矩阵 $D = D_T$,det$(D)$ 仅依赖于其边数。$D$ 的其他几种变体,包括有向/乘法/$q$-版本,也已被研究,并且始终有 det$(D)$ 仅依赖于边数据。我们引入了一个用于双向加权树的通用框架,具有三重意义。首先,我们在所有已知变体上改进了现有最佳结果,甚至在经典的 Graham-Pollak 情形中也是如此:我们从 $D$ 的行/列中删除任意悬挂节点(以及更一般的子集),并证明这些子式不依赖于树结构。其次,我们的设置统一了所有已知变体(其元素取值于一个交换环)。我们进一步以封闭形式计算了 $D^{-1}$,推广了 Graham-Lovasz [Adv. Math. 1978] 的一个结果,并以更大的普遍性回答了 Bapat-Lal-Pati [Lin. Alg. Appl. 2006] 的一个公开问题。第三,我们计算了矩阵 $D$ 的第二个函数:其所有余子式之和 cof$(D)$。这在最简单的情形下由 Graham-Hoffman-Hosoya (1978) 解决,但对于其他变体相对未被探索。我们在一般设置下证明了一个更强的结果,通过计算如上所述的子式的 cof$(.)$,并证明这些同样仅依赖于边数据。最后,我们证明我们的设置是“最一般可能的”,因为如果边权有更多的自由度,det$(D)$ 和 cof$(D)$ 将依赖于树结构。在某种意义上,这完成了对具有交换环中边数据的树 $T$ 的不变量 det$(D_T)$、cof$(D_T)$ 的研究。此外:对于双向图 $G$,我们证明了 det$(D_G)$、cof$(D_G)$、$D_G^{-1}$ 的乘法 Graham-Hoffman-Hosoya 型公式。然后我们展示了这如何包含他们 1978 年的结果。最后一节引入并计算了树的第三个新不变量,以及对于我们“最一般”的距离矩阵 $D_T$ 的 Graham-Hoffman-Hosoya 型结果。

英文摘要:

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$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑