定向Euler复形与符号完美匹配
Oriented Euler Complexes and Signed Perfect Matchings
摘要:
本文提出了“有向枢转系统”作为一个抽象的框架,互补枢转。给出了余枢路端点符号相反的统一简单证明。一个特殊的情况是双矩阵博弈的纳什均衡在Lemke-Howson路径的两端,具有相反的指标。对于欧拉复形或“oiks”,定义了一个定向,它扩展了已知的定向抽象单纯流形的概念。为一个家庭的定向oiks有序的“房间分区”来对相反的符号。对于一个偶数维的有向OIK,这个符号性质也适用于无序的房间划分。在二维oik的情况下,这些是欧拉图的完美匹配,其符号定义为图的Pfiran方向。对于如下问题,给出了一个近似线性时间算法:给定一个具有欧拉方向的图,该图具有一个完美匹配,找到另一个符号相反的完美匹配。相反,该问题的互补旋转算法可以是指数的。
英文摘要:
This paper presents "oriented pivoting systems" as an abstract framework for complementary pivoting. It gives a unified simple proof that the endpoints of complementary pivoting paths have opposite sign. A special case are the Nash equilibria of a bimatrix game at the ends of Lemke-Howson paths, which have opposite index. For Euler complexes or "oiks", an orientation is defined which extends the known concept of oriented abstract simplicial manifolds. Ordered "room partitions" for a family of oriented oiks come in pairs of opposite sign. For an oriented oik of even dimension, this sign property holds also for unordered room partitions. In the case of a two-dimensional oik, these are perfect matchings of an Euler graph, with the sign as defined for Pfaffian orientations of graphs. A near-linear time algorithm is given for the following problem: given a graph with an Eulerian orientation with a perfect matching, find another perfect matching of opposite sign. In contrast, the complementary pivoting algorithm for this problem may be exponential.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。