Families of multiweights and pseudostars

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…