Related papers: Compositionality of planar perfect matchings
Many multi-loop calculations make use of integration by parts relations to reduce the large number of complicated Feynman integrals that arise in such calculations to a simpler basis of master integrals. Recently, Gluza, Kajda, and Kosower…
Equivalence checking of quantum circuits is a central verification task in quantum computing, ensuring the correctness of circuit optimizations, hardware mappings, and compilation pipelines. Among the primary symbolic methods for this…
Matching minors are a specialisation of minors fit for the study of graph with perfect matchings. The notion of matching minors has been used to give a structural description of bipartite graphs on which the number of perfect matchings can…
A graph $G$ with a perfect matching is called saturated if $G+e$ has more perfect matchings than $G$ for any edge $e$ that is not in $G$. Lov\'asz gave a characterization of the saturated graphs called the cathedral theorem, with some…
Provided the measuring time is short enough, the full counting statistics (FCS) of the charge pumped across a barrier as a result of a series of voltage pulses are shown to be equivalent to the geometry of two planes. This formulation leads…
In this paper, we proposed an procedure to construct the completion of the integrable system by adding a perturbation to the generalized matrix problem, which can be used to continuous integrable couplings, discrete integrable couplings and…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…
Given an integer weighted bipartite graph $\{G=(U\sqcup V, E), w:E\rightarrow \mathbb{Z}\}$ we consider the problems of finding all the edges that occur in some minimum weight matching of maximum cardinality and enumerating all the minimum…
In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and…
We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…
Graphical calculi for representing interacting quantum systems serve a number of purposes: compositionally, intuitive graphical reasoning, and a logical underpinning for automation. The power of these calculi stems from the fact that they…
First, an algebraic criterion for integrability is discussed -the so-called `superintegrability'- and some results on the classification of superintegrable quantum spin Hamiltonians based on sl(2) are obtained. Next, the massive phases of…
With the aim of completing the previous study by A. Or{\l}owski and the author concerning intertwining maps between induced representations and conjugation representation, termed here weighted class operators, we compute the latter…
Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaffian graphs. Additionally, perfect matching width appears to…
Let (W, S) be a Coxeter system. A W-graph is an encoding of a representation of the corresponding Iwahori-Hecke algebra. Especially important examples include the W-graph corresponding to the action of the Iwahori-Hecke algebra on the…
Consider the general linear group, which is not connected but rather has two connected components, the matrices with positive determinant and the ones with negative determinant. Consider the Iwasawa decomposition of its special linear…
Despite the popularity of low-rank matrix completion, the majority of its theory has been developed under the assumption of random observation patterns, whereas very little is known about the practically relevant case of non-random…
In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…
Two series of W-algebras with two generators are constructed from chiral vertex operators of a free field representation. If $c = 1 - 24k$, there exists a W(2,3k) algebra for k in $Z_{+}/2$ and a W(2,8k) algebra for k in $Z_{+}/4$. All…
Quantum computations are typically compiled into a circuit of basic quantum gates. Just like for classical circuits, a quantum compiler should optimize the quantum circuit, e.g. by minimizing the number of required gates. Optimizing quantum…