Search arXivSearch

arXiv · 2609.14385

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pavlo Pylyavskyy, Svetlana Shirokovskikh, Mikhail Skopenkov. 2026-09-13. Matrix-tree theorem for cohomological electrical networks. https://arxiv.org/abs/2609.14385

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO