The second term in the asymptotics for the number of points moving along a metric graph

DOI10.1134/S1560354717080032zbMath1416.11141OpenAlexW2779296513MaRDI QIDQ1795477

Anton A. Tolchennikov, Vsevolod L. Chernyshev

Publication date: 16 October 2018

Published in: Regular and Chaotic Dynamics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1560354717080032

zbMATH Keywords

dynamical systemslattice pointsBarnes' multiple Bernoulli polynomialsmetric graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Lattice points in specified regions (11P21) Connectivity (05C40) Combinatorial dynamics (types of periodic orbits) (37E15)

Related Items (6)

Asymptotics of the number of endpoints of a random walk on a certain class of directed metric graphs ⋮ Restricted partitions: the polynomial case ⋮ Asymptotics of the number of end positions of a random walk on a directed Hamiltonian metric graph ⋮ A metric graph for which the number of possible end positions of a random walk grows minimally ⋮ Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph ⋮ The number of endpoints of a random walk on a semi-infinite metric path graph

Cites Work

• Time-dependent Schrödinger equation: statistics of the distribution of Gaussian packets on a metric graph
• Integer points in polyhedra
• Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
• Statistics of Gaussian packets on metric and decorated graphs
• Asymptotic estimate for the counting problems corresponding to the dynamical system on some decorated graphs
• The Lattice Points of Tetrahedra
• The lattice points of an \(n\)-dimensional tetrahedron
• Unnamed Item
• Unnamed Item

This page was built for publication: The second term in the asymptotics for the number of points moving along a metric graph