相关论文: Compositionality of planar perfect matchings

In quantum information theory and statistical physics, symmetries of multiple copies, or replicas, of a system play a pivotal role. For unitary ensembles, these symmetries are encoded in the replicated commutant: the algebra of operators…

In their paper Scholze and Weinstein show that a certain diagram of perfectoid spaces is Cartesian. In this paper, we generalize their result. This generalization will be used in a forthcoming paper of ours to compute certain non-trivial…

Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the generating function…

We introduce the fermionic ZW calculus, a string-diagrammatic language for fermionic quantum computing (FQC). After defining a fermionic circuit model, we present the basic components of the calculus, together with their interpretation, and…

In this short note, we show that given a cost function $c$, any coupling $\pi$ of two probability measures where the second is a discrete measure can be associated to a certain bipartite graph containing a perfect matching, based on the…

We derive a simple bijection between geometric plane perfect matchings on $2n$ points in convex position and triangulations on $n+2$ points in convex position. We then extend this bijection to monochromatic plane perfect matchings on…

We introduce some polynomial and analytic methods in the classification program for the complexity of planar graph homomorphisms. These methods allow us to handle infinitely many lattice conditions and isolate the new P-time tractable…

In matching theory, one of the most fundamental and classical branches of combinatorics, {\em canonical decompositions} of graphs are powerful and versatile tools that form the basis of this theory. However, the abilities of the known…

We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of the equal-sized graph matching or subgraph matching, finds wide…

We prove that the map on Balmer spectra induced by a fully faithful geometric functor is a quotient map whose fibers are connected. This is an analogue of the Zariski Connectedness Theorem in algebraic geometry and it can be applied to a…

Cumulant mapping employs a statistical reconstruction of the whole by sampling its parts. The theory developed in this work formalises and extends ad hoc methods of `multi-fold' or `multi-dimensional' covariance mapping. Explicit formulae…

Graphical languages offer intuitive and rigorous formalisms for quantum physics. They can be used to simplify expressions, derive equalities, and do computations. Yet in order to replace conventional formalisms, rigour alone is not…

Snake graphs and their perfect matchings play a key role in the description of cluster variables of cluster algebras associated to surfaces. In this paper, we introduce triangular snake graphs and establish a bijection between their routes…

The ZX-calculus is a powerful framework for reasoning in quantum computing. It provides in particular a compact representation of matrices of interests. A peculiar property of the ZX-calculus is the absence of a formal sum allowing the…

We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…

A Gelfand model for an algebra is a module given by a direct sum of irreducible submodules, with every isomorphism class of irreducible modules represented exactly once. We introduce the notion of a perfect model for a finite Coxeter group,…

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…

We give formulae for the cumulants of complex Wishart (LUE) and inverse Wishart matrices (inverse LUE). Their large-$N$ expansions are generating functions of double (strictly and weakly) monotone Hurwitz numbers which count constrained…

We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…

The goal of this paper is to formalize the notion of The Compositional Integral in The Complex Plane. We prove a convergence theorem guaranteeing its existence. We prove an analogue of Cauchy's Integral Theorem--and suggest an approach at…