相关论文: Full support of the Kasteleyn operator associated …

We construct all possible Hamiltonian torus actions for which all the non-empty reduced spaces are two dimensional (and not single points) and the manifold is connected and compact, or, more generally, the moment map is proper as a map to a…

In this paper we find the exchange graph of the rank n binomial Laurent phenomenon algebra associated to the complete graph on n vertices. More specifically, we prove that this exchange graph is isomorphic to that of the rank n linear…

We prove that any compact selfdual Einstein 4-orbifold of positive scalar curvature whose isometry group contains a 2-torus is, up to an orbifold covering, a quaternion Kaehler quotient of (k-1)-dimensional quaternionic projective space by…

The matrix normed structure of the unitization of a (non-selfadjoint) operator algebra is determined by that of the original operator algebra. This yields a classification up to completely isometric isomorphism of two-dimensional unital…

In this paper, we prove that the 2-factor polynomial, an invariant of a planar trivalent graph with a perfect matching, counts the number of 2- factors that contain the the perfect matching as a subgraph. Consequently, we show that the…

A linear operator on a finite dimensional nonzero real vector space may not have an eigenvalue. We define a related notion of a true-pair of a linear operator, and then show that each linear operator on a finite dimensional nonzero real…

Let $n \equiv 0\, (\, \text{mod } 3\,)$ and $H_{n, n/3}^2$ be the 3-graph of order $n$, whose vertex set is partitioned into two sets $S$ and $T$ of size $\frac{1}{3}n+1$ and $\frac{2}{3}n -1$, respectively, and whose edge set consists of…

A perfect $K_r$-tiling in a graph $G$ is a collection of vertex-disjoint copies of the graph $K_r$ in $G$ that covers all vertices of $G$. In this paper, we prove that the threshold for the existence of a perfect $K_{r}$-tiling of a…

The Exact Matching problem asks whether a bipartite graph with edges colored red and blue admits a perfect matching with exactly $t$ red edges. Introduced by Papadimitriou and Yannakakis in 1982, the problem has resisted deterministic…

We investigate the space complexity of certain perfect matching problems over bipartite graphs embedded on surfaces of constant genus (orientable or non-orientable). We show that the problems of deciding whether such graphs have (1) a…

The purpose of this note is to rephrase Speyer's elegant topological proof for Kasteleyn's Theorem in a simple graph theoretical manner.

Hadwiger's conjecture for the immersion relation posits that every graph $G$ contains an immersion of the complete graph $K_{\chi(G)}$. Vergara showed that this is equivalent to saying that every $n$-vertex graph $G$ with $\alpha(G)=2$…

We introduce a general model of dimer coverings of certain plane bipartite graphs, which we call rail yard graphs (RYG). The transfer matrices used to compute the partition function are shown to be isomorphic to certain operators arising in…

In this paper, Theorems 1.1- 1.2 show that the Boussinesq operator $\mathcal{B}_tf$ converges pointwise to its initial data $f\in H^s(\mathbb{R})$ as $t\to 0$ provided $s\geq\frac{1}{4}$ -- more precisely -- on the one hand, by constructing…

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…

The inverse Kasteleyn matrix of a bipartite graph holds much information about the perfect matchings of the system such as local statistics which can be used to compute local and global asymptotics. In this paper, we consider three…

For a family of integer-valued height functions defined over the faces of planar graphs, we establish a relation between the probability of connection by level sets and the spin-spin correlations of the dual $O(2)$ symmetric spin models…

Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields…

Each knot invariant can be extended to singular knots according to the skein rule. A Vassiliev invariant of order at most $n$ is defined as a knot invariant that vanishes identically on knots with more than $n$ double points. A chord…

The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…