Computation of principal A-determinants through dimer dynamics

MaRDI QIDQ3086865zbMATH OpenFDO

Authors Jan Stienstra

Publication date 30 March 2011

Full work available at URL https://arxiv.org/abs/0901.3681

zbMATH Keywords

dimer modelKasteleyn matrix

Mathematics Subject Classification ID

Other hypergeometric functions and integrals in several variables (33C70) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: In this note we translate the pictorial description of Gulotta's efficient inverse algorithm (arXiv:0807.3012) into matrix operations, so that it can be implemented on a computer. As an application we point out that this in combination with results from our paper arXiv:0803.3908 provides a fast algorithm for computing the principal A-determinant of Gelfand, Kapranov and Zelevinsky for hypergeometric systems in two variables.

Recommendations

• scientific article; zbMATH DE number 5177
• Computing the Degree of Determinants via Combinatorial Relaxation
• scientific article; zbMATH DE number 1332669
• A simple division-free algorithm for computing determinants
• Faster combinatorial algorithms for determinant and Pfaffian

Cited in

(3)

• Dimer models and Calabi-Yau algebras
• A note on dimer models and McKay quivers
• Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension

This page was built for publication: Computation of principal \({\mathcal A}\)-determinants through dimer dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086865)