In this work, we generalize a recursive enumerative formula for connected Feynman diagrams with two external legs. The Feynman diagrams are defined from a fermionic gas with a two-body interaction.

Cubic Graph Generation is a project aimed at efficiently generating cubic graphs. The main objective was to implement an algorithm for enumerating prime cubic graphs using recursive calls, following ...

In mathematical phylogenetics, a labeled rooted binary tree topology can possess any of a number of labeled histories, each of which represents a possible temporal ordering of its coalescences.

Abstract: We consider enumeration and construction of points on diagonal and Hermitian surfaces. We give a recursive construction technique for the set of rational points of Hermitian surfaces. Then ...

The College Mathematics Journal emphasizes the first two years of the college curriculum. The journal contains a wealth of material for teachers and students. A wide range of topics will keep you ...