Metraipolis › archive › dc_de82444eaea0
Integral saturation of adjacency-degree lattices — arXiv:2611.01838
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01838
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:37:26.089Z
- SHA-256 of the archived text
4912da443b881eebc577f107510dfbee21eb1ce089bae4b54c4209ab0eab702e- Stable URL of this page
https://metraipolis.com/documento/dc_de82444eaea0
How to cite
Integral saturation of adjacency-degree lattices — arXiv:2611.01838 — arXiv (en), https://arxiv.org/abs/2611.01838 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_de82444eaea0 (Metraipolis archive dc_de82444eaea0, sha256 4912da443b881eebc577f107510dfbee21eb1ce089bae4b54c4209ab0eab702e)
BibTeX
@misc{dcde82444eaea0,
title = {Integral saturation of adjacency-degree lattices — arXiv:2611.01838},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01838},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_de82444eaea0; sha256 4912da443b881eebc577f107510dfbee21eb1ce089bae4b54c4209ab0eab702e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01838. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $A$ be the adjacency matrix of $G\sim G(n,1/2)$, let $D=\operatorname{diag}(A\mathbf{1})$, and let $\Lambda_G=\mathbb{Z}\langle A,D\rangle\mathbf{1}$. 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.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2611.01838 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:05:22.282Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).