Answers are grounded in this paper and cite their sources.
Formulas for the determinant of distance matrix <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi>D</m:mi> </m:mrow> <m:mrow> <m:mi>T</m:mi> </m:mrow> </m:msub> </m:math> {D}T of tree <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>T</m:mi> </m:math> T are known in the unweighted case and in the case when the edges of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>T</m:mi> </m:math> T have commuting variable weights. Associated with the four-point condition (4PC) and a tree <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>T</m:mi> </m:math> T are two matrices, the <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi mathvariant="normal">Max4PC</m:mi> </m:mrow> <m:mrow> <m:mi>T</m:mi> </m:mrow> </m:msub> </m:math> {{Max4PC}}T and the <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi mathvariant="normal">Min4PC</m:mi> </m:mrow> <m:mrow> <m:mi>T</m:mi> </m:mrow> </m:msub> </m:math> {{Min4PC}}T . These are not full rank matrices and their rank, a basis <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>B</m:mi> </m:math> B , and formulas for the determinant when restricted to the rows and columns of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>B</m:mi> </m:math> B are known. In this work, we generalize both these matrices to the case when the edges of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>T</m:mi> </m:math> T have commuting variable weights and determine edge-weighted counterparts of known results.
No takes yet. Share an insight, caveat, or question.
Azimi et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: