Let be a weighted finite tree with leaves .For any ,let be the weight of the minimal subtree of connecting ; the are called -weights of . Given a family of real numbers parametrized by the -subsets of , ${D_I}{I \in {{1,…,n} \choose k}}{\cal T}=(T,w)$ with leaves realizes the family if for any . In [P-S] Pachter and Speyer proved that, if and is a family of positive real numbers, then there exists at most one positive-weighted essential tree with leaves that realizes the family (where “essential” means that there are no vertices of degree ). We say that a tree is a pseudostar of kind if the cardinality of the leaf set is and any edge of divides the leaf set into two sets such that at least one of them has cardinality . Here we show that, if and ${D_I}{I \in {{1,…,n} \choose k}}$ is a family of real numbers realized by some weighted tree, then there is exactly one weighted essential pseudostar of kind with leaves and without internal edges of weight , that realizes the family; moreover we describe how any other weighted tree realizing the family can be obtained from . Finally we examine the range of the total weight of the weighted trees realizing a fixed family.

生成讲解博客的中文版本

生成AI智能校验的中文版本