1. V. L. Chernyshev and A.A. Tolchennikov, “Asymptotic Estimate for the Counting Problems Corresponding to the Dynamical System on Some Decorated Graphs,” Ergodic Theory and Dynamical Systems, Cambridge University Press, 1–12 (2017), DOI:10.1017/etds.2016.102.
2. V. L. Chernyshev and A. I. Shafarevich, “Statistics of Gaussian Packets on Metric and Decorated Graphs,” Philosophical Transactions of the Royal Society A. 372 (2007), Article number: 20130145 (2014), DOI: 10.1098/rsta.2013.0145.
3. B. Borda, “Lattice Points in Algebraic Cross-Polytopes and Simplices,” Working papers by Series math-ph ”arxiv.org”./2016/08. arXiv:1608.02417 [math.NT], pp. 27 (2016).
4. V. L. Chernyshev and A.A. Tolchennikov, “How the Permutation of Edges of a Metric Graph Affects the Number of Points Moving Along the Edges,” Working papers by Series math-ph ”arxiv.org”./2014/10. No.1410.5015. http://arxiv.org, pp. 12 (2014).
5. V. L. Chernyshev, “Time-dependent Schrödinger equation: statistics of the distribution of Gaussian packets on a metric graph,” Trudy Mat. Inst. Steklova 270, 249–265 (2010) [Proc. Steklov Inst. Math. 270, 246–262 (2010)].