QR-Code

New combinatorial computational methods arising from pseudo-singletons

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

Ausführliche Beschreibung

Gespeichert in:
Bibliografische Detailangaben
1. Verfasser: Gilbert Labelle
Format: Artigo
Sprache:Inglês
Veröffentlicht: Discrete Mathematics & Theoretical Computer Science 2008-01-01
Schriftenreihe:Discrete Mathematics & Theoretical Computer Science
Schlagworte:
Online-Zugang:https://dmtcs.episciences.org/3651/pdf
Tags: Tag hinzufügen
Keine Tags, Fügen Sie das erste Tag hinzu!