Polynomial-Growth Capacity Dynamics at Large 𝑞: Volumetric Growth Confirmation, Capacity Decay, and the Weil Decomposition Roadmap

Read full text Summarise with VIRAT
Authors: Beau Jérôme
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

O9 resolved the geometric obstruction that prevented $\delta$ extraction on LPS graphs by replacing them with Cayley graphs of the discrete Heisenberg group $\mathrm{Heis}_3(\mathbb{Z}/q\mathbb{Z})$, whose polynomial shell growth restores an exploitable BFS window. The present paper performs the first computation at the large prime $q = 101$ ($|G_q| = 1{,}030{,}301$), using a random-walk BFS at fraction $f = 0.20$ and a TensorSketch fingerprint of dimension $D = 16{,}384$.Three results are established positively. The ball growth exponent $\hat{D} = 3.05$ continues the convergence toward the Bass--Guivarc'h prediction $D_{\mathrm hom} = 4$. The mean capacity $\bar\Sigma_n$ decays by $23.5\%$ over the pre-saturation window ($n^* = 13$ BFS steps), providing the first direct evidence of projective depletion at large $q$. The state law $R_n^{(3)} \approx \Phi(\bar\eta_n)$ is confirmed at $q = 101$. The log-log regression gives $\hat{\delta} = 0.01$, which is not a reliable $\delta$ measurement. This reflects a structural incompatibility between the dense TensorSketch and the pre-saturation window: reaching the power-law onset within $|B_n| \leq q^2$ requires $D \gg q^4$ (i.e. $D \gg 10^8$ at $q = 101$), which is computationally impractical. O10 therefore converts this limitation into an algorithmic obstruction: the geometric obstruction of O8--O9 is resolved, and the remaining limitation is representational.We identify two regimes with distinct necessary conditions for a reliable log-log fit of $\delta$, and show that only the second---based on the Weil decomposition of $\rho_{\mathrm aff}^{\otimes 3}$ into blocks of dimension $O(q)$---is computationally viable. The Weil-block fingerprint is formulated as open problem O10-O1; its implementation and the extraction of $\delta$ are deferred.

Fields of Study & Subjects

Limits and Structures in Graph Theory Finite Group Theory Research Analytic Number Theory Research

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
22 March 2026
Language
EN
Document type
Preprint