Back to search
2107.14078

Volume growth for infinite graphs and translation surfaces

P. Colognese, M. Pollicott

correcthigh confidence
Category
math.DS
Journal tier
Specialist/Solid
Processed
Sep 28, 2025, 12:56 AM

Audit review

The paper establishes, under (H1)–(H3), that NG(x,R) ∼ C e^{hR} by: (i) encoding path weights via a countable-edge transfer matrix Mz, (ii) reducing invertibility of I−M̂z to det(I−Wz) for a finite k×k truncation Wz, yielding a meromorphic extension of ηG(z)=∫ e^{-zR} dNG(x,R), (iii) proving h is a simple pole and the only pole on Re z = h, and (iv) applying the Ikehara–Wiener Tauberian theorem to conclude the asymptotic . The candidate solution mirrors parts of this strategy but switches to a finite d×d vertex-level transfer matrix B(s) and then attempts a contour shift via Bromwich inversion. The critical step claims a uniform bound on the resolvent along Re s = h−ε by asserting sup_t ρ(B(h−ε+it)) < 1; this is false since ρ(B(h−ε)) > 1 for ε>0 (entries increase as Re s decreases), and no alternative control of possible singularities on that vertical line is provided. The non-lattice argument correctly excludes additional poles on Re s = h but does not preclude poles with Re s < h arbitrarily close to h, so the contour shift is not justified. The paper’s Tauberian route avoids this pitfall and is logically complete for the stated result .

Referee report (LaTeX)

\textbf{Recommendation:} minor revisions

\textbf{Journal Tier:} specialist/solid

\textbf{Justification:}

The note gives a concise and rigorous proof of exponential path-count growth in infinite graphs with finite vertex set under natural assumptions, and extends the framework to translation surfaces. The reduction from a countable operator to finite matrices is neat and effective, and the Tauberian step is standard and sound. A few clarifications (constant identification, brief comparison with vertex-level operators, explicit Wielandt citation) would polish the exposition.