Colored operads, series on colored operads, and combinatorial generating systems - École des Ponts ParisTech Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics Année : 2019

Colored operads, series on colored operads, and combinatorial generating systems

Résumé

A. We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous grammars, allowing us to work with all these generating systems in a unified way. The theory of bud generating systems uses colored operads. Indeed, an object is generated by a bud generating system if it satisfies a certain equation in a colored operad. To compute the generating series of the languages of bud generating systems, we introduce formal power series on colored operads and several operations on these. Series on colored operads are crucial to express the languages specified by bud generating systems and allow us to enumerate combinatorial objects with respect to some statistics. Some examples of bud generating systems are constructed; in particular to specify some sorts of balanced trees and to obtain recursive formulas enumerating these.
Fichier principal
Vignette du fichier
ColSeries.pdf (494.89 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03152571 , version 1 (25-02-2021)

Identifiants

Citer

Samuele Giraudo. Colored operads, series on colored operads, and combinatorial generating systems. Discrete Mathematics, 2019, ⟨10.1016/j.disc.2019.02.008⟩. ⟨hal-03152571⟩
13 Consultations
100 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More