度量化图的τ常数与边连通度
The tau constant and the edge connectivity of a metrized graph
摘要:
τ常数是度量化图的一个重要不变量,它在曲线的算术性质中有应用。我们展示了如何在连续的边收缩和删除下度量化图的τ常数的变化。我们发现的身份,我们称之为“收缩”,“删除”和“收缩删除”的身份上的度量化图。通过建立基于边连通度的τ常数下界,证明了Baker和Rumely关于τ常数的下界猜想对边连通度大于等于5的度量化图成立.我们证明,证明这个猜想的3-正则图是足够的证明它的所有图。
英文摘要:
The tau constant is an important invariant of a metrized graph, and it has applications in arithmetic properties of curves. We show how the tau constant of a metrized graph changes under successive edge contractions and deletions. We discover identities which we call "contraction", "deletion", and "contraction-deletion" identities on a metrized graph. By establishing a lower bound for the tau constant in terms of the edge connectivity, we prove that Baker and Rumely's lower bound conjecture on the tau constant holds for metrized graphs with edge connectivity 5 or more. We show that proving this conjecture for 3-regular graphs is enough to prove it for all graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。