A Recurrence Related to Trees
From MaRDI portal
Recommendations
- Linear recurrences originating from polynomial trees
- A recursive algorithm for trees and forests
- Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations
- scientific article; zbMATH DE number 3865301
- Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
Cited in
(28)- Singularity analysis and asymptotics of Bernoulli sums
- A calculus for the random generation of labelled combinatorial structures
- Normal convergence problem? Two moments and a recurrence may be the clues
- Singularity analysis, Hadamard products, and tree recurrences
- On the Lambert \(w\) function
- Forbidden subgraphs in connected graphs
- On Ramanujan's Q-function
- Counting the number of \(\tau\)-exceptional sequences over Nakayama algebras
- Perturbation theory of a symmetric center within Liénard equations
- Recurrence equations over trees in a non-Archimedean context
- A linear-time algorithm for computing the multinomial stochastic complexity
- A refined sign-balance of simsun permutations
- Recurrent and transient trees
- Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees
- A unified approach to linear probing hashing with buckets
- The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
- scientific article; zbMATH DE number 3847396 (Why is no real title available?)
- Components of Random Forests
- scientific article; zbMATH DE number 2042166 (Why is no real title available?)
- Linear recurrences originating from polynomial trees
- Inverse relations and reciprocity laws involving partial Bell polynomials and related extensions
- Enumeration of labeled outerplanar bicyclic and tricyclic graphs
- Uniform asymptotics of some Abel sums arising in coding theory
- Birth and growth of multicyclic components in random hypergraphs
- The birth of the strong components
- Enumeration of labeled connected bipartite graphs with given Betti number
- Derivatives of the tree function
- Zeros of generalized Rogers-Ramanujan series: asymptotic and combinatorial properties
This page was built for publication: A Recurrence Related to Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3825483)