Integral saturation of adjacency-degree lattices

Let \(A\) be the adjacency matrix of \(G\sim G(n,1/2)\), let \(D=\operatorname{diag}(A\mathbf1)\), and let \(\Lambda_G=\mathbb Z\langle A,D\rangle\mathbf1\). We prove \(\Pr[\Lambda_G\ne\mathbb Z^n]\le 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 \(\Delta_G^3\mathbb Z^n\), where \(\Delta_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(\sqrt{n\log 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.

Authors

Publication Details

Published
2026-11-15
DOI
https://doi.org/10.66977/xsci.2611.002i
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Integral saturation of adjacency-degree lattices

Zhipeng Lu
Graph theory and applications
preprint

Integral saturation of adjacency-degree lattices

Zhipeng Lu
preprint en

Abstract

Let \(A\) be the adjacency matrix of \(G\sim G(n,1/2)\), let \(D=\operatorname{diag}(A\mathbf1)\), and let \(\Lambda_G=\mathbb Z\langle A,D\rangle\mathbf1\). We prove \(\Pr[\Lambda_G\ne\mathbb Z^n]\le 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 \(\Delta_G^3\mathbb Z^n\), where \(\Delta_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(\sqrt{n\log 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.

Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon