Diagonally Embedded Sets of 's in : Is There a Critical Value of ?
arXiv:2104.10628
Abstract
The tropical Grassmannian is known to be the moduli space of unrooted metric trees with leaves. A positive part can be defined for each of the possible planar orderings, , and agrees with the corresponding planar trees in the moduli space, . Motivated by a physical application we study the way and intersect in . We define their intersection number as the number of unrooted binary trees that belong to both and construct a intersection matrix. We are interested in finding the diagonal (up to permutations of rows and columns) submatrices of maximum possible rank for a given . We prove that such diagonal matrices cannot have rank larger than using the CHY formalism. We also prove that the bound is saturated for (the condition is trivial for ), that for the maximum rank is , and that for the maximum rank is . We also ask the following question: Is there a value so that for any the bound is always saturated? We review and extend two relevant results in the literature. The first is the Kawai-Lewellen-Tye (KLT) choice of sets which leads to a block diagonal submatrix with blocks of size with . The second result is that the number of 's that intersect a given one grows as for large which implies that the density of the intersection matrix goes as . We interpret this as an indication that the generic behavior is not seen until , i.e. . We also find an exact formula for the number of zeros in a KLT block.
18 pages, 5 figures