Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 15 min ago
PreprintarXiv licencearXiv

Matrix-tree theorem for cohomological electrical networks

Abstract

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.

Related

  1. All-Minors Matrix-Tree Theory for Superport Networks: Completed Quotient-Incidence Determinants and Conductance-Weighted Subdivision Extensions
    Tony Newton
    arXivPreprintCC BY-SA 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  2. Convergence properties of nonlinear RLC electrical networks
    Arjan van der Schaft
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. A simpler proof of the Matrix Spencer Theorem
    Nikhil Bansal, Yunbum Kook
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  4. A Hochschild-Kostant-Rosenberg type theorem for coherent matrix factorizations
    Arnab Kundu, Bhamidi Sreedhar
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. A Short Combinatorial Proof of the Pons-Batle Identity for Counting Tree-Child Networks
    Hao Yu, Louxin Zhang
    arXivPreprintCC BY 4.0Full textEvolutionary biologyCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{pylyavskyy2026matrixtree,
  title = {{Matrix-tree theorem for cohomological electrical networks}},
  author = {Pavlo Pylyavskyy and Svetlana Shirokovskikh and Mikhail Skopenkov},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.14385},
  eprint = {2609.14385},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.14385},
}
RIS
TY  - UNPB
TI  - Matrix-tree theorem for cohomological electrical networks
AU  - Pavlo Pylyavskyy
AU  - Svetlana Shirokovskikh
AU  - Mikhail Skopenkov
PY  - 2026
DA  - 2026/09/13
PB  - arXiv
DO  - 10.48550/arxiv.2609.14385
UR  - https://arxiv.org/abs/2609.14385
AB  - 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.
ER  -