Related papers: Perfect matching problems in cluster algebras and …
We review the construction of exactly solvable lattice models whose continuum limits are $N=2$ supersymmetric models. Both critical and off-critical models are discussed. The approach we take is to first find lattice models with natural…
A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorithmic problem, Perfect Matching Cut, is known to be…
This paper is a contribution to the theory of finite semigroups and their classification in pseudovarieties, which is motivated by its connections with computer science. The question addressed is what role can play the consideration of an…
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…
The similarity of graph structures, such as Meaning Representations (MRs), is often assessed via structural matching algorithms, such as Smatch (Cai and Knight, 2013). However, Smatch involves a combinatorial problem that suffers from…
Graph matching pairs corresponding nodes across two or more graphs. The problem is difficult as it is hard to capture the structural similarity across graphs, especially on large graphs. We propose to incorporate high-order information for…
We study cluster algebras with principal coefficient systems that are associated to unpunctured surfaces. We give a direct formula for the Laurent polynomial expansion of cluster variables in these cluster algebras in terms of perfect…
A one-dimensional cluster model with next-nearest-neighbor interactions and two additional composite interactions is solved; the free energy is obtained and a correlation function is derived exactly. The model is diagonalized by a…
Incompleteness is a common problem for existing knowledge graphs (KGs), and the completion of KG which aims to predict links between entities is challenging. Most existing KG completion methods only consider the direct relation between…
In this work we consider a straightforward linear programming formulation of the recently introduced $\{k\}$-packing function problem in graphs, for each fixed value of the positive integer number $k$. We analyse a special relation between…
Let $G$ be a graph that admits a perfect matching. A {\sf forcing set} for a perfect matching $M$ of $G$ is a subset $S$ of $M$, such that $S$ is contained in no other perfect matching of $G$. This notion originally arose in chemistry in…
The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…
A matching in a graph $G$ is a set of independent edges in $G$. A perfect matching in a graph $G$ is a matching which saturates all the vertices of $G$. A fractional perfect matching in a graph $G$ is a function $h:E(G)\rightarrow [0,1]$…
Let G be a complex reductive algebraic group. We study complete intersections in a spherical homogeneous space G/H defined by a generic collection of sections from G-invariant linear systems. Whenever nonempty, all such complete…
A matching preclusion set of a graph is an edge set whose deletion results in a graph without perfect matching or almost perfect matching. The Cartesian product of $n$ paths is called an $n$-grid graph. In this paper, we study the matching…
Lattice systems with certain Lie algebraic or quantum Lie algebraic symmetries are constructed. These symmetric models give rise to series of integrable systems. As examples the $A_n$-symmetric chain models and the SU(2)-invariant ladder…
In this paper we present a new version of the second author's factorization theorem for perfect matchings of symmetric graphs. We then use our result to solve four open problems of Propp on the enumeration of trimer tilings on the hexagonal…
Given an arbitrary graph $E$ we investigate the relationship between $E$ and the groupoid $G_E$. We show that there is a lattice isomorphism between the lattice of pairs $(H, S)$, where $H$ is a hereditary and saturated set of vertices and…
Catalan numbers arise in many enumerative contexts as the counting sequence of combinatorial structures. In this work, we consider natural Markov chains on some of the realizations of the Catalan sequence. While our main result is in…
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.