Tremblay Hugo, Labelle Gilbert, Brlek Srečko et Blondin Massé Alexandre. (2014). Exhaustive generation of atomic combinatorial differential operators. Theoretical Computer Science, 536, p. 62-69.
Prévisualisation |
PDF
- Version acceptée
Disponible sous licence Creative Commons (CC-BY-NC-ND 2.5). 371kB |
URL officielle: http://dx.doi.org/doi:10.1016/j.tcs.2014.02.029
Résumé
Labelle and Lamathe introduced in 2009 a generalization of the standard combinatorial differential species operator D, by giving a combinatorial interpretation to Ω(X, D)F(X), where Ω(X, T) and F(X) are two-sort and one-sort species respectively. One can show that such operators can be decomposed as sums of products of simpler operators called atomic combinatorial differential operators. In their paper, Labelle and Lamathe presented a list of the first atomic differential operators. In this paper, we describe an algorithm that allows to generate (and enumerate) all of them, subject to available computer resources. We also give a detailed analysis of how to compute the molecular components of Ω(X, D)F(X).
Type de document: | Article publié dans une revue avec comité d'évaluation |
---|---|
ISSN: | 03043975 |
Volume: | 536 |
Pages: | p. 62-69 |
Version évaluée par les pairs: | Oui |
Date: | 2014 |
Identifiant unique: | 10.1016/j.tcs.2014.02.029 |
Sujets: | Sciences naturelles et génie > Sciences mathématiques |
Département, module, service et unité de recherche: | Départements et modules > Département d'informatique et de mathématique |
Mots-clés: | enumerative combinatorics, species theory, molecular species, differential operator, algorithm |
Déposé le: | 16 déc. 2020 20:18 |
---|---|
Dernière modification: | 16 déc. 2020 20:18 |
Éditer le document (administrateurs uniquement)