Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns

From MaRDI portal
Publication:870036

zbMATH Open1119.82018arXivmath/0607183MaRDI QIDQ870036FDOQ870036

Paul Zinn-Justin

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: We prove the Razumov--Stroganov conjecture relating ground state of the O(1) loop model and counting of Fully Packed Loops in the case of certain types of link patterns. The main focus is on link patterns with three series of nested arches, for which we use as key ingredient of the proof a generalization of the Mac Mahon formula for the number of plane partitions which includes three series of parameters.


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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)





Cited In (10)






This page was built for publication: Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns

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