Related papers: A Pfaffian formula for the monomer-dimer model on …
We give upper bounds on weighted perfect matchings in pfaffian graphs. These upper bounds are better than Bregman's upper bounds on the number of perfect matchings. We show that some of our upper bounds are sharp for 3 and 4-regular…
We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…
For a polynomial f: {-1, 1}^n --> C, we define the partition function as the average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is a parameter. We present a quasi-polynomial algorithm, which, given such f, lambda…
Theoretical results from discrete geometry suggest that normed spaces can abstractly embed finite metric spaces with surprisingly low theoretical bounds on distortion in low dimensions. In this paper, inspired by this theoretical insight,…
Combining the properties of monovariate internal functions as proposed in Kolmogorov superimposition theorem, in tandem with the bounds wielded by the multivariate formulation of Chebyshev inequality, a hybrid model is presented, that…
A surface integral representation of Maxwell's equations allows the efficient electromagnetic (EM) modeling of three-dimensional structures with a two-dimensional discretization, via the boundary element method (BEM). However, existing BEM…
The immersed boundary method (IBM) of Peskin (J. Comput. Phys., 1977), and derived forms such as the projection method of Taira and Colonius (J. Comput. Phys., 2007), have been useful for simulating flow physics in problems with moving…
We introuduce a unified method which can be applied to any WZW model at arbitrary level to search systematically for modular invariant physical partition functions. Our method is based essentially on modding out a known theory on group…
A graphical expansion formula for non-commutative matrix integrals with values in a finite-dimensional real or complex von Neumann algebra is obtained in terms of ribbon graphs and their non-orientable counterpart called Moebius graphs. The…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…
The correlation functions of an arbitrary number of boundary monomers in the system of close-packed dimers on the square lattice are computed exactly in the scaling limit. The equivalence of the 2n-point correlation functions with those of…
In this note, we propose a straightforward method to produce an straight-line embedding of a planar graph where one face of a graph is fixed in the plane as a star-shaped polygon. It is based on minimizing discrete Dirichlet energies,…
A Radial Basis Function Generated Finite-Differences (RBF-FD) inspired technique for evaluating definite integrals over bounded volumes that have smooth boundaries in three dimensions is described. A key aspect of this approach is that it…
We present a new method of bosonization of fermion systems applicable when the partition function is dominated by composite bosons. Restricting the partition function to such states we get an euclidean bosonic action from which we derive…
Each partition $\lambda = (\lambda_1, \lambda_2, ..., \lambda_n)$ determines a so-called Ferrers tableau or, equivalently, a Ferrers bipartite graph. Its edge ideal, dubbed Ferrers ideal, is a squarefree monomial ideal that is generated by…
In this note we shall introduce a simple, effective numerical method for solving partial differential equations for scalar and vector-valued data defined on surfaces. Even though we shall follow the traditional way to approximate the…
We construct a stationary density functional for the partition function from a chosen set of one (boson) line irreducible Feynman diagrams. The construction does not proceed by the inversion of a Legendre transform. It is formulated for…
Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…
In this paper we introduce the notion of $\Sigma$-colouring of a graph $G$: For given subsets $\Sigma(v)$ of neighbours of $v$, for every $v\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that…
For a fixed graph class $\Pi$, the goal of $\Pi$-Modification is to transform an input graph $G$ into a graph $H\in\Pi$ using at most $k$ modifications. Vertex and edge deletions are common operations, and their (parameterized) complexity…