Proof of a conjecture of Kenyon and Wilson on semicontiguous minors
classification
🧮 math.CO
keywords
minorscentralconjecturedominokenyonlaurentmatrixpolynomial
read the original abstract
Kenyon and Wilson showed how to test if a circular planar electrical network with $n$ nodes is well-connected by checking the positivity of $\binom{n}{2}$ central minors of the response matrix. Their test is based on the fact that any contiguous minor of a matrix can be expressed as a Laurent polynomial in the central minors. Moreover, the Laurent polynomial is the generating function of domino tilings of a weighted Aztec diamond. They conjectured that a larger family of minors, semicontiguous minors, can also be written in terms of domino tilings of a region on the square lattice. In this paper, we present a proof of the conjecture.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.