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

DOI10.1134/S1560354717080032zbMATH Open1416.11141OpenAlexW2779296513MaRDI QIDQ1795477FDOQ1795477

Authors: Vsevolod L. Chernyshev, Anton A. Tolchennikov 

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

Recommendations

• 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
• Time-dependent Schrödinger equation: statistics of the distribution of Gaussian packets on a metric graph
• Enumerating graphs and Brownian motion

zbMATH Keywords

dynamical systemslattice pointsmetric graphsBarnes' multiple Bernoulli polynomials

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Asymptotics of the number of endpoints of a random walk on a certain class of directed metric graphs
• Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph
• Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
• The number of endpoints of a random walk on a semi-infinite metric path graph
• Upper bound on saturation time of metric graphs by intervals moving on them
• Asymptotics of the number of end positions of a random walk on a directed Hamiltonian metric graph
• Restricted partitions: the polynomial case
• A metric graph for which the number of possible end positions of a random walk grows minimally

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1795477)