Related papers: Spanning tree generating functions and Mahler meas…
Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate…
We study Green functions for the pressure of stationary Stokes systems in a (possibly unbounded) domain $\Omega\subset \mathbb{R}^d$, where $d\ge 2$. We construct the Green function when coefficients are merely measurable in one direction…
Symmetric edge polytopes of graphs and root polytopes of semi-balanced digraphs are two classes of lattice polytopes whose $h^*$-polynomials have interesting properties and generalize important graph polynomials. For both classes of…
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…
Let $G_n$ be a graph obtained by the strong product of $P_2$ and $C_n$, where $n\geqslant3$. In this paper, explicit expressions for the Kirchhoff index, multiplicative degree-Kirchhoff index and number of spanning trees of $G_n$ are…
We present a new method for calculating the Green functions for a lattice scalar field theory in $D$ dimensions with arbitrary potential $V(\phi)$. The method for non-perturbative evaluation of Green functions for $D \! = \! 1$ is…
The register function (or Horton-Strahler number) of a binary tree is a well-known combinatorial parameter. We study a reduction procedure for binary trees which offers a new interpretation for the register function as the maximal number of…
We prove that every connected graph with $s$ vertices of degree not 2 has a spanning tree with at least ${1\over 4}(s-2)+2$ leaves. Let $G$ be a be a connected graph of girth $g$ with $v>1$ vertices. Let maximal chain of successively…
A representation of Lattice Gauge Theories (LGT) suitable for simulations with tensor network state methods or with quantum computers requires a truncation of the Hilbert space to a finite dimensional approximation. In particular for U(1)…
In this paper algebraic and combinatorial properties and a computation of the number of the spanning trees are developed for certain graphs. To this purpose, an original method, independent of the spectrum of the Laplacian matrix associated…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
We prove, that every connected graph with $s$ vertices of degree 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${2\over 5}t +{1\over 5}s+\alpha$ leaves, where $\alpha \ge {8\over 5}$. Moreover, $\alpha \ge 2$ for…
Using the theoretical basis developed by Yao and Zeilberger, we consider certain graph families whose structure results in a rational generating function for sequences related to spanning tree enumeration. Said families are Powers of Cycles…
A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…
Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…
Recently we introduced the hypergraph matrix model (HMM), a Hermitian matrix model generalizing the classical Gaussian Unitary Ensemble (GUE). In this model the Gaussians of the GUE, whose moments count partitions of finite sets into pairs,…
Recently, Zheng and Wu defined the concept of odd spanning tree of a graph, meaning a spanning tree in which every vertex has odd degree. Similar to Cayley's formula, Feng, Chen and Wu counted the number of odd spanning trees in complete…
This work presents an efficient method for evaluation of wave scattering by doubly periodic diffraction gratings at or near "Wood anomaly frequencies". At these frequencies, one or more grazing Rayleigh waves exist, and the lattice sum for…
We define two families of determinantal random spanning subgraphs of a finite connected graph, one supported by acyclic spanning subgraphs (spanning forests) with fixed number of connected components, the other by connected spanning…
Schreier formula for the rank of a subgroup of finite index of a finitely generated free group $F$ is generalized to an arbitrary (even infinitely generated) subgroup $H$ through the Schreier transversals of $H$ in $F$. The rank formula may…