Two counterparts of the TFK formula for cylinder graphs
DOI10.1016/J.JCTA.2022.105722OpenAlexW4320473834MaRDI QIDQ2689002FDOQ2689002
Authors: Mihai Ciucu
Publication date: 6 March 2023
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2022.105722
Recommendations
Determinants, permanents, traces, other special matrix functions (15A15) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Binomial determinants, paths, and hook length formulae
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Statistical Mechanics of Dimers on a Plane Lattice
- Title not available (Why is that?)
- Dimer problem in statistical mechanics-an exact result
- Title not available (Why is that?)
- Enumeration of perfect matchings in graphs with reflective symmetry
- On the Vector Representations of Induced Matroids
- Symmetries of plane partitions
- Nonintersecting paths, pfaffians, and plane partitions
- Periodic Schur process and cylindric partitions
- Cylindric Partitions
- Lozenge tilings and the Gaussian free field on a cylinder
- Title not available (Why is that?)
- Odd symplectic groups
- The Problem of the Calissons
- The periodic Schur process and free fermions at finite temperature
Cited In (3)
This page was built for publication: Two counterparts of the TFK formula for cylinder graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689002)