Metraipolis › archive › dc_cd3c2b0e68b2
Matrix-tree theorem for cohomological electrical networks — arXiv:2609.14385
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14385
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:25:19.880Z
- SHA-256 of the archived text
1d2873c58b650a417e856d0c61bd3e5bb35240889c4cb4fabcd91e0a9ba1d7f4- Stable URL of this page
https://metraipolis.com/documento/dc_cd3c2b0e68b2
How to cite
Matrix-tree theorem for cohomological electrical networks — arXiv:2609.14385 — arXiv (en), https://arxiv.org/abs/2609.14385 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cd3c2b0e68b2 (Metraipolis archive dc_cd3c2b0e68b2, sha256 1d2873c58b650a417e856d0c61bd3e5bb35240889c4cb4fabcd91e0a9ba1d7f4)
BibTeX
@misc{dccd3c2b0e68b2,
title = {Matrix-tree theorem for cohomological electrical networks — arXiv:2609.14385},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14385},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cd3c2b0e68b2; sha256 1d2873c58b650a417e856d0c61bd3e5bb35240889c4cb4fabcd91e0a9ba1d7f4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14385. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce a new type of boundary condition for electrical networks by specifying a cohomology class on the underlying cell complex. As special and limiting cases, we recover the Dirichlet boundary condition, multiport condition, and prescribed voltage drops along nontrivial cycles on a surface. In this setting, we obtain a combinatorial formula for minors of the response matrix, generalizing the matrix-tree theorem, the Kenyon-Wilson formula, and a recently discovered formula for networks on surfaces due to Lam et al. To prove this formula, we develop a statistical-physics toolbox, including a new parafermionic observable for the uniform spanning tree model. This is the first parafermionic observable that is intrinsic, in the sense that it does not require an embedding of the graph in the plane or on a surface. Other ingredients are an intrinsic Temperley correspondence and source-synchronized networks, the latter providing a completely elementary reformulation of our results. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.CO). Categorie arXiv: Combinatorics (math.CO) ; Mathematical Physics (math-ph). Pagina del lavoro: https://arxiv.org/abs/2609.14385 — 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-16T00:39:30.212Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).