Related papers: Spanning tree generating functions and Mahler meas…

We explore a generating function trick which allows us to keep track of infinitely many statistics using finitely many variables, by recording their individual distributions rather than their joint distributions. Building on previous work…

Let $G_n$ be a linear crossed polyomino chain with $n$ four-order complete graphs. In this paper, explicit formulas for the Kirchhoff index, the multiplicative degree-Kirchhoff index and the number of spanning trees of $G_n$ are determined,…

The main purpose of this paper is to derive a new perturbation theory (PT) that has converging series. Such series arise in the nonlocal scalar quantum field theory (QFT) with fractional power potential. We construct PT for the generating…

We report on the derivation of determinant representations for the Green's functions and spectral function of the trapped Tonks-Girardeau gas on the lattice and in the continuum. Our results are valid for any type of statistics of the…

In this paper, we develop a new method to produce explicit formulas for the number $f_{G}(n)$ of rooted spanning forests in the circulant graphs $ G=C_{n}(s_1,s_2,\ldots,s_k)$ and $ G=C_{2n}(s_1,s_2,\ldots,s_k,n).$ These formulas are…

A tree is called k-ended tree if it has at most k leaves, where a leaf is a vertex of degree one. In this paper we prove that every 3-regular connected graph with n vertices such that n is greater than 8 has spanning sub tree with at most…

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

Using a mapping of compact polymers on the Manhattan lattice to spanning trees, we calculate exactly the average number of bends at infinite temperature. We then find, in a high temperature approximation, the energy of the system as a…

We apply symbolic method to deduce functional equation which generating function of counting sequence of dependency trees must satisfy. Then we use Lagrange inversion theorem to obtain concrete expression of the counting sequence. We apply…

A first order differential equation of Green's Function, at the origin G(0), for the one- dimensional lattice is derived by simple recurrence relation. Green's Function at site (m)is then calculated in terms of G(0). A simple recurrence…

The tree spanner problem for a graph $G$ is as follows: For a given integer $k$, is there a spanning tree $T$ of $G$ (called a tree $k$-spanner) such that the distance in $T$ between every pair of vertices is at most $k$ times their…

We study the lattice Green's function (LGF) of the screened Poisson equation on a two-dimensional rectangular lattice. This LGF arises in numerical analysis, random walks, solid-state physics, and other fields. Its defining characteristic…

(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix.…

We study n-point tree amplitudes of N=4 super Yang-Mills theory and N=8 supergravity for general configurations of external particles of the two theories. We construct generating functions for n-point MHV and NMHV amplitudes with general…

This paper develops a finite-difference analogue of the boundary integral/element method for the numerical solution of two-dimensional exterior scattering from scatterers of arbitrary shapes. The discrete fundamental solution, known as the…

Schmidt characterised the class of rayless graphs by an ordinal rank function, which makes it possible to prove statements about rayless graphs by transfinite induction. Halin asked whether Schmidt's rank function can be generalised to…

We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…

The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size -3,-5,-7,... . For such paths, we find the generating functions of them, according to length, ending at level $i$,…

We study a natural problem in graph sparsification, the Spanning Tree Congestion (\STC) problem. Informally, the \STC problem seeks a spanning tree with no tree-edge \emph{routing} too many of the original edges. The root of this problem…

For $d\ge 2$ and an odd prime power $q$, consider the vector space $\mathbb{F}_q^d$ over the finite field $\mathbb{F}_q$, where the distance between two points $(x_1,\ldots,x_d)$ and $(y_1,\ldots,y_d)$ is defined as $\sum_{i=1}^d…