This repository contains a fast, standalone C implementation of "oracle" necessary to find the singularity (first positive real value at which the generating function diverges) for the generating functions of tree-like combinatorial structures.
This software was originally implemented by Alexis Darrasse in 2010, in the context of his doctoral thesis.
Darrasse, Alexis (2010). "Structures arborescentes complexes: analyse combinatoire, génération aléatoire et applications." (Doctoral dissertation, Paris 6).
Duchon, Philippe, Philippe Flajolet, Guy Louchard, and Gilles Schaeffer (2004). "Boltzmann samplers for the random generation of combinatorial structures." Combinatorics, Probability and Computing, 13(4-5), 577-625.
Pivoteau, Carine, Bruno Salvy and Michèle Soria (2012). "Algorithms for combinatorial structures: Well-founded systems and Newton iterations." Journal of Combinatorial Theory, Series A, 119(8), 1711-1773.