相关论文: Replacing Pfaffians and applications
Graphical condensation is a technique used to prove combinatorial identities among numbers of perfect matchings of plane graphs. Propp and Kuo first applied this technique to prove identities for bipartite graphs. Yan, Yeh, and Zhang later…
The concept of the quantum Pfaffian is rigorously examined and refurbished using the new method of quantum exterior algebras. We derive a complete family of Pl\"ucker relations for the quantum linear transformations, and then use them to…
The purpose of this note is to exhibit clearly how the "graphical condensation" identities of Kuo, Yan, Yeh and Zhang follow from classical Pfaffian identities by the Kasteleyn-Percus method for the enumeration of matchings. Knuth termed…
Pfaffians of matrices with entries z[i,j]/(x\_i+x\_j), or determinants of matrices with entries z[i,j]/(x\_i-x\_j), where the antisymmetrical indeterminates z[i,j] satisfy the Pl\"ucker relations, can be identified with a trace in an…
Chen's lemma on iterated integrals implies that certain identities involving multiple integrals, such as the de Bruijn and Wick formulas, amount to combinatorial identities for Pfaffians and hafnians in shuffle algebras. We provide direct…
We give a simple formula for some determinants, and an analogous formula for pfaffians, both of which are polynomial identities. The second involve some expressions that interpolate between determinants and pfaffians. We give several…
We give upper bounds on weighted perfect matchings in pfaffian graphs. These upper bounds are better than Bregman's upper bounds on the number of perfect matchings. We show that some of our upper bounds are sharp for 3 and 4-regular…
We give a characterization of Pfaffian graphs in terms of even orientations, extending the characterization of near bipartite non--pfaffian graphs by Fischer and Little \cite{FL}. Our graph theoretical characterization is equivalent to the…
A combinatorial construction proves an identity for the product of the Pfaffian of a skew-symmetric matrix by the Pfaffian of one of its submatrices. Several applications of this identity are followed by a brief history of Pfaffians.
In analogy to the definition of the lambda-determinant, we define a one-parameter deformation of the Dodgson condensation formula for Pfaffians. We prove that the resulting rational function is a polynomial with weights given by the…
We establish identities of Pfaffian type for the theta function associated with twice or half the period matrix of a hyperelliptic curve. They are implied by the large size asymptotic analysis of exact Pfaffian identities for expectation…
The present work continues the program of summing planar Feynman graphs on the world sheet. Although it is based on the same classical action introduced in the earlier work, there are important new features: Instead of the path integral…
The permanent-determinant method and its generalization, the Hafnian-Pfaffian method, are methods to enumerate perfect matchings of plane graphs that was discovered by P. W. Kasteleyn. We present several new techniques and arguments related…
The number of perfect matchings of a $k$-pfaffian graph can be counted by computing a linear combination of the pfaffians of $k$ matrices. The pfaffian number of a graph $G$ is the smallest integer $k$ such that $G$ is $k$-pfaffian. We…
Inspired by some new advances on normal factor graphs (NFGs), we introduce NFGs as a simple and intuitive diagrammatic approach towards encoding some concepts from linear algebra. We illustrate with examples the workings of such an approach…
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…
A well known theorem due to Kasteleyn states that the partition function of an Ising model on an arbitrary planar graph can be represented as the Pfaffian of a skew-symmetric matrix associated to the graph. This results both embodies the…
We prove a product formula for the remaining cases of the weighted enumeration of self-complementary plane partitions contained in a given box where adding one half of an orbit of cubes and removing the other half of the orbit changes the…
A fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces. We show that fullerene graphs have exponentially many perfect matchings.
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…