Metraipolis › archive › dc_090571c68398
Limit of the octahedron recurrence with GUE boundary data — arXiv:2610.09121
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.09121
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:43:04.151Z
- SHA-256 of the archived text
7c55dc58dda838db1770766225304582de3df87bf2216680481891101646495b- Stable URL of this page
https://metraipolis.com/documento/dc_090571c68398
How to cite
Limit of the octahedron recurrence with GUE boundary data — arXiv:2610.09121 — arXiv (en), https://arxiv.org/abs/2610.09121 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_090571c68398 (Metraipolis archive dc_090571c68398, sha256 7c55dc58dda838db1770766225304582de3df87bf2216680481891101646495b)
BibTeX
@misc{dc090571c68398,
title = {Limit of the octahedron recurrence with GUE boundary data — arXiv:2610.09121},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.09121},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_090571c68398; sha256 7c55dc58dda838db1770766225304582de3df87bf2216680481891101646495b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.09121. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the tropical octahedron recurrence on the lattice tetrahedron $\{(x_1,x_2,x_3,x_4)\in\mathbb Z_{\geq0}^4: x_1+x_2+x_3+x_4=n\}$ with an intrinsic double-hive boundary law. Let $M_1^{(n)},M_2^{(n)},M_3^{(n)}$ be independent standard $n\times n$ GUE matrices and, for fixed $\ell_1,\ell_2,\ell_3>0$, set $ X_r^{(n)}=\ell_r\sqrt n\,M_r^{(n)},\qquad r=1,2,3. $ The boundary law on the two upper panels is the Gibbs density on the cone of double hives whose four exterior sides correspond, in the prescribed orientations, to the spectra of $X_1^{(n)},X_2^{(n)},X_3^{(n)}$, and $X_1^{(n)}+X_2^{(n)}+X_3^{(n)}$. We then perform an octahedron-recurrence sweep to obtain the value at every lattice point of the tetrahedron. After scaling lattice positions by $n^{-1}$ and recurrence values by $n^{-2}$, we prove that the resulting random field converges uniformly in probability to a deterministic Lipschitz function on $\{(x_1,x_2,x_3,x_4)\in\mathbb R_{\geq0}^4: x_1+x_2+x_3+x_4=1\}$. For every strictly interior target lattice point we construct a canonical planar bipartite graph supported on a union of three triangular panels and prove an exact perfect-matching formula for the recurrence value. Its variable weights are explicit interlacing gaps from the minor processes of $X_1^{(n)},X_2^{(n)},X_3^{(n)}$, together with explicit seam and matching-independent terms. The asymptotic analysis of this formula yields a surface-tension variational characterization of the deterministic limit. This matching rule supplies, in the present four-simplex setting, the kind of higher-dimensional combinatorial formula identified as a major cluster-algebra problem by Henriques and Speyer.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.09121 — 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-10-08T12:16:30.191Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).