Extended Rate, more GFUN

Abstract : We present a software package that guesses formulas for sequences of, for example, rational numbers or rational functions, given the first few terms. Thereby we extend and complement Christian Krattenthaler’s program $\mathtt{Rate}$ and the relevant parts of Bruno Salvy and Paul Zimmermann’s $\mathtt{GFUN}$.
Type de document :
Communication dans un congrès
Chassaing, Philippe and others. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, pp.431-434, 2006, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [5 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184691
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 17 août 2015 - 14:23:31
Dernière modification le : jeudi 11 mai 2017 - 01:02:51
Document(s) archivé(s) le : mercredi 18 novembre 2015 - 12:06:41

Fichier

dmAG0140.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184691, version 1

Collections

Citation

Martin Rubey. Extended Rate, more GFUN. Chassaing, Philippe and others. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, pp.431-434, 2006, DMTCS Proceedings. 〈hal-01184691〉

Partager

Métriques

Consultations de la notice

54

Téléchargements de fichiers

81