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

The first large-q computation on Heisenberg Cayley graphs confirms projective depletion and the O7 state law, while showing that dense TensorSketch fingerprints remain the final algorithmic obstruction to a reliable extraction of the capacity exponent.

Overview

This article continues the spectral admissibility programme after the geometric repair established in O9. While O9 proved that polynomial-growth Heisenberg Cayley graphs remove the shell-compression obstruction identified in O8, it left open the first actual large-q test of the capacity observable and the extraction of the exponent $\delta$.

O10 performs that next step at the first computationally accessible large prime, $q = 101$, on the Cayley graph of $\mathrm{Heis}_3(\mathbb{Z}/q\mathbb{Z})$ using the $k=3$ permutation-path fingerprint together with a dense TensorSketch approximation.

The result is mixed but structurally decisive. Three positive signals are confirmed at large scale: ball growth remains consistent with the Bass--Guivarc'h law, the mean capacity decays monotonically over a visible pre-saturation window, and the O7 state law remains valid. The negative result is equally important: the log-log fit does not yet yield a reliable $\delta$, not because the Heisenberg setting fails, but because the dense TensorSketch remains computationally misaligned with the irreducible structure of the fingerprint.

Scope statement. This page provides a structured overview. The complete technical analysis, including the TensorSketch bottleneck and the Weil-block roadmap, is presented in the preprint linked above.

Core contributions

Interpretation

O10 shows that the Heisenberg replacement introduced in O9 is not merely geometrically elegant but physically productive: at large $q$, the projective signal is genuinely present. The capacity decreases, the state law survives, and the polynomial-growth background behaves as expected.

In this picture, the capacity exponent $\delta$ remains a property of the underlying projective dynamics rather than of a particular graph family. But measuring it requires not only a non-obstructive geometry, as established by O9, but also a fingerprint representation aligned with the irreducible block structure of the Heisenberg action.

Relation to the Cosmochrony program

O10 follows directly from O9. Spectral admissibility, capacity, rigidity, and stratigraphy define the spectral backbone of the theory. O1 restores ordering through projective dynamics, O3 amplifies the hierarchy via valence growth, O4 constrains the cascade exponent from bounded relational flux, O5 localises the failure of vertex-level mechanisms, O6 proves the no-go for fixed finite-dimensional fingerprints, O7 reformulates the observable in terms of projective capacity, O8 identifies geometric compression on LPS graphs, and O9 removes that compression by moving to polynomial-growth Heisenberg geometry.

The present paper performs the first large-q test in that repaired setting. It confirms that the projective signal is measurable, isolates the final dense-sketch bottleneck, and hands off to O11 the representation-adapted extraction of $\delta$ through Weil blocks.

References

Jérôme Beau. Polynomial-Growth Capacity Dynamics at Large q: Ball Growth Confirmation, Capacity Decay, and the Weil Decomposition Roadmap. Preprint.