Several graph sequences as solutions of a double recurrence

MaRDI QIDQ2944116zbMATH OpenFDO

Authors William J. Keith, Ângela Mestre, Christian Brouder

Publication date 7 September 2015

Full work available at URL https://arxiv.org/abs/1301.0874

zbMATH Keywords

Abel's theoremDziobek's recurrencemultigraphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)

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.

Recommendations

• A recursive enumeration of connected Feynman diagrams with an arbitrary number of external legs in the fermionic non-relativistic interacting gas
• An exact solution method for the enumeration of connected Feynman diagrams
• scientific article; zbMATH DE number 1522333
• Analytic combinatorics of connected graphs
• An algebraic representation of graphs and applications to graph enumeration

Cited in

(3)

• A recurrence template for several parameters in series-parallel graphs
• Repetitions in graphs and sequences
• Generation of n-double scrolls (n=1, 2, 3, 4,...)

This page was built for publication: Several graph sequences as solutions of a double recurrence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944116)