Calculation of Pfaffians by a Chip Removal
- 作者: Aksenov V.1, Kokhas K.1,2
-
隶属关系:
- ITMO University
- St.Petersburg State University
- 期: 卷 215, 编号 6 (2016)
- 页面: 631-648
- 栏目: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/237691
- DOI: https://doi.org/10.1007/s10958-016-2870-6
- ID: 237691
如何引用文章
详细
We describe a new combinatorial-algebraic transformation on graphs which we call “chip removal.” It generalizes the well-known Urban Renewal trick of Propp and Kuperberg. The chip removal is useful in calculations of determinants of adjacency matrices and matching numbers of graphs. A beautiful example of this technique is a theorem on removing four-contact chips, which generalizes Kuo’s graphical condensation method. Numerous examples are given. Bibliography: 10 titles.
作者简介
V. Aksenov
ITMO University
Email: kpk@arbital.ru
俄罗斯联邦, St. Petersburg
K. Kokhas
ITMO University; St.Petersburg State University
编辑信件的主要联系方式.
Email: kpk@arbital.ru
俄罗斯联邦, St. Petersburg; St. Petersburg