Several graph sequences as solutions of a double recurrence
Combinatorics
2015-01-14 v2
Abstract
We describe the combinatorics that arise in summing a double recursion formula for the enumeration of connected Feynman graphs in quantum field theory. In one index the problem is more tractable and yields concise formulas which are combinatorially interesting on their own. In the other index, one of these sums is Sloane's sequence A001865.
Cite
@article{arxiv.1301.0874,
title = {Several graph sequences as solutions of a double recurrence},
author = {Christian Brouder and William J. Keith and Ângela Mestre},
journal= {arXiv preprint arXiv:1301.0874},
year = {2015}
}
Comments
15 pages, 1 figure