Efficient computation of Ihara coefficients using the Bell polynomial recursion
From MaRDI portal
Publication:665963
Recommendations
Cites work
- Exponential polynomials
- scientific article; zbMATH DE number 3120273 (Why is no real title available?)
- scientific article; zbMATH DE number 1495995 (Why is no real title available?)
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- Quantum walks, Ihara zeta functions and cospectrality in regular graphs
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- The zeta function of a hypergraph
- The zeta-function and Gibbs measures
- Zeta functions of finite graphs and coverings
- Zeta functions of finite graphs and coverings. II
- Zeta functions of finite graphs and coverings. III
Cited in
(9)- Some asymptotic expansions on hyperfactorial functions and generalized Glaisher-Kinkelin constants
- Asymptotic expansions related to hyperfactorial function and Glaisher-Kinkelin constant
- Graph characterization by counting sink star subgraphs
- Asymptotic expansions for the constants of Landau and Lebesgue
- Complete asymptotic expansions related to the probability density function of the ^2-distribution
- Unified approaches to the approximations of the gamma function
- Analytical and asymptotic representations for two sequence related to Gauss’ lemniscate functions
- Complete asymptotic expansions for the density function of \(t\)-distribution
- Approximation formulas related to Somos' quadratic recurrence constant
This page was built for publication: Efficient computation of Ihara coefficients using the Bell polynomial recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q665963)