arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.10628math.COhep-thmath-phmath.MP
收藏

${\rm Trop}\, G(2,n)$中${\rm Trop}^+G(2,n)$的对角嵌入集:$n$有临界值吗?

Diagonally Embedded Sets of ${\rm Trop}^+G(2,n)$'s in ${\rm Trop}\, G(2,n)$: Is There a Critical Value of $n$?

Freddy Cachazo

摘要:

热带Grassmannian ${\rm Trop}\, G(2,n)$已知是具有$n$叶的无根度量树的模空间。可以为每个$(n-1)!/2$可能的平面序$α$定义一个正的部分,并与模空间${\rm Trop}^αG(2,n)$中相应的平面树一致。受物理应用的启发,我们研究了${\rm Trop}^αG(2,n)$和${\rm Trop}^βG(2,n)$在${\rm Trop}\, G(2,n)$中相交的方式。我们定义它们的交集数为属于它们的无根二叉树的个数,并构造了一个$(n-1)!/2\times (n-1)!/2$交集矩阵。我们感兴趣的是找到一个给定的$n$的最大可能秩的对角(行和列的排列)子矩阵。我们证明,这样的对角矩阵不能有秩大于$(n-3)!$使用CHY形式主义。我们还证明了该界是饱和的$n=5$(条件是平凡的$n=4$),$n=6$的最大秩是$4$,和$n=7$的最大秩是$\geq 14$。我们还问以下问题:是否有一个值$n_{\rm c}$,使任何$n>n_{\rm c}$的绑定$(n-3)!$总是饱和?我们回顾并推广了文献中的两个相关结果。第一种是Kawai-Lewellen-Tye(KLT)选择集合,其导致$(n-3)!\times (n-3)!$块对角子矩阵,其块大小为$d\times d$,其中$d = \lceil (n-3)/2\rceil !\lfloor (n-3)/2\rfloor !$。第二个结果是,对于大的$n$,与给定的${\rm Trop}^αG(2,n)$相交的${\rm Trop}^αG(2,n)$的数量按照$\exp(n\log (3+\sqrt{8}))$增长,这意味着相交矩阵的密度按照$\exp(-n(\log(n)-2.76))$增长。我们将其解释为直到$n \approx \exp (2.76)$(即$n = 16$)才能看到通用行为的指示。我们还找到了一个精确的公式,在KLT块的零的数量。

英文摘要:

The tropical Grassmannian ${\rm Trop}\, G(2,n)$ is known to be the moduli space of unrooted metric trees with $n$ leaves. A positive part can be defined for each of the $(n-1)!/2$ possible planar orderings, $α$, and agrees with the corresponding planar trees in the moduli space, ${\rm Trop}^αG(2,n)$. Motivated by a physical application we study the way ${\rm Trop}^αG(2,n)$ and ${\rm Trop}^βG(2,n)$ intersect in ${\rm Trop}\, G(2,n)$. We define their intersection number as the number of unrooted binary trees that belong to both and construct a $(n-1)!/2\times (n-1)!/2$ intersection matrix. We are interested in finding the diagonal (up to permutations of rows and columns) submatrices of maximum possible rank for a given $n$. We prove that such diagonal matrices cannot have rank larger than $(n-3)!$ using the CHY formalism. We also prove that the bound is saturated for $n=5$ (the condition is trivial for $n=4$), that for $n=6$ the maximum rank is $4$, and that for $n=7$ the maximum rank is $\geq 14$. We also ask the following question: Is there a value $n_{\rm c}$ so that for any $n>n_{\rm c}$ the bound $(n-3)!$ 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 $(n-3)!\times (n-3)!$ block diagonal submatrix with blocks of size $d\times d$ with $d = \lceil (n-3)/2\rceil !\lfloor (n-3)/2\rfloor !$. The second result is that the number of ${\rm Trop}^αG(2,n)$'s that intersect a given one grows as $\exp(n\log (3+\sqrt{8}))$ for large $n$ which implies that the density of the intersection matrix goes as $\exp(-n(\log(n)-2.76))$. We interpret this as an indication that the generic behavior is not seen until $n \approx \exp (2.76)$, i.e. $n = 16$. We also find an exact formula for the number of zeros in a KLT block.

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

↑