New combinatorial computational methods arising from pseudo-singletons

Abstract : Since singletons are the connected sets, the species $X$ of singletons can be considered as the combinatorial logarithm of the species $E(X)$ of finite sets. In a previous work, we introduced the (rational) species $\widehat{X}$ of pseudo-singletons as the analytical logarithm of the species of finite sets. It follows that $E(X) = \exp (\widehat{X})$ in the context of rational species, where $\exp (T)$ denotes the classical analytical power series for the exponential function in the variable $T$. In the present work, we use the species $\widehat{X}$ to create new efficient recursive schemes for the computation of molecular expansions of species of rooted trees, of species of assemblies of structures, of the combinatorial logarithm species, of species of connected structures, and of species of structures with weighted connected components.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [12 references]

https://hal.inria.fr/hal-01185187
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 19, 2015 - 11:45:10 AM
Last modification on : Friday, March 27, 2020 - 3:18:03 PM
Long-term archiving on: : Friday, November 20, 2015 - 10:43:33 AM

File

dmAJ0122.pdf
Publisher files allowed on an open archive

Citation

Gilbert Labelle. New combinatorial computational methods arising from pseudo-singletons. 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), 2008, Viña del Mar, Chile. pp.247-258, ⟨10.46298/dmtcs.3651⟩. ⟨hal-01185187⟩

Record views