相关论文: Compositionality of planar perfect matchings

We derive an exact path integral formulation for the partition function for the Ising model using a mapping between spins and poles of a Laurent expansion for a field on the complex plane. The advantage in using this formulation for the…

We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchings. We generalise a result of Robertson, Seymour and Thomas…

We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of…

An equivalence relation in the set of all square binary matrices is described in this work. It is discussed a combinatoric problem about finding the cardinal number and the elements of the factor set according to this relation. We examine…

A graph $G$ is called matching covered if all of its edges are contained in some perfect matching of $G$. Furthermore, a cycle $C \subseteq G$ is called conformal if $G - V(C)$ has a perfect matching and $G$ itself is called cycle-conformal…

We prove a complete complexity classification theorem for the planar eight-vertex model. For every parameter setting in ${\mathbb C}$ for the eight-vertex model, the partition function is either (1) computable in P-time for every graph, or…

Here, we clarify the physical aspects between the discrete Weyl-Wigner (W-W) formalism, well developed in condensed matter physics, and the so-called 'precise Weyl-Wigner calculus for lattice models' recently appearing in the literature. We…

We identify and characterise the conformal window in gauge theories relevant for beyond the standard model building, e.g. Technicolour, using the criteria of metric confinement and causal analytic couplings, which are known to be consistent…

This paper establishes a connection between binary subwords and perfect matchings of a snake graph, an important tool in the theory of cluster algebras. Every binary expansion w can be associated to a piecewise-linear poset P and a snake…

Here we construct the conformal mappings with the help of continuous fractions approximations. These approximations converge to the algebraic roots $\sqrt[N]{z}$ for $N \in \mathbb{N}$ and $z$ from the right half-plane of the complex plane.…

In these Notes, a comprehensive description of the universal fractal geometry of conformally-invariant scaling curves or interfaces, in the plane or half-plane, is given. The present approach focuses on deriving critical exponents…

We consider a 4d non-linear sigma model on the coset $(\mathrm{SU}(N)_L \times \mathrm{SU}(N)_R \times \mathrm{SU}(2))/(\mathrm{SU}(N)_{L+R}\times \mathrm{U}(1))\cong \mathrm{SU}(N) \times S^2$, that features a topological…

The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and \v{Z}ivkovi\'{c}. The application of this problem in chemistry, as well as its interesting theoretical aspects, made this subject very active. In this…

Affine W-algebras are a somewhat complicated family of (topological) associative algebras associated with a semisimple Lie algebra, quantizing functions on the algebraic loop space of Kostant's slice. They have attracted a great deal of…

Counting maximum matchings in a graph is of great interest in statistical mechanics, solid-state chemistry, theoretical computer science, mathematics, among other disciplines. However, it is a challengeable problem to explicitly determine…

A convenient integral representation for zig-zag four-point and two-point planar Feynman diagrams relevant to the bi-scalar D-dimensional fishnet field theory is obtained. This representation gives a possibility to evaluate exactly diagrams…

Our main result is an explicit operator-theoretic formula for the number of colored planar maps with a fixed set of stars each of which has a fixed set of half-edges with fixed coloration. The formula bounds the number of such colored…

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

Let $(W,S)$ be a Coxeter system. A $W$-graph encodes a representation of the Hecke algebra $\mathcal{H}$ of $W$. We construct universal representations of multi-parameter Hecke algebras on certain quotients of path algebras, and study their…

In 2011 Musiker, Schiffler and Williams obtained expansion formulae for cluster algebras from orientable surfaces. For singly and doubly notched arcs these formulae required the notion of $\gamma$-symmetric perfect matchings and…