On the exponential generating function of labelled trees
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3957111 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 3105868 (Why is no real title available?)
- A Survey of Transcendentally Transcendental Functions
- A computable extension for D-finite functions: DD-finite functions
- Algebraic Relations Among Solutions of Linear Differential Equations
- Analytic combinatorics
- Bell numbers, their relatives, and algebraic differential equations
- COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS
- Computing with D-algebraic power series
- Differentiably finite power series
- On some non-holonomic sequences
- On the Lambert \(w\) function
- On the non-holonomic character of logarithms, powers, and the \(n\)th prime function
- Proofs from THE BOOK
- Some structural results on \(\mathrm{D}^n\)-finite functions
- The nonminimality of the differential closure
Cited in
(8)- Generalized (\(P\), \(\omega\))-partitions and generating functions for trees
- An extension of holonomic sequences: \(C^2\)-finite sequences
- Generating functions for multi-labeled trees
- The lambda extensions of the Ising correlation functions C(M,N)
- Note on the exponential recursive k-ary trees
- Limiting distributions for the number of inversions in labelled tree families
- Generating functions for generating trees
- Finitely labeled generating trees and restricted permutations
This page was built for publication: On the exponential generating function of labelled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219985)
