Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
type: Item
instance of: scholarly article
title: Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
zbMATH Open document ID: 1377.05027
DOI: 10.1134/S1061920817030025
published in: Russian Journal of Mathematical Physics
publication date: 2018-01-05T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C62
zbMATH DE Number: 6822598
zbMATH Keywords: polynomial approximation
zbMATH Keywords: Barnes' multiple Bernoulli polynomials
author: Vsevolod L. Chernyshev
author: Anton A. Tolchennikov
MaRDI profile type: Publication
cites work: Asymptotic estimate for the counting problems corresponding to the dynamical system on some decorated graphs
cites work: Statistics of Gaussian packets on metric and decorated graphs
cites work: Time-dependent Schrödinger equation: statistics of the distribution of Gaussian packets on a metric graph
cites work: Behavior of quasi-particles on hybrid spaces. Relations to the geometry of geodesics and to the problems of analytic number theory
cites work: The Lattice Points of Tetrahedra
cites work: The lattice points of an \(n\)-dimensional tetrahedron
cites work: Integer points in polyhedra
cites work: Q4071328
cites work: THE GEOMETRY OF TORIC VARIETIES
cites work: Q4031179
cites work: Note on Norlund's Polynomial B (z) n
cites work: The Arithmetical Invariants of Algebraic Loci
cites work: Relations for Bernoulli-Barnes numbers and Barnes zeta functions
cites work: Topological methods in algebraic geometry. Translation from the German and appendix one by R. L. E. Schwarzenberger. Appendix two by A. Borel.
cites work: Simultaneous approximation to algebraic numbers by rationals
full work available at URL: s1061920817030025
OpenAlex ID: W2752144231
Recommended article: The second term in the asymptotics for the number of points moving along a metric graph
Recommended article: On a random search tree: asymptotic enumeration of vertices by distance from leaves – CORRIGENDUM
Recommended article: Q4993545
Recommended article: Effective mixing and counting in trees – CORRIGENDUM
Recommended article: On a random search tree: asymptotic enumeration of vertices by distance from leaves
Recommended article: Search trees: metric aspects and strong limit theorems
Recommended article: Asymptotics of the number of endpoints of a random walk on a certain class of directed metric graphs
Recommended article: Correction to: ``Counting minimum weight arborescences''
Recommended article: Asymptotics for Euclidean minimal spanning trees on random points
description: scientific article; zbMATH DE number 6822598