arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.7251math.CO
收藏

有限图上divisor的秩:几何与计算

The rank of a divisor on a finite graph: geometry and computation

Madhusudan Manjunath

摘要:

我们研究有限图上除数的秩的计算问题,这是Baker和Norine在有限图上的Riemann-Roch理论中提出的一个量(Advances of Mathematics,215(2):766-788,2007)。我们的工作包括两个部分:第一部分是一个算法,其运行时间是多项式的一个固定的顶点数的多重图。更准确地说,我们的算法的运行时间为O(2^{n \log n})poly(size(G)),其中n+1是图G的顶点数。第二部分包括一个新的证明的事实,即测试,如果一个除数的秩是非负的或不是在复杂性类NP交集co-NP和这个证明及其推广的动机,我们构造了一个新的图不变量,我们称之为临界自同构群的图形。

英文摘要:

We study the problem of computing the rank of a divisor on a finite graph, a quantity that arises in the Riemann-Roch theory on a finite graph developed by Baker and Norine (Advances of Mathematics, 215(2): 766-788, 2007). Our work consists of two parts: the first part is an algorithm whose running time is polynomial for a multigraph with a fixed number of vertices. More precisely, our algorithm has running time O(2^{n \log n})poly(size(G)), where n+1 is the number of vertices of the graph G. The second part consists of a new proof of the fact that testing if rank of a divisor is non-negative or not is in the complexity class NP intersection co-NP and motivated by this proof and its generalisations, we construct a new graph invariant that we call the critical automorphism group of the graph.

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

↑