Exhaustive generation of atomic combinatorial differential operators

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 s...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 536; pp. 62 - 69
Main Authors Tremblay, Hugo, Labelle, Gilbert, Brlek, Srečko, Blondin Massé, Alexandre
Format Journal Article
LanguageEnglish
Published Elsevier B.V 29.05.2014
Subjects
Algorithm
Differential operator
Enumerative combinatorics
Molecular species
Species theory
Enumerative combinatorics
Molecular species
Species theory
Differential operator
Algorithm
Online AccessGet full text
ISSN0304-3975
1879-2294
DOI10.1016/j.tcs.2014.02.029

Cover

More Information
Summary: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).
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2014.02.029