Integral saturation of adjacency-degree lattices
Abstract
Let A be the adjacency matrix of G∼ G(n,1/2), let D=diag(A1), and let ΛG=ℤ⟨ A,D⟩1. We prove Pr[ΛG≠ℤn]≤ n−3/20+o(1). Thus two dependent graph operators generate the entire vertex lattice from the constant vector, simultaneously over every prime field. Adjacency alone has a modulo-two rank obstruction for every simple graph of order greater than one, even though its rational word span is typically full. The proof first constructs words containing at most two adjacency operations whose integer span contains ΔG3ℤn, where ΔG is the product of the pairwise differences between distinct degree values. This confines all possible arithmetic obstructions to a finite prime range on a single event. We then remove the remaining obstructions using conditional alternating forms, symmetric random-matrix code estimates, and uniform counts of degree-graded invariant subspaces. We connect the integer lattice to graph reconstruction through pointed moments. Saturation forces every pointed orthogonal AD intertwiner to be a vertex permutation. The short-word construction also shows that a fixed polynomial-size family of ordinary caterpillars, of diameter at most seven and order O(√(nlog n)), identifies almost every graph among all finite simple graphs. For nonsaturated full-rank lattices, we give an exact description of the moment fibre by admissible unimodular overlattices; at index two, the only possible ambiguity is a specified four-vertex Godsil--McKay switch.
Related
- A Unified Spectral Framework for Weighted Adjacency-Degree Matrices of Dendrimer and Bethe Trees
- Adjacency-degree algebras and spectral determination of graphs
- Degree Adjacency Diametrical Matrix of Graphs Spectral Properties and Energy Bounds
- Punctured adjacency-degree algebras of Cartesian products
- Uniform adjacency-degree probes from differential rigidity
BibTeX
@misc{lu2026integral,
title = {{Integral saturation of adjacency-degree lattices}},
author = {Zhipeng Lu},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.01838},
eprint = {2611.01838},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.01838},
}
RIS
TY - UNPB
TI - Integral saturation of adjacency-degree lattices
AU - Zhipeng Lu
PY - 2026
DA - 2026/11/01
PB - arXiv
DO - 10.48550/arxiv.2611.01838
UR - https://arxiv.org/abs/2611.01838
AB - Let A be the adjacency matrix of G∼ G(n,1/2), let D=diag(A1), and let Λ_G=ℤ⟨ A,D⟩1. We prove Pr[Λ_G≠ℤ^n]≤ n^−3/20+o(1). Thus two dependent graph operators generate the entire vertex lattice from the constant vector, simultaneously over every prime field. Adjacency alone has a modulo-two rank obstruction for every simple graph of order greater than one, even though its rational word span is typically full. The proof first constructs words containing at most two adjacency operations whose integer span contains Δ_G^3ℤ^n, where Δ_G is the product of the pairwise differences between distinct degree values. This confines all possible arithmetic obstructions to a finite prime range on a single event. We then remove the remaining obstructions using conditional alternating forms, symmetric random-matrix code estimates, and uniform counts of degree-graded invariant subspaces. We connect the integer lattice to graph reconstruction through pointed moments. Saturation forces every pointed orthogonal AD intertwiner to be a vertex permutation. The short-word construction also shows that a fixed polynomial-size family of ordinary caterpillars, of diameter at most seven and order O(√(nlog n)), identifies almost every graph among all finite simple graphs. For nonsaturated full-rank lattices, we give an exact description of the moment fibre by admissible unimodular overlattices; at index two, the only possible ambiguity is a specified four-vertex Godsil--McKay switch.
ER -