2000 character limit reached
Several graph sequences as solutions of a double recurrence
Published 5 Jan 2013 in math.CO | (1301.0874v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.