English

Arithmetic Landscape Functions of a Discrete Cat Map

Dynamical Systems 2026-07-26 v1

Abstract

We study the diagonal Green function u~(x)=[LN1]x,x\widetilde{u}(x)=[L_N^{-1}]_{x,x} of the operator LN=IαPL_N=I-\alpha P on the finite torus (Z/NZ)2(\mathbb{Z}/N\mathbb{Z})^2, where PP is the transfer operator of the discrete cat map TN(x)=AxmodNT_N(x)=Ax \bmod N. We prove the exact formula u~(x)=(1αkx)1\widetilde{u}(x)=(1-\alpha^{k_x})^{-1}, where kxk_x is the minimal period of xx under TNT_N. This formula appears to be new. It shows that the diagonal landscape is a complete spectral invariant of the orbit structure, depending on each point only through its orbit length. Since det(AI)=1\det(A-I)=-1 is a unit in Z/NZ\mathbb{Z}/N\mathbb{Z} for every N2N\ge2, the origin is the unique fixed point of TNT_N and the unique global maximum of u~\widetilde{u}. The resulting localization is driven by arithmetic alone, with no disorder and no broken symmetry, a mechanism distinct from classical Anderson theory and from Filoche--Mayboroda landscape theory. We further establish the Chandra Green--Zeta Identity, showing that the Green trace satisfies tr(GN)=N2αddαlogZN(α)\operatorname{tr}(G_N)=N^2-\alpha\frac{d}{d\alpha}\log Z_N(\alpha), where ZNZ_N is the dynamical zeta function of TNT_N, and that a Laplacian perturbation degrades the localization gap at first order in ε\varepsilon. All results are verified computationally.

Cite

@article{arxiv.2607.24857,
  title  = {Arithmetic Landscape Functions of a Discrete Cat Map},
  author = {Aryaman Chandra},
  journal= {arXiv preprint arXiv:2607.24857},
  year   = {2026}
}

Comments

15 pages, 6 figures