21744 articles – 15574 Notices  [english version]
HAL : inria-00622853, version 1

Voir la fiche détaillée  BibTeX,EndNote,...
Journal of Combinatorial Theory, Series A 119, 8 (2012) 1711-1773
Algorithms for combinatorial structures: Well-founded systems and Newton iterations.
Carine Pivoteau 1, Bruno Salvy 2, Michele Soria 3
(01/11/2012)

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the constructible classes of Flajolet and Sedgewick with Joyal's species theory. We extend the implicit species theorem to structures of size zero. A quadratic iterative Newton method is shown to solve well-founded systems combinatorially. From there, truncations of the corresponding generating series are obtained in quasi-optimal complexity. This iteration transfers to a numerical scheme that converges unconditionally to the values of the generating series inside their disk of convergence. These results provide important subroutines in random generation. Finally, the approach is extended to combinatorial differential systems.
1 :  Laboratoire d'Informatique Gaspard-Monge (LIGM)
Université Paris-Est Marne-la-Vallée (UPEMLV) – ESIEE – Ecole des Ponts ParisTech – Fédération de Recherche Bézout – CNRS : UMR8049
2 :  ARIC (Inria Grenoble Rhône-Alpes / LIP Laboratoire de l'Informatique du Parallélisme)
INRIA – CNRS : UMR5668 – Université Claude Bernard - Lyon I – École Normale Supérieure - Lyon
3 :  Laboratoire d'Informatique de Paris 6 (LIP6)
CNRS : UMR7606 – Université Pierre et Marie Curie [UPMC] - Paris VI
Algo
Algorithms
APR
Mathématiques/Combinatoire
Species theory – analytic combinatorics – generating series – complexity.
Liste des fichiers attachés à ce document :
PDF
newtonOracleLong.pdf(1 MB)