Related papers: Replacing Pfaffians and applications
Motivated by a polynomial identity of certain iterated integrals, first observed in [CGM20] in the setting of lattice paths, we prove an intriguing combinatorial identity in the shuffle algebra. It has a close connection to de Bruijn's…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues. Strongly regular graphs and complete bipartite graphs are examples of such graphs, but we also construct more exotic families of…
We give an elementary proof of an interesting combinatorial identity which is of particular interest in graph theory and its applications. Two applications to enumeration of forests with closed-form expressions are given.
Quantum determinants and Pfaffians or permanents and Hafnians are introduced on the two parameter quantum general linear group. Fundamental identities among quantum Pf, Hf, and det are proved in the general setting. We show that there are…
We explore the invariant theory of quantum symmetric spaces of orthogonal and symplectic types by employing R-matrix techniques. Our focus involves establishing connections among the quantum determinant, Sklyanin determinants associated…
We define what we call morphisms of Cartan connections. We generalize the main theorems on Cartan connections to theorems on morphisms. Many of the known constructions involving Cartan connections turn out to be examples of morphisms. We…
The Jacobian of a graph is a discrete analogue of the Jacobian of a Riemann surface. In this paper, we explore how Jacobians of graphs change when we glue two graphs along a common subgraph focusing on the case of cycle graphs. Then, we…
We present identities for permutations with fixed points. The formulas are based on successive derivations or integrations of the determinant of a particular matrix.
We lift to the multivariate Eulerian polynomials the identity implying that univariate Eulerian polynomials are palindromic. As a consequence of this generalization, we obtain nice combinatorial identities that can be directly extracted…
Motivated by our attempt to recast Cartan's work on Lie pseudogroups in a more global and modern language, we are brought back to the question of understanding the linearization of multiplicative forms on groupoids and the corresponding…
Some new formulas for the KP hierarchy are derived from the differential Fay identity. They proved to be useful for the $k$-constrained hierarchies providing a series of determinant identities for them. A differential equation is introduced…
Using a probabilistic approach, we derive several interesting identities involving beta functions. Our results generalize certain well-known combinatorial identities involving binomial coefficients and gamma functions.
We develop a canonical pairing between trees and graphs, which passes to their quotients by Jacobi identities. This pairing is an effective and simple tool for understanding the Lie and Poisson operads, providing canonical duals. In the…
We discuss a generic model of Bayesian inference with binary variables defined on edges of a planar graph. The Loop Calculus approach of [1, 2] is used to evaluate the resulting series expansion for the partition function. We show that, for…
An infinite dimensional algebra, which is useful for deriving exact solutions of the generalized pairing problem, is introduced. A formalism for diagonalizing the corresponding Hamiltonian is also proposed. The theory is illustrated with…
I characterize the combinatorially complete pargoids (partial applicative systems) by expandability with two constants that satisfy the well-known identities. An example shows that this class contains more than just the reducts of partial…
The method of graphical vertex-condensation for enumerating perfect matchings of plane bipartite graph was found by Propp (Theoret. Comput. Sci. 303(2003), 267-301), and was generalized by Kuo (Theoret. Comput. Sci. 319 (2004), 29-57) and…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…