Complete k-ary trees and generalized meta-Fibonacci sequences

Abstract : We show that a family of generalized meta-Fibonacci sequences arise when counting the number of leaves at the largest level in certain infinite sequences of k-ary trees and restricted compositions of an integer. For this family of generalized meta-Fibonacci sequences and two families of related sequences we derive ordinary generating functions and recurrence relations.
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.203-214, 2006, DMTCS Proceedings
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01184719
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 17 août 2015 - 16:24:01
Dernière modification le : vendredi 1 juin 2018 - 15:24:01
Document(s) archivé(s) le : mercredi 18 novembre 2015 - 12:11:34

Fichier

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

Identifiants

  • HAL Id : hal-01184719, version 1

Collections

Citation

Chris Deugau, Frank Ruskey. Complete k-ary trees and generalized meta-Fibonacci sequences. 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.203-214, 2006, DMTCS Proceedings. 〈hal-01184719〉

Partager

Métriques

Consultations de la notice

256

Téléchargements de fichiers

99