[Paper Review] Dimer lambda_d Expansion, Dimensional Dependence of J_n Kernels

Paul Federbush|ArXiv.org|Jun 11, 2008

Theoretical and Computational Physics2 references3 citations

TL;DR

This paper establishes that the kernels $\bar{J}_n$ in the dimer $\lambda_d$ asymptotic expansion exhibit a strict dimensional dependence of the form $\bar{J}_n = \frac{C_r}{d^r} + \cdots + \frac{C_{n-1}}{d^{n-1}}$ with $r \geq n/2$, proving that these kernels decay at least as fast as $d^{-n/2}$. The result is derived via topological graph analysis and summation bounds over vertex configurations, providing a rigorous foundation for the asymptotic behavior of $\lambda_d$ in high dimensions.

ABSTRACT

In previous papers an asymptotic expansion for the dimer lambda_d of the form lambda_d ~ (1/2)ln(2d) - 1/2 + c_1/d + c_2/d^2 ... was developed. Kernels J_n were a key ingredient in the theory. Herein we prove J_n are of the form J_n = C_r/d^r + C_(r+1)/d^(r+1) + ... + C_(n-1)/d^(n-1) with r > (n/2)-1.

Motivation & Objective

• To rigorously establish the dimensional dependence of the $\bar{J}_n$ kernels in the asymptotic expansion of the dimer $\lambda_d$.
• To provide a mathematical foundation for the asymptotic theory of $\lambda_d$ by bounding the behavior of $\bar{J}_n$ in terms of dimension $d$.
• To prove that $\bar{J}_n$ is expressible as a series in inverse powers of $d$, starting no later than $d^{-n/2}$, using graph-theoretic and summation techniques.
• To extend the applicability of the $\lambda_d$ asymptotic expansion to higher dimensions by proving decay bounds on the kernel terms.

Proposed method

• Analyzes the weighted sum of graphs with $n$ edges, where edges are either solid (representing $f$) or dashed (representing $f_0$), and vertices are summed over with one fixed.
• Uses topological equivalence of graphs to group contributions by structure, focusing on nondegenerate graphs (all edges in closed loops) and degenerate graphs (with free edges).
• Applies a Sum Bound argument: for nondegenerate graphs, the weighted sum over vertices is bounded by $O(d^{-n/2})$, derived from counting vertex configurations along paths with $\ell_j$ edges, each contributing at most $O(d^{\ell_j/2})$ terms.
• Reduces degenerate graphs (with free edges) to linear combinations of nondegenerate graphs by variable substitution and vertex matching, using the observation that unmatched sums vanish in the $N \to \infty$ limit.
• Employs induction on the number of free edges, replacing sums over free edge positions with minus the sum over all possible matches between float and ground components, ensuring cancellation when no overlap occurs.
• Leverages Fact 1 that $\psi_c$ depends only on graph topology, not $d$, so bounds on weighted sums depend only on structure and dimension.

Experimental results

Research questions

• RQ1 What is the precise dimensional dependence of the $\bar{J}_n$ kernels in the asymptotic expansion of $\lambda_d$?
• RQ2 Can the decay rate of $\bar{J}_n$ in $d$ be rigorously bounded, and if so, what is the minimal power of $d$ in its expansion?
• RQ3 How do topological features of graphs (e.g., loops, free edges) affect the asymptotic behavior of $\bar{J}_n$ in high dimensions?
• RQ4 Can degenerate graphs (with free edges) be systematically reduced to nondegenerate forms without loss of generality in the $N \to \infty$ limit?

Key findings

• The $\bar{J}_n$ kernels are shown to have an expansion of the form $\bar{J}_n = \frac{C_r}{d^r} + \cdots + \frac{C_{n-1}}{d^{n-1}}$ with $r \geq n/2$, proving a minimal decay rate of $d^{-n/2}$.
• The weighted sum of graphs of a nondegenerate topological type with $n$ edges is bounded by $O(d^{-n/2})$, derived from path-based vertex summation with $O(d^{\ell_j/2})$ contributions per segment.
• Degenerate graphs with free edges are reducible to linear combinations of nondegenerate graphs via vertex matching, with contributions vanishing unless the float overlaps the ground.
• The key observation that unmatched sums over free edges vanish in the $N \to \infty$ limit allows replacement of complex graph sums with simpler, equivalent forms.
• The result confirms that $\bar{J}_1 = 0$, consistent with prior computations and supporting the asymptotic structure of $\lambda_d$.
• The analysis confirms that equations (22)–(27) in [2], which compute $\bar{J}_n$ for $n \leq 6$, are consistent with the general form $\bar{J}_n = \sum_{k=r}^{n-1} \frac{C_k}{d^k}$ with $r \geq n/2$.