Efficient computation of Ihara coefficients using the Bell polynomial recursion
From MaRDI portal
Publication:665963
DOI10.1016/j.laa.2011.08.017zbMath1236.05110OpenAlexW2036870852WikidataQ60430951 ScholiaQ60430951MaRDI QIDQ665963
Furqan Aziz, Edwin R. Hancock, Marcello Pelillo, Samuel Rota Bulò
Publication date: 7 March 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.08.017
Graph polynomials (05C31) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Zeta and (L)-functions: analytic theory (11M99) Graph operations (line graphs, products, etc.) (05C76)
Related Items (8)
Approximation formulas related to Somos' quadratic recurrence constant ⋮ Some asymptotic expansions on hyperfactorial functions and generalized Glaisher-Kinkelin constants ⋮ Analytical and asymptotic representations for two sequence related to Gauss’ lemniscate functions ⋮ Asymptotic expansions for the constants of Landau and Lebesgue ⋮ Asymptotic expansions related to hyperfactorial function and Glaisher-Kinkelin constant ⋮ Complete asymptotic expansions for the density function of \(t\)-distribution ⋮ Unified approaches to the approximations of the gamma function ⋮ Complete asymptotic expansions related to the probability density function of the χ2-distribution
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum walks, Ihara zeta functions and cospectrality in regular graphs
- Zeta functions of finite graphs and coverings. III
- The zeta function of a hypergraph
- Zeta functions of finite graphs and coverings. II
- Exponential polynomials
- Zeta functions of finite graphs and coverings
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- The zeta-function and Gibbs measures
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
This page was built for publication: Efficient computation of Ihara coefficients using the Bell polynomial recursion
